Title: LEARNING SPARSE NEURAL NETWORKS THROUGH L 0 REGULARIZATION

Abstract: We propose a practical method for L 0 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 L 0 regularization. However, since the L 0 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 L 0 regularized objective is differentiable with respect to the distribution parameters. We further propose the hard concrete distribution for the gates, which is obtained by "stretching" a binary concrete distribution and then transforming its samples with a hard-sigmoid. The parameters of the distribution over the gates can then be jointly optimized with the original network parameters. As a result our method allows for straightforward and efficient learning of model structures with stochastic gradient descent and allows for conditional computation in a principled way. We perform various experiments to demonstrate the effectiveness of the resulting approach and regularizer.

1. INTRODUCTION:

Deep neural networks are flexible function approximators that have been very successful in a broad range of tasks. They can easily scale to millions of parameters while allowing for tractable optimization with mini-batch stochastic gradient descent (SGD), graphical processing units (GPUs) and parallel computation. Nevertheless they do have drawbacks. Firstly, it has been shown in recent works (Han et al., 2015; Ullrich et al., 2017; Molchanov et al., 2017) that they are greatly overparametrized as they can be pruned significantly without any loss in accuracy; this exhibits unnecessary computation and resources. Secondly, they can easily overfit and even memorize random patterns in the data (Zhang et al., 2016) , if not properly regularized. This overfitting can lead to poor generalization in practice.

A way to address both of these issues is by employing model compression and sparsification techniques. By sparsifying the model, we can avoid unnecessary computation and resources, since irrelevant degrees of freedom are pruned away and do not need to be computed. Furthermore, we reduce its complexity, thus penalizing memorization and alleviating overfitting.

A conceptually attractive approach is the L 0 norm regularization of (blocks of) parameters; this explicitly penalizes parameters for being different than zero with no further restrictions. However, the combinatorial nature of this problem makes for an intractable optimization for large models.

In this paper we propose a general framework for surrogate L 0 regularized objectives. It is realized by smoothing the expected L 0 regularized objective with continuous distributions in a way that can maintain the exact zeros in the parameters while still allowing for efficient gradient based optimization. This is achieved by transforming continuous random variables (r.v.s) with a hard nonlinearity, the Figure 1 : L p norm penalties for a parameter θ according to different values of p. It is easily observed that both weight decay and Lasso, p = 2 and p = 1 respectively, impose shrinkage for large values of θ. By gradually allowing p < 1 we observe that the shrinkage is reduced and at the limit of p = 0 we observe that the penalty is a constant for θ = 0. hard-sigmoid. We further propose and employ a novel distribution obtained by this procedure; the hard concrete. It is obtained by "stretching" a binary concrete random variable (Maddison et al., 2016; Jang et al., 2016) and then passing its samples through a hard-sigmoid. We demonstrate the effectiveness of this simple procedure in various experiments.

2 MINIMIZING THE L 0 NORM OF PARAMETRIC MODELS One way to sparsify parametric models, such as deep neural networks, with the least assumptions about the parameters is the following; let D be a dataset consisting of N i.i.d. input output pairs {(x 1 , y 1 ), . . . , (x N , y N )} and consider a regularized empirical risk minimization procedure with an L 0 regularization on the parameters θ of a hypothesis (e.g. a neural network) h(•; θ)1 :

EQUATION

θ * = arg min θ {R(θ)},

where |θ| is the dimensionality of the parameters, λ is a weighting factor for the regularization and L(•) corresponds to a loss function, e.g. cross-entropy loss for classification or mean-squared error for regression. The L 0 norm penalizes the number of non-zero entries of the parameter vector and thus encourages sparsity in the final estimates θ * . The Akaike Information Criterion (AIC) (Akaike, 1998) and the Bayesian Information Criterion (BIC) (Schwarz et al., 1978) , well-known model selection criteria, correspond to specific choices of λ. Notice that the L 0 norm induces no shrinkage on the actual values of the parameters θ; this is in contrast to e.g. L 1 regularization and the Lasso (Tibshirani, 1996) , where the sparsity is due to shrinking the actual values of θ. We provide a visualization of this effect in Figure 1 .

Unfortunately, optimization under this penalty is computationally intractable due to the nondifferentiability and combinatorial nature of 2 |θ| possible states of the parameter vector θ. How can we relax the discrete nature of the L 0 penalty such that we allow for efficient continuous optimization of Eq. 1, while allowing for exact zeros in the parameters? This section will present the necessary details of our approach.

2.1 A GENERAL RECIPE FOR EFFICIENTLY MINIMIZING L 0 NORMS Consider the L 0 norm under a simple re-parametrization of θ:

EQUATION

where the z j correspond to binary "gates" that denote whether a parameter is present and the L 0 norm corresponds to the amount of gates being "on". By letting q(z j |π j ) = Bern(π j ) be a Bernoulli distribution over each gate z j we can reformulate the minimization of Eq. 1 as penalizing the number of parameters being used, on average, as follows:

EQUATION

* , π * = arg min θ,π {R( θ, π)},

where corresponds to the elementwise product. The objective described in Eq. 3 is in fact a special case of a variational bound over the parameters involving spike and slab (Mitchell & Beauchamp, 1988) priors and approximate posteriors; we refer interested readers to appendix A.

Now the second term of the r.h.s. of Eq. 3 is straightforward to minimize however the first term is problematic for π due to the discrete nature of z, which does not allow for efficient gradient based optimization. While in principle a gradient estimator such as the REINFORCE (Williams, 1992) could be employed, it suffers from high variance and control variates (Mnih & Gregor, 2014; Mnih & Rezende, 2016; Tucker et al., 2017) , that require auxiliary models or multiple evaluations of the network, have to be employed. Two simpler alternatives would be to use either the straightthrough (Bengio et al., 2013) estimator as done at Srinivas et al. (2017) or the concrete distribution as e.g. at Gal et al. (2017) . Unfortunately both of these approach have drawbacks; the first one provides biased gradients due to ignoring the Heaviside function in the likelihood during the gradient evaluation whereas the second one does not allow for the gates (and hence parameters) to be exactly zero during optimization, thus precluding the benefits of conditional computation (Bengio et al., 2013) .

Fortunately, there is a simple alternative way to smooth the objective such that we allow for efficient gradient based optimization of the expected L 0 norm along with zeros in the parameters θ. Let s be a continuous random variable with a distribution q(s) that has parameters φ. We can now let the gates z be given by a hard-sigmoid rectification of s2 , as follows:

s ∼ q(s|φ) (4) z = min(1, max(0, s)).

(5)

This would then allow the gate to be exactly zero and, due to the underlying continuous random variable s, we can still compute the probability of the gate being non-zero (active). This is easily obtained by the cumulative distribution function (CDF) Q(•) of s:

EQUATION

i.e. it is the probability of the s variable being positive. We can thus smooth the binary Bernoulli gates z appearing in Eq. 3 by employing continuous distributions in the aforementioned way:

R( θ, φ) = E q(s|φ) 1 N N i=1 L h(x i ; θ g(s)), y i + λ |θ| j=1 1 -Q(s j ≤ 0|φ j ) , (7) θ * , φ * = arg min θ,φ {R( θ, φ)}, g(•) = min(1, max(0, •)).

Notice that this is a close surrogate to the original objective function in Eq. 3, as we similarly have a cost that explicitly penalizes the probability of a gate being different from zero. Now for continuous distributions q(s) that allow for the reparameterization trick (Kingma & Welling, 2014; Rezende et al., 2014) we can express the objective in Eq. 7 as an expectation over a parameter free noise distribution p( ) and a deterministic and differentiable transformation f (•) of the parameters φ and :

EQUATION

which allows us to make the following Monte Carlo approximation to the (generally) intractable expectation over the noise distribution p( ):

EQUATION

L E corresponds to the error loss that measures how well the model is fitting the current dataset whereas L C refers to the complexity loss that measures the flexibility of the model. Crucially, the total cost in Eq. 9 is now differentiable w.r.t. φ, thus enabling for efficient stochastic gradient based optimization, while still allowing for exact zeros at the parameters. One price we pay is that now the gradient of the log-likelihood w.r.t. the parameters φ of q(s) is sparse due to the rectifications; nevertheless this should not pose an issue considering the prevalence of rectified linear units in neural networks. Furthermore, due to the stochasticity at s the hard-sigmoid gate z is smoothed to a soft version on average, thus allowing for gradient based optimization to succeed, even when the mean of s is negative or larger than one. An example visualization can be seen in Figure 2b . It should be noted that a similar argument was also shown at Bengio et al. (2013) , where with logistic noise a rectifier nonlinearity was smoothed to a softplus3 on average.

2.2. THE HARD CONCRETE DISTRIBUTION:

The framework described in Section 2.1 gives us the freedom to choose an appropriate smoothing distribution q(s). A choice that seems to work well in practice is the following; assume that we have a binary concrete (Maddison et al., 2016; Jang et al., 2016) random variable s distributed in the (0, 1) interval with probability density q s (s|φ) and cumulative density Q s (s|φ). The parameters of the distribution are φ = (log α, β), where log α is the location and β is the temperature. We can "stretch" this distribution to the (γ, ζ) interval, with γ < 0 and ζ > 1, and then apply a hard-sigmoid on its random samples:

EQUATION

This would then induce a distribution where the probability mass of q s(s|φ) on the negative values, Q s(0|φ), is "folded" to a delta peak at zero, the probability mass on values larger than one, 1 -Q s(1|φ), is "folded" to a delta peak at one and the original distribution q s(s|φ) is truncated to the (0, 1) range. We provide more information and the density of the resulting distribution at the appendix.

Notice that a similar behavior would have been obtained even if we passed samples from any other distribution over the real line through a hard-sigmoid. The only requirement of the approach is that we can evaluate the CDF of s at 0 and 1. The main reason for picking the binary concrete is its close ties with Bernoulli r.v.s. It was originally proposed at Maddison et al. (2016) ; Jang et al. (2016) as a smooth approximation to Bernoulli r.vs, a fact that allows for gradient based optimization of its parameters through the reparametrization trick. The temperature β controls the degree of approximation, as with β = 0 we can recover the original Bernoulli r.v. (but lose the differentiable properties) whereas with 0 < β < 1 we obtain a probability density that concentrates its mass near the endpoints (e.g. as shown in Figure 2a ). As a result, the hard concrete also inherits the same theoretical properties w.r.t. the Bernoulli distribution. Furthermore, it can serve as a better approximation of the discrete nature, since it includes {0, 1} in its support, while still allowing for (sub)gradient optimization of its parameters due to the continuous probability mass that connects those two values. We can also view this distribution as a "rounded" version of the original binary The expected value of the afforementioned concrete and hard concrete gate as a function of the location log α, obtained by averaging 10000 samples. We also added the value of the gates obtained by removing the noise entirely. We can see that the noise smooths the hard-sigmoid to a sigmoid on average.

concrete, where values larger than 1-γ ζ-γ are rounded to one whereas values smaller than -γ ζ-γ are rounded to zero. We provide an example visualization of the hard concrete distribution in Figure 2a .

The L 0 complexity loss of the objective in Eq. 9 under the hard concrete r.v. is conveniently expressed as follows:

EQUATION

At test time we use the following estimator for the final parameters θ * under a hard concrete gate:

EQUATION

) 2.3 COMBINING THE L 0 NORM WITH OTHER NORMS

While the L 0 norm leads to sparse estimates without imposing any shrinkage on θ it might still be desirable to impose some form of prior assumptions on the values of θ with alternative norms, e.g. impose smoothness with the L 2 norm (i.e. weight decay). In the following we will show how this combination is feasible for the L 2 norm. The expected L 2 norm under the Bernoulli gating mechanism can be conveniently expressed as:

EQUATION

where π j corresponds to the success probability of the Bernoulli gate z j . To maintain a similar expression with our smoothing mechanism, and avoid extra shrinkage for the gates z j , we can take into account that the standard L 2 norm penalty is proportional to the negative log density of a zero mean Gaussian prior with a standard deviation of σ = 1. We will then assume that the σ for each θ is governed by z in a way that when z = 0 we have that σ = 1 and when z > 0 we have that σ = z. As a result, we can obtain the following expression for the L 2 penalty (where θ = θ σ ):

EQUATION

2.4 GROUP SPARSITY UNDER AN L 0 NORM For reasons of computational efficiency it is usually desirable to perform group sparsity instead of parameter sparsity, as this can allow for practical computation savings. For example, in neural networks speedups can be obtained by employing a dropout (Srivastava et al., 2014) like procedure with neuron sparsity in fully connected layers or feature map sparsity for convolutional layers (Wen et al., 2016; Louizos et al., 2017; Neklyudov et al., 2017) . This is straightforward to do with hard concrete gates; simply share the gate between all of the members of the group. The expected L 0 and, according to section 2.3, L 2 penalties in this scenario can be rewritten as:

EQUATION

)

EQUATION

)

where |G| corresponds to the number of groups and |g| corresponds to the number of parameters of group g. For all of our subsequent experiments we employed neuron sparsity, where we introduced a gate per input neuron for fully connected layers and a gate per output feature map for convolutional layers. Notice that in the interpretation we adopt the gate is shared across all locations of the feature map for convolutional layers, akin to spatial dropout (Tompson et al., 2015) . This can lead to practical computation savings while training, a benefit which is not possible with the commonly used independent dropout masks per spatial location (e.g. as at Zagoruyko & Komodakis (2016) ).

3. RELATED WORK:

Compression and sparsification of neural networks has recently gained much traction in the deep learning community. The most common and straightforward technique is parameter / neuron pruning (LeCun et al., 1990) according to some criterion. Whereas weight pruning (Han et al., 2015; Ullrich et al., 2017; Molchanov et al., 2017) is in general inefficient for saving computation time, neuron pruning (Wen et al., 2016; Louizos et al., 2017; Neklyudov et al., 2017) can lead to computation savings. Unfortunately, all of the aforementioned methods require training the original dense network thus precluding the benefits we can obtain by having exact sparsity on the computation during training. This is in contrast to our approach where sparsification happens during training, thus theoretically allowing conditional computation to speed-up training (Bengio et al., 2013; 2015) .

Emulating binary r.v.s with rectifications of continuous r.v.s is not a new concept and has been previously done with Gaussian distributions in the context of generative modelling (Hinton & Ghahramani, 1997; Harva & Kabán, 2007; Salimans, 2016) and with logistic distributions at (Bengio et al., 2013) in the context of conditional computation. These distributions can similarly represent the value of exact zero, while still maintaining the tractability of continuous optimization. Nevertheless, they are sub-optimal when we require approximations to binary r.v.s (as is the case for the L 0 penalty); we cannot represent the bimodal behavior of a Bernoulli r.v. due to the fact that the underlying distribution is unimodal. Another technique that allows for gradient based optimization of discrete r.v.s are the smoothing transformations proposed by Rolfe ( 2016). There the core idea is that if a model has binary latent variables, then we can smooth them with continuous noise in a way that allows for reparametrization gradients. There are two main differences with the hard concrete distribution we employ here; firstly, the double rectification of the hard concrete r.v.s allows us to represent the values of exact zero and one (instead of just zero) and, secondly, due to the underlying concrete distribution the random samples from the hard concrete will better emulate binary r.v.s.

4. EXPERIMENTS:

We validate the effectiveness of our method on two tasks. The first corresponds to the toy classification task of MNIST using a simple multilayer perceptron (MLP) with two hidden layers of size 300 and 100 (LeCun et al., 1998) , and a simple convolutional network, the LeNet-5-Caffe 4 . The second corresponds to the more modern task of CIFAR 10 and CIFAR 100 classification using Wide Residual Networks (Zagoruyko & Komodakis, 2016) . For all of our experiments we set γ = -0.1, ζ = 1.1 and, following the recommendations from Maddison et al. (2016) , set β = 2/3 for the concrete distributions. We initialized the locations log α by sampling from a normal distribution with a standard deviation of 0.01 and a mean that yields α α+1 to be approximately equal to the original dropout rate employed at each of the networks. We used a single sample of the gate z for each minibatch of datapoints during the optimization, even though this can lead to larger variance in the gradients (Kingma et al., 2015) . In this way we show that we can obtain the speedups in training with practical implementations, without actually hurting the overall performance of the network.

4.1. MNIST CLASSIFICATION AND SPARSIFICATION:

For these experiments we did no further regularization besides the L 0 norm and optimization was done with Adam (Kingma & Ba, 2014) using the default hyper-parameters and temporal averaging.

We can see at Table 1 that our approach is competitive with other methods that tackle neural network compression. However, it is worth noting that all of these approaches prune the network post-training using thresholds while requiring training the full network. We can further see that our approach minimizes the amount of parameters more at layers where the gates affect a larger part of the cost; for the MLP this corresponds to the input layer whereas for the LeNet5 this corresponds to the first fully connected layer. In contrast, the methods with sparsity inducing priors (Louizos et al., 2017; Neklyudov et al., 2017) sparsify parameters irrespective of that extra cost (since they are only encouraged by the prior to move parameters to zero) and as a result they achieve similar sparsity on all of the layers. Nonetheless, it should be mentioned that we can in principle increase the sparsification on specific layers simply by specifying a separate λ for each layer, e.g. by increasing the λ for gates that affect less parameters. We provide such results at the "λ sep." rows.

Table 1 : Comparison of the learned architectures and performance of the baselines from Louizos et al. (2017) and the proposed L 0 minimization under L 0 hc . We show the amount of neurons left after pruning with the estimator in Eq. 13 along with the error in the test set after 200 epochs. N denotes the number of training datapoints.

Network & size Method:

Pruned architecture Error (%) MLP Sparse VD (Molchanov et al., 2017) 512-114-72 1.8 784-300-100 BC-GNJ (Louizos et al., 2017) 278-98-13 1.8 BC-GHS (Louizos et al., 2017) 311-86-14 1.8

L 0 hc , λ = 0.1/N 219-214-100 1.4 L 0 hc , λ sep.

266-88-33 1.8

LeNet-5-Caffe Sparse VD (Molchanov et al., 2017) 14-19-242-131 1.0 20-50-800-500 GL (Wen et al., 2016) 3-12-192-500 1.0 GD (Srinivas & Babu, 2016) 7-13-208-16 1.1 SBP (Neklyudov et al., 2017) 3-18-284-283 0.9 BC-GNJ (Louizos et al., 2017) 8-13-88-13 1.0 BC-GHS (Louizos et al., 2017) 5-10-76-16 1.0 L 0 hc , λ = 0.1/N 20-25-45-462 0.9 L 0 hc , λ sep. 9-18-65-25 1.0

To get a better idea about the potential speedup we can obtain in training we plot in Figure 3 the expected, under the probability of the gate being active, floating point operations (FLOPs) as a function of the training iterations. We also included the theoretical speedup we can obtain by using dropout (Srivastava et al., 2014) networks. As we can observe, our L 0 minimization procedure that is targeted towards neuron sparsity can potentially yield significant computational benefits compared to the original or dropout architectures, with minimal or no loss in performance. We further observe that there is a significant difference in the flop count for the LeNet model between the λ = 0.1/N and λ sep. settings. This is because we employed larger values for λ (10/N and 0.5/N ) for the convolutional layers (which contribute the most to the computation) in the λ sep. setting. As a result, this setting is more preferable when we are concerned with speedup, rather than network compression (which is affected only by the number of parameters). 

4.2. CIFAR CLASSIFICATION:

For WideResNets we apply L 0 regularization on the weights of the hidden layer of the residual blocks, i.e. where dropout is usually employed. We also employed an L 2 regularization term as described in Section 2.3 with the weight decay coefficient used in Zagoruyko & Komodakis (2016) . For the layers with the hard concrete gates we divided the weight decay coefficient by 0.7 to ensure that a-priori we assume the same length-scale as the 0.3 dropout equivalent network. For optimization we employed the procedure described in Zagoruyko & Komodakis (2016) with a minibatch of 128 datapoints, which was split between two GPUs, and used a single sample for the gates for each GPU.

Table 2 : Results on the benchmark classification tasks of CIFAR 10 and CIFAR 100. All of the baseline results are taken from Zagoruyko & Komodakis (2016) . For the L 0 regularized WRN we report the median of the error on the test set after 200 epochs over 5 runs.

Network CIFAR-10 CIFAR-100 original-ResNet-110 (He et al., 2016a) 6.43 25.16 pre-act-ResNet-110 (He et al., 2016b) 6.37 - WRN-28-10 (Zagoruyko & Komodakis, 2016) 4.00 21.18 WRN-28-10-dropout (Zagoruyko & Komodakis, 2016) 3 As we can observe at Table 2 , with a λ of 0.001/N the L 0 regularized wide residual network improves upon the accuracy of the dropout equivalent network on both CIFAR 10 and CIFAR 100. Furthermore, it simultaneously allows for potential training time speedup due to gradually decreasing the number of FLOPs, as we can see in Figures 4a, 4b . This sparsity is also obtained without any "lag" in convergence speed, as at Figure 4c we observe a behaviour that is similar to the dropout network. Finally, we observe that by further increasing λ we obtain a model that has a slight error increase but can allow for a larger speedup.

5. DISCUSSION:

We have described a general recipe that allows for optimizing the L 0 norm of parametric models in a principled and effective manner. The method is based on smoothing the combinatorial problem with continuous distributions followed by a hard-sigmoid. To this end, we also proposed a novel distribution which we coin as the hard concrete; it is a "stretched" binary concrete distribution, the samples of which are transformed by a hard-sigmoid. This in turn better mimics the binary nature of Bernoulli distributions while still allowing for efficient gradient based optimization. In experiments we have shown that the proposed L 0 minimization process leads to neural network sparsification that is competitive with current approaches while theoretically allowing for speedup in training. We have further shown that this process can provide a good inductive bias and regularizer, as on the CIFAR experiments with wide residual networks we improved upon dropout.

As for future work; better harnessing the power of conditional computation for efficiently training very large neural networks with learned sparsity patterns is a potential research direction. It would be also interesting to adopt a full Bayesian treatment over the parameters θ, such as the one employed at Molchanov et al. (2017) ; Louizos et al. (2017) . This would then allow for further speedup and compression due to the ability of automatically learning the bit precision of each weight. Finally, it would be interesting to explore the behavior of hard concrete r.v.s at binary latent variable models, since they can be used as a drop in replacement that allow us to maintain both the discrete nature as well as the efficient reparametrization gradient optimization.

Published as a conference paper at ICLR 2018 slab prior and approximate posterior over a parameter vector θ:

F = -E q(z)q(θ|z) [log p(D|θ)] + |θ| j=1 KL(q(z j )||p(z j ))+ + |θ| j=1

q(z j = 1)KL(q(θ j |z j = 1)||p(θ j |z j = 1))+ + q(z j = 0)KL(q(θ j |z j = 0)||p(θ j |z j = 0))

= -E q(z)q(θ|z) [log p(D|θ)]

EQUATION

where the last step is due to KL(q(θ j |z j = 0)||p(θ j |z j = 0)) = 05 . The term that involves KL(q(z j )||p(z j )) corresponds to the KL-divergence from the Bernoulli prior p(z j ) to the Bernoulli approximate posterior q(z j ) and KL(q(θ j |z j = 1)||p(θ j |z j = 1)) can be interpreted as the "code cost" or else the amount of information the parameter θ j contains about the data D, measured by the KL-divergence from the prior p(θ j |z j = 1).

Now consider making the assumption that we are optimizing, rather than integrating, over θ and further assuming that KL(q(θ j |z j = 1)||p(θ j |z j = 1)) = λ. We can justify this assumption from an empirical Bayesian procedure: there is a hypothetical prior for each parameter p(θ j |z j = 1) that adapts to q(θ j |z j = 1) in a way that results into needing, approximately, λ nats to transform p(θ j |z j = 1) to that particular q(θ j |z j = 1). Those λ nats are thus the amount of information the q(θ j |z j = 1) can encode about the data had we used that p(θ j |z j = 1) as the prior. Notice that under this view we can consider λ as the amount of flexibility of that hypothetical prior; with λ = 0 we have a prior that is flexible enough to represent exactly q(θ j |z j = 1), thus resulting into no code cost and possible overfitting. Under this assumption the variational free energy can be re-written as: 

F = -E q(z

where θ corresponds to the optimized θ and the last step is due to the positivity of the KL-divergence. Now by taking the negative log-probability of the data to be equal to the loss L(•) of Eq. 1 we see that Eq. 22 is the same as Eq. 3. Note that in case that we are interested over the uncertainty of the gates z, we should optimize Eq. 21, rather than Eq. 22, as this will properly penalize the entropy of q(z). Furthermore, Eq. 21 also allows for the incorporation of prior information about the behavior of the gates (e.g. gates being active 10% of the time, on average). We have thus shown that the expected L 0 minimization procedure is in fact a close surrogate to a variational bound involving a spike and slab distribution over the parameters and a fixed coding cost for the parameters when the gates are active.

B THE HARD CONCRETE DISTRIBUTION:

As mentioned in the main text, the hard concrete is a straightforward modification of the binary concrete (Maddison et al., 2016; Jang et al., 2016) ; let q s (s|φ) be the probability density function

:

This assumption is just for ease of explanation; our proposed framework can be applied to any objective function involving parameters.

We chose to employ a hard-sigmoid instead of a rectifier, g(•) = max(0, •), so as to have the variable z better mimic a binary gate (rather than a scale variable).

f (x) = log(1 + exp(x)).

https://github.com/BVLC/caffe/tree/master/examples/mnist

We can see that this is indeed the case by taking the limit of σ → 0 of the KL divergence of two Gaussians that have the same mean and variance.

Figures and Tables:

Figure 2: (a) The binary concrete distribution with location log α = 0 and temperature β = 0.5 and the hard concrete equivalent distribution obtained by stretching the concrete distribution to (γ = -0.1, ζ = 1.1) and then applying a hard-sigmoid. Under this specification the hard concrete distribution assigns, roughly, half of its mass to {0, 1} and the rest to (0, 1). (b) The expected value of the afforementioned concrete and hard concrete gate as a function of the location log α, obtained by averaging 10000 samples. We also added the value of the gates obtained by removing the noise entirely. We can see that the noise smooths the hard-sigmoid to a sigmoid on average.

(a) Expected FLOPs at the MLP. (b) Expected FLOPs at LeNet5.

Figure 3: Expected number of floating point operations (FLOPs) during training for the original, dropout and L 0 regularized networks. These were computed by assuming one flop for multiplication and one flop for addition.

Figure 4: (a, b) Expected number of FLOPs during training for the dropout and L 0 regularized WRNs for CIFAR 10 (a) and CIFAR 100 (b). The original WRN is not shown as it has the same practical FLOPs as the dropout equivalent network. (c) Train (dashed) and test (solid) error as a function of the training epochs for dropout and L 0 WRNs at CIFAR 10.

) [log p(D| θ z)] + |θ| j=1 KL(q(z j )||p(z j )) + λ |θ| j=1 q(z j = 1) (21) ≥ -E q(z) [log p(D| θ z)] + λ |θ| j=1 π j ,

Peer review (iclr2018):
 Learning sparse neural networks through L0 regularisation Summary: The authors introduce a gradient-based approach to minimise an objective function with an L0 sparse penalty. The problem is relaxed onto a continuous optimisation by changing an expectation over discrete variables (representing whether a variable is present or not) to an expectation over continuous variables, inspired by earlier work from Maddison et al (ICLR 2017) where a similar transformation was used to learn over discrete variable prediction tasks with neural networks. Here the application is to learn sparse feedforward networks in standard classification tasks, although the framework described is quite general and could be used to impose L0 sparsity to any objective function in principal. The method provides equivalent accuracy and sparsity to published state-of-the-art results on these datasets but it is argue that learning sparsity during the training process will lead to significant speed-ups - this is demonstrated by comparing to a theoretical benchmark (standard training with dropout) rather than through empirical testing against other implementations. Pros: The paper is well written and the derivation of the method is easy to follow with a good explanation of the underlying theory. Optimisation under L0 regularisation is a difficult and generally important topic and certainly has advantages over other sparse inference objective functions that impose shrinkage on non-sparse parameters. The work is put in context and related to some previous relaxation approaches to sparsity. The method allows for sparsity to be learned during training rather than after training (as in standard dropout approaches) and this allows the algorithm to obtain significant per-iteration speed-ups, which improves through training. Cons: The method is applied to standard neural network architectures and performance in terms of accuracy and final achieved sparsity is comparable to the state-of-the-art methods. Therefore the main advance is in terms of learning speed to obtain this similar performance. However, the learning speed-up is presented against a theoretical FLOPs estimate per iteration for a similar network with dropout. It would be useful to know whether the number of iterations to achieve a particular performance is equivalent for all the different architectures considered, e.g. does the proposed sparse learning method converge at the same rate as the others? I felt a more thorough experimental section would have greatly improved the work, focussing on this learning speed aspect. It was unclear how much tuning of the lambda hyper-parameter, which tunes the sparsity, would be required in a practical application since tuning this parameter would increase computation time. It might be useful to provide a full Bayesian treatment so that the optimal sparsity can be chosen through hyper-parameter learning. Minor point: it wasn’t completely clear to me why the fact (3) is a variational approximation to a spike-and-slab is important (Appendix). I don’t see why the spike-and-slab is any more fundamental than the L0 norm prior in (2), it is just more convenient in Bayesian inference because it is an iid prior and potentially allows an informative prior over each parameter. In the context here this didn’t seem a particularly relevant addition to the paper.