Learning Sparse Neural Networks through $L_0$ Regularization
Christos Louizos, Max Welling, Diederik P. Kingma

TL;DR
This paper introduces a practical $L_0$ regularization method for neural networks using stochastic gates, enabling effective pruning during training to improve speed and generalization.
Contribution
It proposes a differentiable $L_0$ regularization technique with the hard concrete distribution, allowing joint optimization of network weights and sparsity structure.
Findings
Effective pruning during training improves inference speed.
Regularization enhances model generalization.
Method is compatible with standard gradient-based optimization.
Abstract
We propose a practical method for norm regularization for neural networks: pruning the network during training by encouraging weights to become exactly zero. Such regularization is interesting since (1) it can greatly speed up training and inference, and (2) it can improve generalization. AIC and BIC, well-known model selection criteria, are special cases of regularization. However, since the norm of weights is non-differentiable, we cannot incorporate it directly as a regularization term in the objective function. We propose a solution through the inclusion of a collection of non-negative stochastic gates, which collectively determine which weights to set to zero. We show that, somewhat surprisingly, for certain distributions over the gates, the expected norm of the resulting gated weights is differentiable with respect to the distribution parameters. We further…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGaussian Processes and Bayesian Inference · Stochastic Gradient Optimization Techniques · Domain Adaptation and Few-Shot Learning
MethodsPruning
