L AYER S PARSITY IN N EURAL N ETWORKS
Anonymous authors
Paper under double-blind review
A BSTRACT
Sparsity has become popular in machine learning, because it can save computational resources, facilitate interpretations, and prevent overﬁtting.
In this paper, we discuss sparsity in the framework of neural networks.
In particular, we formulate a new notion of sparsity that concerns the networks’ layers and, therefore, aligns particularly well with the current trend toward deep networks.
We call this notion layer sparsity.
We then introduce corresponding regularization and reﬁtting schemes that can complement standard deep-learning pipelines to generate more compact and accurate networks.
I NTRODUCTION
The number of layers and the number of nodes in each layer are arguably among the most fundamental parameters of neural networks.
But specifying these parameters can be challenging: deep and wide networks, that is, networks with many layers and nodes, can describe data in astounding detail, but they are also prone to overﬁtting and require large memory, CPU, energy, and so forth.
The resource requirements can be particularly problematic for real-time applications or applications on ﬁtness trackers and other wearables, whose popularity has surged in recent years.
A promising approach to meet these challenges is to ﬁt networks sizes adaptively, that is, to allow for many layers and nodes in principle, but to ensure that the ﬁnal network is “simple” in that it has a small number of connections, nodes, or layers (Changpinyo et al., 2017; Han et al., 2016;
Kim et al., 2016; Liu et al., 2015; Wen et al., 2016).
Popular ways to ﬁt such simple and compact networks include successively augmenting small networks (Ash, 1989; Bello, 1992), pruning large networks (Simonyan & Zisserman, 2015), or explicit sparsity-inducing regularization of the weight matrices, which we focus on here.
An example is the (cid:96) 1 -norm, which can reduce the number of connections.
Another example is the (cid:96) 1 -norm grouped over the rows of the weight matrices, which can reduce the number of nodes.
It has been shown that such regularizers can indeed produce networks that are both accurate and yet have a small number of nodes and connections either in the ﬁrst layer (Feng & Simon, 2017) or overall (Alvarez &
Salzmann, 2016; Liu et al., 2015; Scardapane et al., 2017).
Such sparsity-inducing regularizers also have a long-standing tradition and thorough theoretical underpinning in statistics (Hastie et al., 2015).
But while sparsity on the level of connections and nodes has been studied in some detail, sparsity on the level of layers is much less understood.
This lack of understanding contrasts the current trend to deep network architectures, which is supported by state-of-the-art performances of deep networks (LeCun et al., 2015; Schmidhuber, 2015), recent approximation theory for ReLU activation networks (Liang & Srikant, 2016; Telgarsky, 2016; Yarotsky, 2017), and recent statistical theory (Golowich et al., 2017; Kohler & Langer, 2019; Taheri et al., 2020).
Hence, a better understanding of sparsity on the level of layers seems to be in order.
Therefore, we discuss in this paper sparsity with a special emphasis on the networks’ layers.
Our key observation is that for typical activation functions such as ReLU, a layer can be removed if all its parameter values are non-negative.
We leverage this observation in the development of a new regularizer that speciﬁcally targets sparsity on the level of layers, and we show that this regularizer can lead to more compact and more accurate networks.
Our three main contributions are:
We introduce a new notion of sparsity that we call layer sparsity .
We introduce a corresponding regularizer that can reduce network sizes.
We introduce an additional reﬁtting step that can further improve prediction accuracies
In Section 2, we specify our framework, discuss different notions of sparsity, and introduce our reﬁtting scheme.
In Section 3, we establish a numerical proof of concept.
In Section 4, we conclude with a discussion.
S PARSITY IN N EURAL N ETWORKS
We ﬁrst state our framework, then discuss different notions of sparsity, and ﬁnally introduce a reﬁtting scheme.
2. M ATHEMATICAL F RAMEWORK
To ﬁx ideas, we ﬁrst consider fully-connected neural networks that model data according to
[Equation]
where i ∈ { 1 , . . . , n } indexes the n different samples, y i ∈ R is the output,
x i ∈ R
d is the corresponding input with d the input dimension, l is the number of layers, W j ∈ R p
j × p j +1 for j ∈ { 1 , . . .
, l } are the weight matrices with p 1 = 1 and p l +
=
d , f j : R p j
→ R p j for j ∈ { 1 , . . .
, l } are the activation functions, and u i ∈ R is the random noise.
Extensions beyond fully-connected networks are straightforward—see Section 2.5.
We summarize the parameters in W :=
( W 1 , . . .
, W l ) ∈ V :=
{ V = ( V 1 , . .
, V l ) :
V j ∈ R p
j × p j +1 } ,
and we write for ease of notation
[Equation]
for V ∈ V .
Neural networks are usually ﬁtted based on regularized estimators in Lagrange
[Equation]
or constraint form
[Equation]
where DataFit : R n × R n × d is a data-ﬁtting function such as least-squares (cid:80) ni
=
( y i − f V [ x i ]) 2 , and h : V → [0 , ∞ ) is a regularizer such as the elementwise (cid:96) 1 -norm (cid:80) j,k,l | ( V j ) kl | .
We are particularly interested in regularizers that induce sparsity.
2. S TANDARD N OTIONS OF S PARSITY
We ﬁrst state two regularizers that are known in deep learning and the corresponding notions of sparsity.
Connection sparsity Consider the vanilla (cid:96) 1 -regularizer h C
[ V ] := l (cid:88) j = ( r C ) j ||| V j ||| 1 :=
l (cid:88)
j = ( r C ) j p j (cid:88) v = p j +1 (cid:88) w = | ( V j ) vw | , where r C ∈ [0 , ∞ ) l is a vector of tuning parameters.
This regularizer is the deep learning equivalent of the lasso regularizer in linear regression (Tibshirani, 1996) and has received considerable attention no sparsity input output connection sparsity input output node sparsity input output layer sparsity input output combined sparsity input output recently (Barron & Klusowski, 2018; 2019;
Kim et al., 2016).
The regularizer acts on each individual connection, pruning a full network (ﬁrst network from the left in Figure 1) to a more sparsely connected network (second network in Figure 1).
We, therefore, propose to speak of connection sparsity.
Node sparsity Consider a grouped version of the above regularizer
[Equation]
(cid:118)(cid:117)(cid:117)(cid:116)
[Equation] [Equation] where r N ∈ [0 , ∞ ) l is again a vector of tuning parameters.
This regularizer is the deep learning equivalent of the group lasso regularizer in linear regression (Bakin, 1999) and has received some attention recently (Alvarez & Salzmann, 2016;
Feng & Simon, 2017; Scardapane et al., 2017).
The regularizer acts on all connections that go into a node simultaneously, rendering entire nodes inactive (third network in Figure 1).
We, therefore, propose to speak of node sparsity.
2. L AYER S PARSITY
We now complement the two existing regularizers and notions of sparsity with a new, third notion.
Layer sparsity Consider the regularizer
[Equation]
where r L ∈ [0 , ∞ ) l − 1 is a vector of tuning parameters, and neg[ a ] := min { a, 0 } is the negative part of a real value a ∈ R .
This regularizers does not have an equivalent in linear regression, and it is also new in deep learning.
We argue that the regularizer can give rise to a new type of sparsity.
The regularizer can be disentangled along the layers according to
[Equation]
with
[Equation]
for j ∈ { 1 , . . .
, l − 1 } .
We then focus on an individual inner layer, that is, a layer that corresponds to an index j ∈ { 2 , . . .
, l − 1 } .
To ﬁx ideas, we consider the popular ReLU activation (Glorot et al., 2011; Hahnloser, 1998;
Hahnloser et al., 2000; Salinas & Abbott, 1996); in other words, we consider ( f j ) q [ t ] := f ReLU [ t ] := max { t, 0 } for all j ∈ { 2 , . . .
, l } , q ∈ { 1 , . .
. , p j } , and t ∈ R (the activation of the output layer can be arbitrary).
It is now easy to show that the regularizer h L indeed induces sparsity on the level of layers.
Theorem 1 (Layer Sparsity) .
Consider j ∈ { 2 , . .
, l − 1 } , and deﬁne a merged weight matrix as
V j
[Equation]
,j := V
[Equation]
− 1 V j ∈ R p j − 1 × p j +1 .
It holds that
[Equation]
[Equation]
for all z ∈
[Equation]
Proof of Theorem 1.
If h L ,j [ V j ] = 0 , then ( V j ) qm ≥ 0 for all q ∈ { 1 , . . . , p j } , m ∈ { 1 , . . . , p j +1 } .
Hence, it holds for all q ∈ { 1 , . .
. , p j } that ( V j z ) q ≥ 0 and, therefore, that f j [ V j z ] =
V j z .
The theorem follows then by the fact that V j − 1 ,j = V j − 1 V j .
A key property of the ReLU function is positive homogeneity.
That positive homogeneity can allow for moving weights between layers had been observed in Barron & Klusowski (2018); here, we use the positive homogeneity to merge layers.
The idea is as follows: h L ,j [ V j ] = 0 means in view of the stated theorem that we can redeﬁne the network of depth l as a network of depth l − 1 by removing the function f j , replacing the weights V j − 1 by V j − 1 ,j , and then removing the j th layer altogether.
Theorem 1 can be applied sequentially to neighboring layers; hence, the regularization can merge not only one but many layers into one.
In conclusion, our new regularizer h L acts on all nodes and connections of each layer simultaneously, rendering entire layers inactive (fourth network in Figure 1).
We, therefore, propose to speak of layer sparsity.
The concept of layer sparsity and Theorem 1 in particular do not hinge on the exact choice of the regularizer in (5): one can take any function h L that can be disentangled along the layers as described and that ensures the fact that h L ,j [ V j ] = 0 implies min k,l ( V j ) kl ≥ 0 .
We illustrate layer sparsity with two examples.
Example 1 (Identity Activation) .
We ﬁrst highlight the meaning of layer sparsity in a simplistic setting that does not rely on Theorem 1.
We consider identity activation, that is, ( f j ) q
[ t ] = t for all j ∈ { 2 , . . .
, l } , q ∈ { 1 , . .
. , p j } , and t ∈ R .
The networks in (2) can then be written as
[Equation]
In other words, the initial l -layer network can be compressed into a one-layer network with activation function f 1 and parameter matrix V 1 · · · V l ∈ R 1 × d .
This setting with identity activation is, of course, purely academic, but it motivates an important question: can parts of networks be compressed similarly in the case of ReLU?
Theorem 1 gives an answer to this question: if h L ,j [ V j ] = 0 , then the j th and ( j − 1) th layers can be combined.
In the extreme case h L , 2 [ V 2 ] = · · · = h L ,l [ V l ] = 0 and non-negative input, the network can be condensed into a one-layer network just as in the linear case.
In this sense, one can understand our layer regularizer is as a measure for the networks’ “distance to linearity.”
We detail this further in the following example.
Example 2 (ReLU Activation) .
We now illustrate how layer sparsity compresses and, therefore, simpliﬁes networks in the case of ReLU activation.
We ﬁx an initial network f N parameterized by N ∈ V .
We identify the active layers of the network by
[Equation]
Thus, S and { 1 , . . .
, l } \ S contain the indexes of the relevant and irrelevant layers, respectively.
(We always consider the input and output layers as active.)
The level of sparsity, that is, the number of active layers, is s := |S| ≤ l .
Observe ﬁrst that the theorem’s restriction to z ’s that have non-negative elements makes sense: by the deﬁnition of f ReLU , the outputs of every ReLU layer are non-negative.
We now denote the indexes in S in an orderly fashion: j 1 , . . .
, j s ∈ S such that j 1 < · · · < j s = l .
We then deﬁne scaled versions of the corresponding merged matrices: if j i − 1 ∈ S or j i ∈ { 1 , l } , we do the “trivial merge”
M j i :=
N j i ∈ R p ji × p ji +1 ; otherwise, we do the “non-trivial merge”
[Equation]
In other words, we merge all irrelevant layers between the j i − 1 th and j i th layers into the j i th layer.
We can then compress the data-generating model in (1) into
[Equation]
with M :
= ( M j 1 , . .
M j s ) ∈ V S :
= { V = ( V 1 , . .
, V s ) :
V i ∈ R
p ji − 1+1 × p ji +1 } .
Formulated differently, we can condense the original network according to
[Equation]
that is, we can formulate the initial ReLU activation network with l layers as a new ReLU activation network with s layers.
The new network is still a ReLU activation network but has a smaller number of layers if s < l and, consequently, a smaller number of parameters in total: the total number of parameters in the initial network is (cid:80) lj
=
( p j × p j +1 ) , while the total number of parameters in the transformed network is only (cid:80) si =1 ( p [Equation] i − 1 +1 × p
j i +1 ) .
Our concept for regularizing layers is substantially different from existing ones: our layer-wise regularizer induces weights to be non-negative , whereas existing layer-wise regularizers induce weights to be zero (Wen et al., 2016, Section 3.3).
The two main advantages of our approach are that it (i) does not require shortcuts to avoid trivial networks and (ii) does not implicitly enforce connection or node sparsity.
We thus argue that our layer sparsity is a much more natural and appropriate way to capture and regularize network depths.
Layer sparsity more closely relates to ResNets (He et al., 2016).
The recent popularity of ResNets is motivated by two observations: 1.
Solvers seem to struggle with ﬁnding good minima of deep networks; even training accuracies can deteriorate when increasing the number of layers.
Allowing for linear mappings that short-circuit parts of the network seem to help solvers in ﬁnding better minima.
From our viewpoint here, one can argue that ResNets use these linear mappings to regulate network depths adaptively and, therefore, are related to layer sparsity.
But importantly, ResNets are even more complex than the networks they are based on, while our notion simpliﬁes networks.
Since, as one can verify again readily, all three regularizers are convex, any combination of them is also convex.
Such combinations can be used to obtain networks that are sparse in two or all three aspects (last network in Figure 1).
2. R EFITTING
Sparse networks can be used directly, but they can also be a basis for further optimization: one can adjust the network architecture according to the non-zero pattern of the sparse network and then re-estimate the parameters of this smaller network.
Such strategies are well-known in statistics and machine learning under the name reﬁtting (Lederer, 2013;
Chzhen et al., 2019).
The theoretical underpinning of these strategies is the insight that regularization creates a bias that—in certain cases—can be alleviated by a subsequent “unbiasing” step.
In deep learning, reﬁtting has been studied recently under the name lottery-ticket hypothesis (Frankle & Carbin, 2019).
We now formulate a version of reﬁtting for layer sparsity.
We stay in the framework of Example 2 to keep the notation light.
Example 3 (ReLU Activation Cont.) .
Consider the model in (1) with the speciﬁcations of Example 2, and consider a corresponding layer-sparse estimator (cid:99) W of the parameters such as (3) with h = h L .
In line with (6) , we denote the set of the active layers by
[Equation]
and the corresponding parameter space of the condensed network by V S ≡ V S [ (cid:99) W ] =
{ V = ( V 1 , . .
, V s ) :
V i ∈ R
p ji − 1+1 × p ji +1 } , where s := |S| .
The least-squares reﬁtted estimator for the parameters in the condensed network is then
[Equation]
Hence, the estimator (cid:99) W complemented with least-squares reﬁtting yields the network
[Equation]
This strategy corresponds to the “one-shot approach” in Frankle & Carbin (2019); one could extend it along the lines of their iterative approach, but the numerical results indicate that this is not necessary.
Also, in contrast to the results in Frankle & Carbin (2019), our results indicate that keeping the initialization is not necessary either.
2. E XTENSIONS B EYOND F ULLY -C ONNECTED N ETWORKS
We have illustrated our ideas with feedforward networks that have fully connected layers, but the principles of layer sparsity apply much more generally. Consider a ﬁxed hidden layer with index j ∈ { 2 , . . , l − 1 } .
In the fully-connected networks (2), this layer corresponds to a function z (cid:55)→ f
j [ V j z ] with weights V j ∈ R p
j × p j +1 .
We now generalize these functions to
[Equation]
with weights V j :=
( V j, 1 , . . .
, V j,m ) ∈ M j, 1 × · · · × M j,m and arbitrary nonempty subsets
M j, 1 × · · · × M j,m ⊂ R p
j × p j +1 .
The corresponding layer-sparse regularizer is then
[Equation]
We can conﬁrm immediately that this regularizer has the same effect as its analog in the fullyconnected case.
Indeed, under the assumptions of Theorem 1, it holds that
[Equation]
] for all z ∈ [0 , ∞ ) p j +
[Equation]
where V j − 1 ,j := (cid:80) mk
=1 V j − 1 V j,k ∈ R p j − 1 × p j +1 .
In other words, if the value of the regularizer is zero, the j th layer can be merged into the ( j − 1) th layer as before.
These observations highlight the fact that layer sparsity applies very generally: it only requires the properties of ReLU-type activations and the linearities that exist within most types of layers.
As a concrete application, layer sparsity can compress networks that have convolutional layers, where m speciﬁes the number of feature maps and M j,m the non-zero patterns of the ﬁlters.
E MPIRICAL S TUDY
We now conﬁrm in a brief empirical study the fact that layer regularization can 1. improve prediction accuracies and 2.
reduce the number of active layers.
3. A RTIFICIAL
D ATA
We start with artiﬁcial data.
[Table]
S IMULATION F RAMEWORK
We generate data according to the model in (2).
The most outside activation function f 1 is the identity function [Table] and the coordinates of all other activation functions f 2 , . .
. , f l are ReLU functions.
The input vectors x 1 , . . .
, x n are jointly independent and standard normally distributed in d dimensions; the noise random variables u 1 , . .
. , u n are independent of the input, jointly independent, and standard normally distributed in one dimension.
For a given sparsity level s W ∈ [0 , 1] , a vector s ∈ { 0 , 1 } l − 1 with independent Bernoulli distributed entries that have success parameter s W is generated.
The entries of the parameter matrix W 1 are sampled independently from the uniform distribution on ( − 2 , 2) , and the entries of the parameter matrices W 2 , . . .
, W l are sampled independently from the uniform distribution on (0 , 2) if s j = 0 and on ( − 2 , 2) otherwise.
Hence, the parameter s W controls the level of the layer sparsity: the smaller s W , the higher the network’s layer sparsity.
In concrete numbers, the input dimension is d = 2 , the network widths are p 2 = · · · = p l = 5 , the number of hidden layers is l − 1 ∈ { 10 , 25 } , and the sparsity level is s ∈ { 0 . 1 , 0 . 3 , 0 . 9 } .
Our settings and values represent, of course, only a very small part of possible networks in practice, but given the generality of our concepts, any attempt of an exhaustive simulation study must fail, and the simulations at least allow us (i) to corroborate our theoretical insights and (ii) to indicate that our concepts can be very useful in practice.
Datasets of 150 samples are generated; n = 100 of the samples are assigned to training and the rest to testing.
The relevant measures for an estimate (cid:99) W of the network’s parameters are the empirical mean squared error (cid:100) [Equation] (cid:88)
[Equation]
over the test set T with cardinality |T | = 50 and the level of sparsity among the hidden layers
[Equation]
Reported are the medians (and third quantiles in paranthesis) over 30 simulation runs for each setting.
3.1. M ETHODS
Our ﬁrst method ( SLS ) is a standard least-squares complemented with the layer regularizer (5) in
Lagrange form (cid:99) W .
The baseline for this estimator is vanilla least-squares ( LS ).
Since our estimator— in contrast to least-squares—allows for merging layers, we can also complement it with our reﬁtting scheme of Section 2.4 ( FLS ).
The baseline for our reﬁtted estimator is the least-squares estimator that “knows” the relevant layers beforehand ( ILS ), that is, a least-squares on the relevant layers V S
[ W ] with W the true parameter—see Example 2.
The latter estimator cannot be used in practice, but it can serve as a benchmark here in the simulations.
The objective functions are optimized by using mini-batch gradient descent with batch size 10 , learning rate 10 − 2 , and number of epochs 200 (for l = 10 , s W = 0 .
1 , 0 . 3 ), 300 (for l = 10 , s W = 0 . 9 ), 400 (for l = 25 , s W = 0 . 1 ), and 500 (otherwise).
The tuning parameters ( r L ) j are 0 .(for l = 10 , s W = 0 . 1 ), 0 .
12 (for l = 10 , s W = 0 . 3 ), 0 .
07 (for l = 10 , s W = 0 . 9 ), and 0 .
05 (for l = 25 ).
3.1. R ESULTS
The numerical results show that our layer-regularized version SLS can improve on the prediction accuracy of the standard least-squares LS considerably ( (cid:100) mse -columns of the ﬁrst and second rows in Table 1).
The results also show that the reﬁtting in FLS can improve the prediction accuracy further, and that reﬁtted estimator can rival the infeasible ILS in terms of prediction ( (cid:100) mse -columns of the third and fourth rows).
The results ﬁnally show that the layer regularization can detect the correct number of layers ( ˆs -columns of the third and fourth rows).
In summary, our layer-regularized estimator outmatches the standard least-squares, and the reﬁtted version of our estimator rivals the infeasible least-squares that knows which are the relevant layers beforehand—both in terms of prediction accuracy and sparsity.
Hence, layer regularization can condense networks effectively.
The results also reveal that the prediction accuracies of our estimators increase with s W decreasing ( (cid:100) mse -columns across different s W ).
This trend is expected: the higher the layer sparsity, the more layer-regularization can condense the networks.
This behavior is conﬁrmed in the sparsities ( ˆscolumns across different s W ).
In other words, the layer regularization is adaptive to the true layer sparsity.
The tuning parameters ( r L ) j have been calibrated very roughly by hand.
We expect that a more careful calibration of r L based on cross-validation, for example, accentuates the positive effects of layer sparsity even further.
But since our goal in this section is a general proof of concept for layer sparsity rather than the optimization of a speciﬁc deep learning pipeline, we do not pursue this further here.
The tuning parameters of the descent algorithm, such as the batch size, number of epochs, learning rate, and so forth, have also been calibrated very roughly by hand.
An observation is the fact that all methods can sometimes provide accurate prediction if the number of epochs is extremely large, but our layer-regularized methods SLS and FLS generally lead to accurate prediction after much less epochs than their unregularized counterpart LS .
This observation indicates that layer regularization also impacts the algorithmic aspects of deep learning beneﬁcially.
3. R EAL D ATA
We now turn to real data.
Speciﬁcally, we consider subsamples of MNIST (LeCun et al., 1998),
FashionMNIST (Xiao et al., 2017), and KMNIST (Clanuwat et al., 2018).
3.2. S ETUP
For each of the three data examples, the training data consists of n = 10 000 images sampled uniformly at random; the test data also consists of 10 000 images.
The network consists of l = 10 fullyconnected layers; the hidden layers have width p 2 = · · · = p l = 50 .
While fully-connected networks have been outperformed image classiﬁcation by other, more intricate pipelines, they still provide decent results (even on the subsetted data) and are perfectly suited for illustrating our ideas.
The baseline is cross-entropy ( CE ), which is LS but with the least-squares loss replaced by the cross-entropy loss.
Our layer-sparse method is reﬁtted cross-entropy ( FCE ), which is the pendant of
FLS , that is, cross-entropy with additional layer-sparse regularization and reﬁtting.
The objective functions are optimized by using mini-batch gradient descent with batch size 100 , learning rate 10 − 3 , and number of epochs 100 .
In line with standard theoretical considerations (Bühlmann & van de Geer, 2011), the tuning parameters are set to ( r L ) j
= ln[ p ] / √ n with p the total number of network parameters.
The performances are measured in terms of average classiﬁcation accuracies (denoted those by (cid:100) AC ) and level of sparsity among the hidden layers ˆs .
3.2. R ESULTS
The results are summarized in Table 2.
Similarly as before, we ﬁnd that layer-sparse regularization can reduce the number of layers while retaining the classiﬁcation accuracy or even improving it.
To highlight the features of layer sparsity more, we also look at the training losses and testing accuracies over the course of the optimization; Figure 2 contains these data averaged over 20 draws of the data.
We ﬁnd that both the initial estimator as well as the reﬁtted version eventually achieve
[Table]
In contrast to (Frankle & Carbin, 2019), however, we could not ﬁnd any beneﬁts of keeping the initializations of the original network: both the training and the accuracy curves remain virtually the same.
This observation might indicate that layer sparsity might be particularly robust under reﬁtting.
[Figure]
D ISCUSSION
We have shown that layer sparsity can compress layered networks effectively both in theory (Section 2) and practice (Section 3).
We have also shown that reﬁtting with respect to layer sparsity can facilitate the optimization of the network.
Reﬁtting has a long-standing tradition in high-dimension statistics—see Lederer (2013), for example—but has been applied in deep learning only recently (Frankle & Carbin, 2019).
Our research supports the usefulness of reﬁtting in general, and it demonstrates that layer sparsity is particularly suited for reﬁtting.
Related concepts such as ResNets add complexity to the network descriptions.
This makes these networks not only unﬁt for reﬁtting but also very hard to analyze statistically.
Layer sparsity, in contrast, simplify network architectures and seem amenable to statistical analyses via recent techniques for regularized deep learning (Taheri et al., 2020).
Statistical theory of layer sparsity, therefore, seems a feasible goal for further research.
Another topic for further research is the practical calibration of the tuning parameters.
Tuning parameter calibration is an active topic in machine learning; thus, we expect that one can use ideas developed in other frameworks, such as (Chichignoud et al., 2016).
In summary, layer sparsity complements other notions of sparsity that concern individual connections or nodes.
All of these concepts can help to ﬁt networks that are efﬁcient in terms of memory and computations and easy to interpret.