Subspace Node Pruning
<|reference_start|>Subspace Node Pruning: Efficiency of neural network inference is undeniably important in a time where commercial use of AI models increases daily. Node pruning is the art of removing computational units such as neurons, filters, attention heads, or even entire layers to significantly reduce inference time while retaining network performance. In this work, we propose the projection of unit activations to an orthogonal subspace in which there is no redundant activity and within which we may prune nodes while simultaneously recovering the impact of lost units via linear least squares. We identify that, for effective node pruning, this subspace must be constructed using a triangular transformation matrix, a transformation which is equivalent to and unnormalized Gram-Schmidt orthogonalization. We furthermore show that the order in which units are orthogonalized can be optimised to maximally reduce node activations in our subspace and thereby form a more optimal ranking of nodes. Finally, we leverage these orthogonal subspaces to automatically determine layer-wise pruning ratios based upon the relative scale of node activations in our subspace, equivalent to cumulative variance. Our proposed method reaches state of the art when pruning ImageNet trained VGG-16 and rivals more complex state of the art methods when pruning ResNet-50 networks across a range of pruning ratios.<|reference_end|>
@article{offergeld2024subspace,
    title={Subspace Node Pruning},
    author={Joshua Offergeld, Marcel van Gerven, Nasir Ahmad},
    journal={arXiv preprint arXiv:2405.17506},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.17506},
    primaryClass={cs.LG cs.CV cs.NE}
}