D EEP L EARNING MEETS N ONPARAMETRIC R EGRESSION : A RE W EIGHT D ECAYED DNN S L OCALLY
A DAPTIVE ?
Anonymous authors
Paper under double-blind review
A BSTRACT
We study the theory of neural network (NN) from the lens of classical nonparametric regression problems with a focus on NN’s ability to adaptively estimate functions with heterogeneous smoothness — a property of functions in Besov or
Bounded Variation (BV) classes.
Existing work on this problem requires tuning the NN architecture based on the function spaces and sample size.
We consider a “Parallel NN” variant of deep ReLU networks and show that the standard ℓregularization is equivalent to promoting the ℓ p -sparsity ( 0 < p < 1 ) in the coefficient vector of an end-to-end learned function bases, i e., a dictionary.
Using this equivalence, we further establish that by tuning only the regularization factor, such parallel NN achieves an estimation error arbitrarily close to the minimax rates for both the Besov and BV classes.
Notably, it gets exponentially closer to minimax optimal as the NN gets deeper.
Our research sheds new lights on why depth matters and how NNs are more powerful than kernel methods
I NTRODUCTION
Why do deep neural networks (DNNs) work better?
They are universal function approximators (Cybenko, 1989), but so are splines and kernels.
They learn data-driven representations, but so are the shallower and linear counterparts such as matrix factorization.
The theoretical understanding on why DNNs are superior to these classical alternatives is surprisingly limited.
In this paper, we study DNNs in nonparametric regression problems — a classical branch of statistical theory and methods with more than half a century of associated literatures (Nadaraya, 1964;
De Boor et al., 1978; Wahba, 1990;
Donoho et al., 1998; Mallat, 1999; Scholkopf & Smola, 2001;
Rasmussen & Williams, 2006).
Nonparametric regression addresses the fundamental problem:
• Let y i
=
f
( x i ) + Noise for i = 1 , ..., n .
How can we estimate a function f using data points ( x 1 , y 1 ) , ..., ( x n , y n ) in conjunction with the knowledge that f belongs to a function class F ?
Function class F typically imposes only weak regularity assumptions such as smoothness, which makes nonparametric regression widely applicable to real-life applications under weak assumptions.
Local adaptivity.
We say a nonparametric regression technique is locally adaptive if it can cater to local differences in smoothness, hence allowing more accurate estimation of functions with varying smoothness and abrupt changes.
A subset of nonparametric regression techniques were shown to have the property of local adaptivity (Mammen & van de Geer, 1997) in both theory and practice.
These include wavelet smoothing (Donoho et al., 1998), locally adaptive regression splines (LARS, Mammen & van de Geer, 1997), trend filtering (Tibshirani, 2014; Wang et al., 2014) and adaptive local polynomials (Baby & Wang, 2019; 2020).
In light of such a distinction, it is natural to consider the following question: Are NNs locally adaptive , i.e., optimal in learning functions with heterogeneous smoothness?
This is a timely question to ask, partly because the bulk of recent theory of NN leverages its asymptotic Reproducing Kernel Hilbert Space (RKHS) in the overparameterized regime (Jacot et al., 2018;
Belkin et al., 2018; Arora et al., 2019).
RKHS-based approaches, e.g., kernel ridge regression with any fixed kernels are suboptimal in estimating functions with heterogeneous smoothness (Donoho
[Table]
Parhi & Nowak
[Table]
et al., 1990).
Therefore, existing deep learning theory based on RKHS does not satisfactorily explain the advantages of neural networks over kernel methods
[Table]
E [ y
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation] [Equation]
[Table]
[Figure]
We build upon the recent work of Suzuki (2018) and Parhi & Nowak (2021a) who provided encouraging first answers to the question above about the local adaptivity of NNs.
Specifically, Parhi & Nowak (2021a, Theorem 8) showed that a twolayer truncated power function activated neural network with a non-standard regularization is equivalent to the LARS.
This connection implies that such
NNs achieve the minimax rate for the (high order) bounded variation (BV) classes.
A detailed discussion is provided in Section B. Suzuki (2018) showed that multilayer ReLU DNNs can achieve minimax rate for the Besov class, but requires the artificially imposed sparsity-level of the DNN weights to be calibrated according to parameters of the Besov class, thus is quite difficult to implement in practice.
(Oono & Suzuki, 2019; Liu et al., 2021) replaced the sparse neural network with Resnet-style CNN and achieved the same rate, but they similarly require carefully choosing the number of parameters for each nonparametric class.
We show that ℓ 2 regularization suffices for mildly overparameterized DNNs to achieve the optimal “local adaptive” rates for many nonparametric classes at the same time.
Parallel neural networks.
We restrict our attention on a special network architecture called parallel neural network (Haeffele & Vidal, 2017; Ergen & Pilanci, 2021c) which learns an ensemble of subnetworks — each being a multilayer ReLU DNNs.
Parallel NNs have been shown to be more well-behaved both theoretically (Haeffele & Vidal, 2017; Zhang et al., 2019; Ergen & Pilanci, 2021b;c;d) and empirically (Zagoruyko & Komodakis, 2016; Veit et al., 2016).
On the other hand, many successful NN architectures such as SqueezeNet, ResNext and Inception (see (Ergen &
Pilanci, 2021c) and the references therein) use the idea similar to a parallel NN.
Weight decay, also known as square ℓ 2 regularization , is one of the most popular regularization techniques for preventing overfitting in DNNs.
It is called “weight decay” because each iteration of the gradient descent (or SGD) shrinks the parameter towards 0 multiplicatively.
Many tricks in deep learning, including early stopping (Yao et al., 2007), quantization (Hubara et al., 2016), and dropout (Wager et al., 2013) behaves like ℓ 2 regularization.
Thus even though we focus on the exact minimizer of the regularized objective, it may explain the behavior of SGD in practice.
Summary of results.
Our main contributions are:
We prove that the (standard) ℓ 2 regularization in training an L -layer parallel ReLUactivated neural network is equivalent to a sparse ℓ p penalty term (where p = 2 /L ) on the linear coefficients of a learned representation (Proposition 4).
We show that the estimation error of ℓ 2 regularized parallel NN can be close to the minimax rate for estimating functions in Besov space.
Notably, the method can adapt to different smoothness parameter, which is not the case for many other methods.
We find that deeper models achieve closer to the optimal error rate.
This result helps explain why deep neural networks can achieve better performance than shallow ones empirically.
Besides, we have the following technical contributions which could be of spearate interest:
We provide a way to bound the complexity of an overparameterized neural network.
Specifically, we bound the metric entropy of a parallel neural network in Theorem 5, and the bound does not depend on the number of subnetworks.
We propose a method to handle unconstrained function space when bounding the estimation error as in Equation (4).
The above results separate parallel NNs with any linear methods such as kernel ridge regression.
To the best of our knowledge, we are the first to demonstrate that standard techniques ( ℓ 2 regularization and ReLU activation) suffice for DNNs in achieving the optimal rates for estimating BV and Besov functions.
The comparison with previous works is shown in Table 1.
More discussion about related works are shown in Section A.
P RELIMINARY 2. N OTATION AND P ROBLEM S ETUP .
We denote regular font letters as scalars, bold lower case letters as vectors and bold upper case letters as matrices.
a ≲ b means a ≤ Cb for some constant C that does not depend on a or b , and a ≂ b denotes a ≲ b and b ≲ a .
See Table 2 for the full list of symbols used.
Let f 0 be the target function to be estimated.
The training dataset is D n := { ( x i , y i ) , y i =
f 0 ( x i )
+ ϵ i , i ∈ [ n ] } , where x i are fixed and
ϵ i are zero-mean, independent Gaussian noises with variance σ 2 .
In the following discussion, we assume x i ∈
[0 , 1] d , f 0 ( x i ) ∈ [ − 1 , 1] , ∀ i .
We will be comparing estimators under the mean square error (MSE), defined as MSE( ˆ f ) :
=
E D n 1 n (cid:80) ni
=
( ˆ f ( x i ) − f
( x i )) 2 .
The optimal worst-case MSE is described by R ( F ) :
= min ˆ f max f 0 ∈F MSE( ˆ f ) .
We say that ˆ f is optimal if MSE( ˆ f ) ≲ R ( F ) .
The empirical (square error) loss is defined as ˆ L ( ˆ f ) := 1 n (cid:80) ni
=
( ˆ f ( x i ) − y i ) 2 .
The corresponding population loss is L ( ˆ f ) :=
E [ 1 n (cid:80) ni
=
( ˆ f ( x i ) − y ′
i )
2 | ˆ f ] where y ′
i are new data points.
It is clear that E [ L ( ˆ f )]
=
MSE[ ˆ f ] + σ 2 .
2. B ESOV S PACES AND B OUND V ARIATION S PACE
Besov space , denoted as B αp,q , is a flexible function class parameterized by α, p, q whose definition is deferred to Section C.1.
Here α ≥ 0 determines the smoothness of functions, 1 ≤ p ≤ ∞ determines the averaging (quasi-)norm over locations,≤ q ≤ ∞ determines the averaging (quasi- )norm over scale which plays a relatively minor role.
Smaller p is more forgiving to inhomogeneity and loosely speaking, when the function domain is bounded, smaller p induces a larger function space.
On the other hand, it is easy to see from definition that B αp,q ⊂ B αp,q ′ , if q < q ′ .
Without loss
[Table]
# subnetworks in a parallel NN. function of resolution k at L # layers in a (parallel) NN. position s . w Width of a subnetwork.
[Table]
ReLU activation function.
n # samples.
[Table]
Weight
and
bias
in
the ℓ - th layer
in the
j - th subnetwork. R , Z , N
Set of real numbers, integers, and nonnegative integers.
x W (1)
W (2) . . .
W ( L − 1)
W ( L )
W (2)
W (2) M . . .
W ( L − 1)
W ( L − 1) M . . .
W ( L )
W ( L ) M y min
f j L ( (cid:80) j f j ) + λ (cid:80)
Lℓ =1 (cid:80) Mj
=
∥ W ( ℓ ) j ∥ 2 F .
W ( ℓ ) :
W ( ℓ ) W ( ℓ ) W (
[Figure] [Figure] ¯ [Figure]
[Figure]
¯
[Figure] ¯ [Figure] ( L
[Figure]
[Figure] [Figure] y [Figure]
of generalizability, in the following discussion we will only focus on B αp, ∞ . When p = 1 , the Besov space allows higher inhomogeneity, and it is more general than the Sobolev or Hölder space. Bounded variation (BV) space is a more interpretable class of functions with spatially heterogeneous smoothness (Donoho et al., 1998). It is defined through the total variation (TV) of a function.
For ( m + 1) th differentiable function f : [0 , 1] → R , the m th order total variation is defined as
TV ( m ) ( f ) :
=
TV ( f ( m +1) ) =
(cid:82) [0 , 1] | f
( m +1)
( x ) | dx, and the corresponding m th order Bounded
Variation class BV ( m ) :
= { f : TV ( f ( m ) ) < ∞} .
The more general definition is given in Section C.2.
Bounded variation class is tightly connected to Besov classes.
Specifically (DeVore &
Lorentz, 1993):
[Equation]
This allows the results derived for the Besov space to be easily applied to BV space.
Minimax MSE It is well known that minimax rate for Besov and 1D BV classes are O ( n −
α 2 α + d ) and O ( n − (2 m +2) / (2 m +3) ) respectively .
The minimax rate for linear estimators in 1D BV classes is known to be O ( n − (2 m +1) / (2 m +2) )
(Mammen & van de Geer, 1997; Donoho et al., 1998).
M AIN R ESULTS : P ARALLEL R E LU DNN S
Consider a parallel neural network containing M multi layer perceptrons (MLP) with ReLU activation functions called subnetworks .
Each subnetwork has width w and depth L .
The input is fed to all the subnetworks, and the output of the parallel NN is the summation of the output of each subnetwork.
The architecture of a parallel neural network is shown in Figure 2a.
This parallel neural network is equivalent to a vanilla neural network with block diagonal weights in all but the first and the last layers (Figure 2(c)).
Let W ( ℓ ) j and b ( ℓ ) j denote the weight and bias in the ℓ -th layer in the j -th subnetwork respectively.
Training this model with ℓ 2 regularization returns: arg
[Equation]
where f ( x ) = (cid:80)
Mj
=
f k ( x ) denotes the parallel neural network, f j ( · ) denotes the j -th subnetwork, and λ > 0 is a fixed scaling factor.
We choose not to regularize the bias terms b ( ℓ ) j to provide a cleaner equivalent model (Proposition 4).
If the bias terms are regularized, the result will be similar.
Besides, we ignore the computation issue and focus on the global optimal solution to this problem.
In practice, in deep neural network, the solution obtained using gradient descent-style methods are often close to the global optimal solution (Choromanska et al., 2015).
Theorem 1.
For any fixed α − d/p > 1 , q ≥ 1 , L ≥ 3 , define m = ⌈ α − 1 ⌉ .
For any f 0 ∈ B αp,q , given an L -layer parallel neural network satisfying
• The width of each subnetwork is fixed satisfying w ≥
O ( md ) .
See Theorem 8 for the detail.
• The number of subnetworks is large enough : M ≳ n
[Equation]
Under the assumption as in Lemma 17, with proper choice of the parameter of regularizaton λ that depends on D , α, d, L , the solution ˆ f parameterized by (2) satisfies
[Equation]
where ˜ O shows the scale up to a logarithmic factor, c 6 > 0 is a numerical constant from Theorem 8,
C ( w, L ) ≂ ( w
[Equation]
We explain the proof idea in the next section,but defer the extended form of the theorem and the full proof to Section F.
Before that, we comment on a few interesting aspects of the result.
Near optimal rates and the effect of depth.
The first term in the MSE bound is the estimation error and the second term is (part of) the approximation error of this NN.
Recall that the minimax rate of a Besov class is O ( n − 2 α 2 α + d ) .
The gap between the estimation error and the minimax rate is because the minimax rate can be achieved by an ℓ 0 sparse model, while the parallel NN is equivalent to an ℓ p sparse model (will be shown in Proposition 4), which is an approximation to ℓ 0 .
As the depth parameter L increases, p = 2 /L gets closer to 0 , the MSE can get arbitrarily close to the minimax rate and the trailing constant term in (3) can be arbitrarily small.
Close to the optimal rate can be achieved if we choose L ≳ log n :
Corollary 2.
Under the conditions of Theorem 1, for any f 0 ∈ B αp,q , there is a numerical constant
C such that when we choose C log n ≤ L ≤ 100 C log n ,
[Equation]
where ˜ O hides only logarithmic factors and the o (1) factor in the exponent is O (1 / log( n )) .
Sparsity and comparison with standard NN.
We also note that the result does not depend on M as long as M is large enough.
This means that the neural network can be arbitrarily overparameterized while not overfitting.
The underlying reason is sparsity .
As it will become clearer in the proof sketch, ℓ 2 regularized training of a parallel L -layer ReLU NNs is equivalent to a sparse regression problem with an ℓ p penalty assigned to the coefficient vector of a learned dictionary.
Here p = 2 /L which promotes even sparser solutions than an ℓ 1 penalty.
Such ℓ p sparsity does not exist in standard deep neural networks to the best of our knowledge, which indicates that parallel neural networks may be superior over standard neural networks in local adaptivity.
Adaptivity to function spaces.
For any fixed L, ˜ m , our result shows the parallel neural network with width w =
O
( ˜ md ) can achieve close to the minimax rate for any Besov class as long as α ≤ ˜ m .
In other words, neural networks can adapt to smoothness parameter by tuning only the regularizaton parameter.
As will be shown in Theorem 5, overestimating α with ˜ m only changes the logarithmic terms in the MSE bound — a mild price to pay for a more adaptive method.
Hyperparameter tuning.
We provide an explicit choice of λ in Lemma 17 underlying our theoretical result.
Empirically, it can be determined empirically, e.g. using cross validation.
Fixed design v.s. random design.
We mainly focus on bounding the error at sample covariates (the fixed design problem) to be comparable to classical nonparameteric regression results.
For completeness, we also state results for the random design version of the problem (bounding E D E f MSE( ˆ f ) ) in Theorem 19, to be compatible with the standard statistical learning setting (e.g., Suzuki, 2018).
More discussion about this result can be found in Section G.
Bounded variation classes.
Thanks to the Besov space embedding of the BV class (1), our theorem also implies the result for the BV class in 1 D .
Corollary 3.
If the target function is in bounded variation class f 0 ∈ BV ( m ) , For any fixed L ≥ 3 , for a neural network satisfying the requirements in Theorem 1 with d = 1 and with proper choice of the regularization factor λ , the NN ˆ f parameterized by (6) satisfies
[Equation]
where C ( w, L ) is the same as in (3) except replacing α with m .
It is known that any linear estimators such as kernel smoothing and smoothing splines cannot have an error lower than O ( n − (2 m +1) / (2 m +2) ) for BV ( m ) (Donoho et al., 1998).
When L > O ( m 2 ) , the first term in the MSE of NN decreases with n faster than that of the linear methods.
When n is large enough, there exists L such that the MSE of NN is strictly smaller than that of any linear method.
This partly explains the advantage of DNNs over kernels.
P ROOF O VERVIEW
We start by first proving that a parallel neural network trained with ℓ 2 regularization is equivalent to an ℓ p -sparse regression problem with representation learning (Section 4.1); which helps decompose its MSE into an estimation error and approxmation error.
Then we bound the two terms under an ℓ p -sparse constrained problem setting in Section 4.2 and Section 4.3 respectively.
Notably, we adapted the generic statistical learning machinery (a self-bounding argument) for studying this constrained ERM problem (Suzuki, 2018, Proposition 4) to bound the estimation error.
This adaption is non-trival because there is an unconstrained subspace with no bounded metric entropy.
Specifically, Proposition 15 shows that the MSE of the regression problem can be bounded by
[Equation]
[Table] [Equation] in which F decomposes into F ∥ ×F ⊥ , where F ⊥ is an unconstrained subspace with finite dimension, and F ∥ is a compact set in the orthogonal complement with a δ -covering number of N ( F ∥ , δ, ∥·∥ ∞ ) in ∥ · ∥ ∞ -norm.
This decomposes MSE into an approximation error and an estimation error.
The novel analysis of these two represents the major technical contribution of this paper.
4. E QUIVALENCE TO ℓ p S PARSE R EGRESSION
It is widely known that ReLU function is 1-homogeneous: σ ( ax ) = aσ ( x ) , ∀ a ≥ 0 , x ∈ R .
In any consecutive two layers in a neural network (or a subnetwork), one can multiply the weight and bias in one layer with a positive constant, and divide the weight in another layer with the same constant.
The neural network after such transformation is equivalent to the original one:
[Equation]
This property can be applied to each subnetwork (instead of the entire model in a standard NN), and using AM-GM inequality, we can reformulate (2) to an ℓ p sparsity constraint problem:
Proposition 4.
There exists an one-to-one mapping between λ > 0 and λ ′ >
such that (2) is equivalent to the following problem:
[Equation]
where ¯ f j ( · ) is a subnetwork with parameters ¯ W ( ℓ ) [Equation]
This equivalent model is demonstated in Figure 2b.
The proof can be found in Section D.1.
The constraint ∥ ¯W (1) j ∥ F ≲ √ d, ∥ ¯W ( ℓ ) j ∥ F ≲ √ w, ∀ ℓ > 1 is typical in deep learning for better numerical stability.
The equivalent model in Proposition 4 is also a parallel neural network, but it appends one layer with parameters { a k } at the end of the neural network and the constraint on the Frobenius norm is converted to the 2 /L norm on the factors { a k } .
Since L ≫ 2 in a typical application, 2 /L ≪ 1 and this regularizer can enforce a sparser model than that in Section
B. The same technique can also be used to prove that an ℓ 2 constrained neural network is equivalent to the ℓ 2 /L constrained model as in (7).
There are two useful implications of Proposition 4.
First, it gives an intuitive explanation on how a regularized Parallel NN works.
Specifically, it can be viewed as a sparse linear regression with representation learning.
Secondly, the conversion into the constrained form allows us to decompose the MSE into two terms as in (4) and bound them separately.
4. E STIMATION E RROR A NALYSIS
Previous results that bound the covering number of neural networks (Yarotsky, 2017; Suzuki, 2018) depends on the width of the neural networks explicitly, which cannot be applied when analysing a potentially infinitely wide neural network.
In this section, we leverage the ℓ p -norm bounded coefficients to avoid the dependence in M in the covering number bound, and focus on a constrained optimization problem:
[Equation]
and { ¯W ( ℓ ) j , ¯ b ( ℓ ) j } satisfy the same constraint as in (6).
The connection between the regularized problem and the constrained problem is defered to Lemma 17.
Theorem 5.
The covering number of the model defined in (7) apart from the bias in the last layer satisfies
[Equation]
This theorem provides a bound of estimation error for an arbitrarily wide parallel neural network as long as the total Frobenius norm is bounded.
The proof can be found in Section D.2.
It requires the following lemma, whose proof is deferred to Section D.3:
Lemma 6.
Let G ⊆
{ R d → [ − c 3 , c 3 ] } be a set with covering number satisfying log N ( G , δ ) ≲
k log(1 /δ ) for some finite c 3 , and for any g ∈ G , | a | ≤ 1 , we have ag ∈ G .
The covering number of
F = (cid:110)(cid:80)
Mi
=1 a
i g i (cid:12)(cid:12)(cid:12) g i ∈ G , ∥ a ∥ pp ≤ P, 0 < p < 1 (cid:111) for any P > 0 satisfies
[Equation]
up to a double logarithmic factor.
4. A PPROXIMATION E RROR A NALYSIS
The approximation error analysis involves two steps.
We first analyse how a subnetwork can approximate a B-spline basis, which is defered to Section E.1.
Then we show that a sparse linear combination of B-spline bases approximates Besov functions.
Both add up to the total error in approximating Besov functions with a parallel neural network (Theorem 8).
Proposition 7.
Let α − d/p > 1 , r > 0 .
For any function in Besov space f 0 ∈ B αp,q and any positive integer ¯ M , there is an ¯ M -sparse approximation using B-spline basis of order m satisfying 0 < α < min( m, m − 1 + 1 /p ) :
ˇ f ¯ M = (cid:80) ¯ Mi =1 a k
i , s i M m,k i , s i for any positive integer
¯ M such that the approximation error is bounded as ∥
ˇ f ¯ M − f
∥
r ≲ ¯ M − α/d ∥ f 0 ∥ B αp,q , and the coefficients satisfy
[Equation]
The proof as well as the remark can be found in Section E.2.
[-The requirement in Proposition 7: α − d/p > 1 is stronger than the condition typically found in approximation theorem α − d/p ≥ 
-]
Theorem 8.
Under the same condition as Proposition 7, for any positive integer ¯ M , any function in
Besov space f 0 ∈ B αp,q can be approximated by a parallel neural network with no more than O ( ¯ M ) number of subnetworks satisfying:
Each subnetwork has width w =
O
( md ) and depth L .
[Figure]
[Figure] [Figure]
[Figure]
The weights in each layer satisfy ∥ ¯W ( ℓ ) k
∥ F ≤ O ( √ w ) except the first layer ∥ ¯W (1) k
∥ F ≤ O ( √ d ) , 3.
The scaling factors have bounded 2 /L
-norm: P ′ :
= ∥{ a j }∥ 2 /L 2 /L ≲ ¯ M 1 − 2 / ( pL ) .
The approximation error is bounded by
[Equation]
where c 4 , c 5 , c 6 are constants that depend only on m, d and p .
Here ¯ M is the number of “active” subnetworks, which is not to be confused with the number of subnetworks at initialization.
The proof can be found in Section E.3.
Using the estimation error in Theorem 5 and approximation error in Theorem 8, by choosing ¯ M to minimax the total error, we can conclude the sample complexity of parallel neural networks using ℓ 2 regularization, which is the main result (Theorem 1) of this paper.
See Section F for the detail.
E XPERIMENT
We empirically compare a parallel neural network (PNN) and a vanilla ReLU neural network (NN) with smoothing spline, trend filtering (TF) (Tibshirani, 2014), and wavelet denoising.
Trend filtering can be viewed as a more efficient discrete spline version of locally adaptive regression spline and enjoys the same optimal rates for the BV classes.
Wavelet denoising is also known to be minimaxoptimal for the BV classes.
The results are shown in Figure 3.
We use two target functions: a
Doppler function whose frequency is decreasing(Figure 3(a)-(c)(h)), and a combination of piecewise linear function and piecewise cubic function, or “vary” function (Figure 3(d)-(f)(i)).
We repeat each experiment 10 times and take the average.
The shallow area in Figure 3(b)(e) shows 95% confidence interval by inverting the Wald’s test.
The degree of freedom (DoF) is computed based on Tibshirani (2015).
As can be shown in the figure, both TF and wavelet denoising can adapt to the different levels of smoothness in the target function, while smoothing splines tend to be oversmoothed where the target function is less smooth (the left side in (a)(d), enlarged in (g)).
The prediction of PNN is similar to
TF and wavelet denoising and shows local adaptivity.
Besides, the MSE of PNN almost follows the same trend as TF and wavelet denoising which is consistent with our theoretical understanding that the error rate of neural network is closer to locally adaptive methods.
Notably PNN, TF and wavelet denoising achieve lower error at a much smaller degree-of-freedom than smoothing splines.
There are some mild drops in the best MSE one can achieve with Parallel NN vs TF in both examples.
We are surprised that the drop is small because Parallel NN needs to learn the basis functions that
TF essentially hard-coded.
The additional price to pay for using a more adaptive and more flexible representation learning method seems not high at all.
In Figure 3(c)(f), we give the output all the “active” subnetwork, i.e. the subnetworks whose output is not a constant.
Notice that the number of active subnetworks is much smaller than the initialization.
This is because ℓ 2 regularization in weights induces ℓ p sparsity and the weight in most of the subnetworks reduces towards 0 after training.
More details are shown in Section H.
In Figure 3(h)(i), we plot the MSE versus the number of training samples for “Doppler” and “Vary” respectively.
It is clear that parallel NN works the best overall.
In (i), we further compare the scaling of the MSE against the minimax rate ( n − 4 / 5 ) and the minimax linear rate ( n − 3 / 4 ), i.e., the best rate kernel methods could achieve.
As is predicted by our theory, when n is large, the MSE of parallel neural networks and trend filtering decreases at almost the same rate as the minimax rate, while smoothing splines, as expected, is converging at the (suboptimal) minimax linear rate.
Interestingly, vanilla NN seems to converge at the optimal rate too on this example.
It remains an open question whether vanila NN is merely “lucky” on this example, or it also achieves the minimax rate for all functions in BV(m).
C ONCLUSION AND D ISCUSSION
In this paper, we show that a deep parallel neural network can be locally adaptive with standard ℓregularization.
This confirms that neural networks can be nearly optimal in learning functions with heterogeneous smoothness which separates them from kernel methods.
Specifically, we prove that training an L layer parallel neural network with standard ℓ 2 regularization is equivalent to an ℓ 2 /L
-penalized regression model with representation learning.
Since in typical application L ≫ 2 , standard regularization promotes a sparse linear combination of the learned bases.
Using this method, we proved that a parallel neural network can achieve close to the minimax rate in the Besov space and bounded variation (BV) space by tuning the regularization factor.
Our result reveals that one do not need to specify the smoothness parameter α (or m ) when training a parallel neural network.
With only an estimation of the upper bound of α (or m ), parallel neural networks can adapt to different degree of smoothness, or choose different parameters for different regions of the domain of the target function.
This property shows the strong adaptivity of deep neural networks.
On the other hand, as the depth of neural network L increases, 2 /L tends to 0 and the error rate moves closer to the minimax rate of Besov and BV space.
This indicates that when the sample size is large enough, deeper models have smaller error than shallower models, and helps explain why empirically deep neural networks has better performance than shallow neural networks.
A O THER RELATED WORKS NN and kernel methods.
Jacot et al.
(2018) draws the connection between neural networks and kernel methods.
However, it has been found that neural networks often outperform any kernel method, especially when the learning rate is relatively large (Lewkowycz et al., 2020).
A series of work tried to distinguish NN from kernel methods by providing examples of function spaces that NN provably outperform kernel methods (Allen-Zhu & Li, 2019; Ghorbani et al., 2020).
However, these papers did not consider the local adaptivity of nerual networks, which provides a more systematic explanation.
NN and splines.
Besides Parhi & Nowak (2021a) which we discussed earlier, Parhi & Nowak (2021b;c) also leveraged the connections between NNs and splines.
Parhi & Nowak (2021b) focused on characterizing the variational form of multi-layer NN.
Parhi & Nowak (2021c) showed that two-layer ReLU activated NN achieves minimax rate for a BV class of order 1 but did not cover multilayer NNs nor BV class with order > 1 , which is our focus.
Weight-decay regularization with sparsity-inducing penalties.
The connection between weightdecay regularization with sparsity-inducing penalties in two-layer NNs is folklore and used by
Neyshabur et al.
(2014); Savarese et al.
; Ongie et al.
; Ergen & Pilanci (2021a;d);
Parhi & Nowak (2021a;c); Pilanci & Ergen (2020).
The key underlying technique — an application of the AM-GM inequality (which we used in this paper as well) — can be traced back to Srebro et al.
(see a recent exposition by Tibshirani (2021)).
Tibshirani (2021) also generalized the result to multi-layered NNs, but with a simple (element-wise) connections.
Besides, Ergen & Pilanci (2020) proved that training a two-layer convolution neural network (CNN) with weight decay induces sparsity, and points to a potential extension to these works including our work.
Resnet-type convolution neural networks.
A recent series of work (Oono & Suzuki, 2019; Liu et al., 2021) proves that an arbitrary parallel neural network can be approximated by a resnet-type convolution neural networks.
These works do not require the model to be sparse, thus are easier to train, yet they still require the architecture (the width and depth of each residual block, the number of residual blocks) to be tuned based on the dataset, and the estimation error analysis is based on the number of parameters.
Besides, the number of residual block need to increase with n , making the entire too deep to train in practice.
Approximation and estimation.
The approximation-theoretic and estimation-theoretic research for neural network has a long history too (Cybenko, 1989; Barron, 1994; Yarotsky, 2017; SchmidtHieber, 2020; Suzuki, 2018).
Most existing work considered the Holder, Sobolev spaces and their extensions, which contain only homogeneously smooth functions and cannot demonstrate the advantage of NNs over kernels.
The exceptions including Suzuki (2018); Oono & Suzuki (2019); Liu et al.
(2021) which, as we discussed earlier, requires modifications to NN architecture for each class.
In contrast, we require tuning only the standard weight decay parameter.
Most importantly, in all previously works, the estimation error of the model (eg.
the covering number) depends on the number of nonzero parameters in the model, while our work provides a bound that depends on the norm of the weights instead of the number of subnetworks.
B T WO - LAYER N EURAL N ETWORK WITH T RUNCATED P OWER A CTIVATION F UNCTIONS
We start by recapping the result of Parhi & Nowak (2021a) and formalizing its implication in estimating BV functions.
Parhi & Nowak (2021a) considered a two layer neural network with truncated power activation function.
Let the neural network be
[Equation]
(9) where w j , v j denote the weight in the first and second layer respectively, b j denote the bias in the first layer, c ( x ) is a polynomial of order up to m , σ m ( x ) :
= max( x, 0) m .
Parhi & Nowak (2021a,
Theorem 8) showed that when M is large enough, The optimization problem
[Equation]
is equivalent to the locally adaptive regression spline:
[Equation]
which optimizes over arbitrary functions that is m -times weakly differentiable.
The latter was studied in Mammen & van de Geer (1997), which leads to the following MSE:
Theorem 9.
Let M ≥ n − m , and ˆ f be the function (9) parameterized by the minimizer of (10) , then
[Equation]
We show a simpler proof in the univariate case due to Tibshirani (2022):
Proof.
As is shown in Parhi & Nowak (2021a, Theorem 8), the minimizer of (10) satisfy
[Equation]
so the TV of the neural network f NN is
[Equation]
which shown that (10) is equivalent to the locally adaptive regression spline (11) as long as the number of knots in (11) is no more than M .
Furthermore, it is easy to check that any spline with knots no more than M can be expressed as a two layer neural network (10).
It suffices to prove that the solution in (11) has no more than n − m number of knots.
Mammen & van de Geer (1997, Proposition 1) showed that there is a solution to (11)
ˆ f
( x ) such that ˆ f ( x ) is a m th order spline with a finite number of knots but did not give a bound.
Let the number of knots be M , we can represent ˆ f using the truncated power basis
[Equation]
where t j are the knots, c ( x ) is a polynomial of order up to m , and define σ ( m )
j
[Equation]
Mammen & van de Geer (1997) however did not give a bound on M .
Parhi & Nowak (2021a)’s
Theorem 1 implies that M ≤ n − m .
Its proof is quite technical and applies more generally to a higher dimensional generalization of the BV class.
Tibshirani (2022) communicated to us the following elegant argument to prove the same using elementary convex analysis and linear algebra, which we present below.
Define Π m ( f ) as the L 2 ( P n ) projection of f onto polynomials of degree up to m , Π ⊥ m ( f ) :
=
f − Π m ( f ) .
It is easy to see that
[Equation]
Denote f ( x 1: n ) :
= { f ( x 1 ) , . . .
, f ( x n ) } ∈ R n as a vector of all the predictions at the sample points.
[Equation]
where conv denotes the convex hull of a set.
The convex hull conv {± σ ( m )
j
[Equation]
x
[Equation]
: n ) } · (cid:80) Mj
[Equation]
|
[Equation]
is an n -dimensional space, and polynomials of order up to m is an m + 1 dimensional space, so the set defined above has dimension n − m − 1 .
By Carathéodory’s theorem, there is a subset of points in this space
[Equation]
such that
[Equation]
In other word, there exist a subset of knots { ˜ t j , j ∈ [ n − m ] } that perfectly recovers Π ⊥ m ˆ f ( x ) at all the sample points, and the TV of this function is no larger than ˆ f .
This shows that
[Equation]
for all x i in n onbservation points.
The MSE of locally adaptivity regressive spline (11) was studied in Mammen & van de Geer (1997,
Section 3), which equals the error rate given in Theorem 9.
This indicates that the neural network (9) is minimax optimal for BV ( m ) .
Let us explain a few the key observations behind this equivalence.
(a) The truncated power functions (together with an m th order polynomial) spans the space of an m th order spline.
(b) The neural network in (9) is equivalent to a free-knot spline with M knots (up to reparameterization).
(c) A solution to (11) is a spline with at most n − m knots (Parhi & Nowak, 2021a, Theorem 8).
(d)
Finally, by the AM-GM inequality
[Equation]
where c j = v j | w j | m is the coefficient of the corresponding j th truncated power basis.
The m th order total variation of a spline is equal to (cid:80) j | c j | .
It is not hard to check that the loss function depends only on c j , thus the optimal solution will always take “ = ” in the AM-GM inequality.
C I NTRODUCTION T O C OMMON F UNCTION C LASSES
In the following definition define Ω be the domain of the function classes, which will be omitted in the definition.
C.
[Equation]
Definition 1.
Modulus of smoothness: For a function f ∈ L p (Ω) for some 1 ≤ p ≤ ∞ , the r -th modulus of smoothness is defined by
[Equation] [Equation]
otherwise .
Definition 2.
Besov space:
For 1 ≤ p, q ≤ ∞ , α > 0 , r :=
⌈ α ⌉ + 1 , define
[Equation]
and define the norm of Besov space as:
[Equation]
A function f is in the Besov space B αp,q if ∥ f ∥ B αp,q is finite.
Note that the Besov space for 0 < p, q < 1 is also defined, but in this case it is a quasi-Banach space instead of a Banach space and will not be covered in this paper.
Functions in Besov space can be decomposed using B-spline basis functions.
Any function f in
Besov space B αp,q , α > d/p can be decomposed using B-spline of order m, m > α : let x ∈ R d ,
[Equation]
where J ( k ) :
= { 2 − k s : s ∈ [ − m, 2 k + m ] d ⊂ Z d } , M m,k, s ( x ) :=
M m (2 k ( x − s )) , and M k ( x ) =
(cid:81) di
=1 M k ( x i ) is the cardinal B-spline basis function which can be expressed as a polynomial:
[Equation]
Furthermore, the norm of Besov space is equivalent to the sequence norm:
[Equation]
See e.g. D ˜ ung (2011, Theorem 2.2) for the proof.
The Besov space is closely connected to other function spaces including the Hölder space ( C α ) and the Sobolev space ( W αp ).
Specifically, if the domain of the functions is d -dimensional (Suzuki, 2018;
Sadhanala et al., 2021),
• ∀ α ∈ N , B αp, 1 ⊂ W αp ⊂ B αp, ∞ , and B α 2 ,
= W α 2 .
• For 0 < α < ∞ and α ∈ N , C α = B α ∞ , ∞ .
• If α > d/p , B αp,q ⊂ C 0 .
C. O THER F UNCTION S PACES
Definition 3.
Hölder space: let m ∈ N , the m -th order Holder class is defined as
[Equation]
where D a denotes the weak derivative.
Note that fraction order of Hölder space can also be defined.
For simplicity, we will not cover that case in this paper.
Definition 4.
Sobolev space: let m ∈ N , 1 ≤ p ≤ ∞ , the Sobolev norm is defined as
[Equation]
1 /p , the Sobolev space is the set of functions with finite Sobolev norm:
[Equation]
Definition 5.
Total Variation (TV): The total variation (TV) of a function f on an interval [ a, b ] is defined as
[Equation]
where the P is taken among all the partitions of the interval [ a, b ] .
In many applications, functions with stronger smoothness conditions are needed, which can be measured by high order total variation.
Definition 6.
High order total variation: the m -th order total variation is the total variation of the ( m −
[Equation]
-th order derivative
[Equation]
Definition 7.
Bounded variation (BV): The m -th order bounded variation class is the set of functions whose total variation (TV) is bounded.
[Equation]
D P ROOF OF E STIMATION E RROR D. E QUIVALENCE B ETWEEN P ARALLEL N EURAL N ETWORKS AND p - NORM P ENALIZED P ROBLEMS
Proposition 4.
There exists an one-to-one mapping between λ > 0 and λ ′ >
such that (2) is equivalent to the following problem:
[Equation]
where ¯ f j ( · ) is a subnetwork with parameters ¯W ( ℓ ) j , ¯ b ( ℓ ) j .
Proof.
We make use of the property from (5) to minimize the constraint term in (7) while keeping this neural network equivalent to the original one.
Specifically, let W (1) , b (1) , . . .
W ( L ) , b ( L ) be the parameters of an L -layer neural network.
[Equation]
which is equivalent to
[Equation]
as long as α ℓ > 0 , (cid:81)
Lℓ =1 α L = (cid:81)
Lℓ =1 ∥ W ( ℓ ) ∥ F , where ˜ W ( ℓ ) :=
W
[Equation]
ℓ )
∥ W ( ℓ ) ∥ F .
By the AM-GM inequality, the ℓ 2 regularizer of the latter neural network is
[Equation]
and equality is reached when α 1 = α 2 = · · · = α L .
In other word, in the problem (2), it suffices to consider the network that satisfies
[Equation]
[Equation]
Using (5) again, one can find that the neural network is also equivalent to
[Equation]
where
[Equation]
where the last two equality comes from the assumption (14).
Choosing β ( ℓ ) =
c 1 √ w expect ℓ =where β (1) =
c 1 √ d , and scaling ¯ b ( ℓ ) accordingly and taking the regularizer in (2) into (15) finishes the proof.
D. C OVERING N UMBER OF P ARALLEL N EURAL N ETWORKS
Theorem 5.
The covering number of the model defined in (7) apart from the bias in the last layer satisfies
[Equation]
The proof relies on the covering number of each subnetwork in a parallel neural network (Lemma 10), observing that | f ( x ) | ≤ 2 L − 1 w L − 1 √ d under the condition in Lemma 10, and then apply Lemma 6.
We argue that our choice of condition on ∥ b ( ℓ ) ∥ 2 in Lemma 10 is sufficient to analyzing the model apart from the bias in the last layer, because it guarantees that
[Equation]
W
[Equation]
A
[Equation] [Equation]
x ) ∥ 2 ≤ ∥ b
[Equation]
ℓ ) ∥ 2 .
This leads to
[Equation]
If this condition is not met, W ( ℓ ) A ℓ − 1 ( x ) + b ( ℓ ) is either always positive or always negative for all feasible x along at least one dimension.
If ( W ( ℓ ) A ℓ − 1 ( x ) + b ( ℓ ) )
i is always negative, one can replace b ( ℓ ) )
i with − max x ∥ W ( ℓ ) A ℓ − 1 ( x ) ∥ ∞ without changing the output of this model for any feasible x .
If ( W ( ℓ ) A ℓ − 1 ( x ) + b ( ℓ ) )
i is always positive, one can replace b ( ℓ ) )
i with max x ∥ W ( ℓ ) A ℓ − 1 ( x ) ∥ ∞ , and adjust the bias in the next layer such that the output of this model is not changed for any feasible x .
In either cases, one can replace the bias b ( ℓ ) with another one with smaller norm while keeping the model equivalent except the bias in the last layer.
Lemma 10.
Let F ⊆ { f : R d → R } denote the set of L -layer neural network (or a subnetwork in a parallel neural network) with width w in each hidden layer.
It has the form f
[Equation] [Equation]
(16) and σ ( · ) is the ReLU activation function, the input satisfy ∥ x
∥ 2 ≤ 1 , then the supremum norm δ -covering number of F obeys
[Equation]
where c 7 is a constant depending only on d , and c 8 is a constant that depend on d, w and L .
Proof.
First study two neural networks which differ by only one layer.
Let g ℓ , g ′ ℓ be two neural networks satisfying (16) with parameters W 1 , b 1 , . .
, W L , b L and W ′ 1 , b ′ 1 , . . .
, W ′ L , b ′ L respectively.
Furthermore, the parameters in these two models are the same except the ℓ -th layer, which satisfy
[Equation]
Denote the model as
[Equation]
where A ℓ ( x ) = σ ( W ℓ − 1 σ ( . . .
σ ( W 1 x + b 1 ) . . . )
+ b ℓ − 1 ) denotes the first ℓ − 1 layers in the neural network, and A ℓ ( x ) =
W L σ ( . . .
σ ( W ℓ +1 σ ( x )+ b ℓ +1 ) . . . )
+ b L ) denotes the last L − ℓ − 1 layers, with definition
A 1 ( x ) = x , B L ( x
[Equation]
= x .
Now focus on bounding ∥A ( x ) ∥ .
Let W ∈ R m × m
[Equation]
where we make use of ∥ · ∥ 2 ≤ ∥ · ∥ F .
Because of that,
[Equation] [Equation]
Then focus on B ( x ) .
Let W ∈ R m × m ′ , ∥ W ∥ F ≤ √ m ′ , x , x ′ ∈
R m ′ , b ∈ R m ,
∥ b
∥ 2 ≤ √ m .
Furthermore, ∥ x − x ′ ∥ 2 ≤ ϵ , then
[Equation]
which indicates that ∥B ( x ) − B ( x
[Equation]
∥
[Equation]
≤
[Equation]
√
[Equation]
−
[Equation]
∥
[Equation]
∥
Finally, for any W , W ′ ∈ R m × m ′ , x ∈ R m ′ , b , b ′ ∈ R m , one have
[Equation]
In summary,
[Equation]
Let f ( x ) , f ′ ( x ) be two neural networks satisfying (16) with parameters W 1 , b 1 , . .
, W L , b L and
W ′ 1 , b ′ 1 , . . .
, W ′ L , b ′ L respectively, and ∥ W ℓ − W ′ ℓ
∥ F ≤ ϵ ℓ , ∥ b ℓ − b ′ ℓ ∥ F ≤ ˜ ϵ ℓ .
Further define f ℓ be the neural network with parameters W 1 , b 1 , . .
. , W ℓ , b ℓ , W ′ ℓ +1 , b ′ ℓ +1 , . .
, W ′ L , b ′ L , then
[Equation]
For any δ > 0 , one can choose
[Equation]
such that | f ( x ) − f ′ ( x ) | ≤ δ .
On the other hand, the ϵ -covering number of { W ∈ R m × m ′ :
∥ W ∥ F ≤ √ m ′ } on Frobenius norm is no larger than (2 √ m ′ /ϵ
+ 1) m × m ′ , and the ¯ ϵ -covering number of { b ∈ R
m : ∥ b ∥ 2 ≤ 1 } on infinity norm is no larger than (2 / ¯ ϵ + 1) m .
The entropy of this neural network can be bounded by
[Equation]
D. C OVERING N UMBER OF p -N ORM C ONSTRAINED L INEAR C OMBINATION
Lemma 6.
Let G ⊆
{ R d → [ − c 3 , c 3 ] } be a set with covering number satisfying log N ( G , δ ) ≲
k log(1 /δ ) for some finite c 3 , and for any g ∈ G , | a | ≤ 1 , we have ag ∈ G .
The covering number of
F = (cid:110)(cid:80)
Mi
=1 a
i g i (cid:12)(cid:12)(cid:12) g i ∈ G , ∥ a ∥ pp ≤ P, 0 < p < 1 (cid:111) for any P > 0 satisfies
[Equation]
up to a double logarithmic factor.
Proof.
Let ϵ be a positive constant.
Without the loss of generality, we can sort the coefficients in descending order in terms of their absolute values.
There exists a positive integer M (as a function of ϵ ), such that | a i | ≥ ϵ for i ≤ M , and | a i | <
ϵ for i > M .
By definition, M ϵ p ≤ (cid:80) M i =1 | a i | p ≤ P so M ≤ P/ϵ p , and | a i | p ≤ P, | a i | ≤ P 1 /p for all i .
Furthermore, (cid:88)
[Equation]
Let ˜ g
i = arg min g ∈ ˜ G
∥ g − a i P 1 /p g i ∥ ∞ where ˜ G is the δ ′ -convering set of G .
By definition of the covering set, (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)
M (cid:88) i =
a
[Equation]
M
[Equation]
Choosing
[Equation]
(19) we have M ≤ P 11 − p ( δ/ 2 c 3 ) − p 1 − p , M P 1 /p δ ′ ≤ δ/ 2 , c
Pϵ
[Equation]
p ≤ δ/ 2 , so (18) ≤ δ .
One can compute the covering number of F by
[Equation]
Taking (19) into (20) finishes the proof.
E P ROOF OF A PPROXIMATION E RROR E. A PPROXIMATION OF N EURAL N ETWORKS TO B- SPLINE B ASIS F UNCTIONS
Lemma 11.
Let M m,k, s be the B-spline of order m with scale 2 − k in each dimension and position s ∈ R d : M m,k, s ( x ) :
= M m (2 k ( x − s )) , M m is defined in (13).
There exists a neural network with d -dimensional input and one output, with width w d,m =
O ( dm ) and depth L ≲ log( c d,m /ϵ ) for some constant c d,m that depends only on m and d , approximates the B spline basis function M m,k, s ( x ) :
= M m (2 k ( x − s )) as defined in Section C.1.
This neural network, denoted as ˜ M m,k, s ( x ) , x ∈ R d , satisfy
• | ˜ M m,k, s ( x ) − M m,k, s ( x ) | ≤ ϵ , if 0 ≤ 2 k
( x i − s i ) ≤ m + 1 , ∀ i ∈
[ d ] , • ˜ M m,k, s ( x ) = 0 , otherwise.
• The weight in each layer has bounded norm ∥ W ( ℓ ) ∥ F ≲ 2 k/L √ w , except the first layer where ∥ W (1) ∥
F ≤ 2 k/L √ d .
Note that the product of the coefficients among all the layers are proportional to 2 k , instead of 2 km when approximating truncated power basis functions.
This is because the transformation from M m to M m,k, s only scales the domain of the function by 2 k , while the codomain of the function is not changed.
To apply the transformation to the neural network, one only need to scale weights in the first layer by 2 k , which is equivalent to scaling the weights in each layer bt 2 k/L and adjusting the bias according.
As for the proof, we follow the method developed in Yarotsky (2017); Suzuki (2018), while putting our attention on bounding the Frobenius norm of the weights.
Lemma 12 (Yarotsky (2017, Proposition 3)) .
: There exists a neural network with two-dimensional input and one output f × ( x, y ) , with constant width and depth O (log(1 /δ )) , and the weight in each layer is bounded by a global constant c 1 , such that
• | f × ( x, y ) − xy | ≤ δ, ∀ 0 ≤ x, y ≤ 1 , • f × ( x, y ) =
0 , ∀ x = 0 or y = 0 .
We first prove a special case of Lemma 11 on the unscaled, unshifted B-spline basis function by fixing k = 0 , s = 0 :
Proposition 13.
There exists a neural network with d -dimensional input and one output, with width w = w ( d, m ) ≂ dm and depth L ≲ log( c ( m, d ) /ϵ ) for some constant w, c that depends only on m and d , denoted as ˜ M m ( x ) , x ∈ R d , such that
• | ˜
M m ( x ) − M m ( x ) | ≤ ϵ , if 0 ≤ x i ≤ m + 1 , ∀ i ∈
[ d ] , while M m ( · ) denote m -th order B-spline basis function, • ˜ M m ( x ) = 0 , if x i ≤ 0 or x i ≥ m + 1 for any i ∈ [ d ] .
• The weight in each layer has bounded norm ∥ W ( ℓ ) ∥ F ≲ √ w .
Proof.
We first show that one can use a neural network with constant width w 0 , depth L ≂ log( m/ϵ 1 ) and bounded norm ∥ W (1) ∥
F ≤ O ( √ d ) , ∥ W ( ℓ ) ∥
F ≤ O ( √ w ) , ∀ ℓ = 2 , . . .
, L to approximate truncated power basis function up to accuracy ϵ 1 in the range [0 , 1] .
Let m =
(cid:80) ⌈ log 2 m ⌉ i
= m
i 2 i , m i ∈ { 0 , 1 } be the binary digits of m , and define ¯ m j = (cid:80) ij =
m i , γ = ⌈ log 2 m ⌉ , then for any x
[Equation]
Notice that each line of equation only depends on the line immediately below.
Replacing the multiply operator × with the neural network approximation shown in Lemma 12 demonstrates the architecture of such neural network approximation.
For any x, y ∈ [0 , 1] , let | f × ( x, y )
− xy | ≤ δ, | x − ˜ x | ≤ δ 1 , | y − δy | ≤
δ 2 , then | f × (˜ x, ˜ y ) − xy | ≤ δ 1 + δ 2 + δ .
Taking this into (21) shows that ϵ 1 ≂ 2 γ δ ≂ mδ , where ϵ 1 is the upper bound on the approximate error to truncated power basis of order m
and δ is the approximation error to a single multiply operator as in Lemma 12.
A univariate B-spline basis can be expressed using truncated power basis, and observing that it is symmetric around ( m + 1) / 2 :
[Equation]
A multivariate ( d -dimensional) B-spline basis function can be expressed as the product of truncated power basis functions and thus can be decomposed as
[Equation]
Using Lemma 12, one can construct m + 1 number of neural networks, and each of them has width w 0 and depth L
= O (log( m/ϵ 1 ) , such that the ( j + 1) -th neural network approximates ( x − j ( m +1) / 2 ) m
+ with error no more than ϵ 1 for any 0 ≤ x ≤ ( m + 1) / 2 .
The weighted summation of these subnetworks can approximate the univariate B-spline basis function with error no more than
[Equation]
where we applied Stirling’s approximation.
A multivariate B-spline basis is the product of univariate B-spline basis along each dimension
[Equation]
We can construct a neural network to approximate this function by parallizing d number of neural networks to approximate each B-spline basis function along each dimension, and use the last L 1 ≂ log( d/δ ) layers to approximate their product.
The totol approximation error of this function is bounded by
[Equation]
where δ and ϵ 1 has the same definition as above.
Choosing δ =
ϵ d ( e 2 m √ m +1) , and recall ϵ 1 ≂ mδ proves the approximation error.
The proof of the Lemma 11 for general k, s follows by appending one more layer in the front, as we show below.
Proof of Lemma 11.
Using the neural network proposed in Proposition 13, one can construct a neural network for appropximating M m,k, s by adding one layer before the first layer:
[Equation]
The unused neurons in the first hidden layer is zero padded.
The Frobenius norm of the weight is 2 k ∥
I d ∥ F = 2 k √ d .
Following the proof of Proposition 4, rescaling the weight in this layer by 2 − k , and the weight matrix in the last layer by 2 k , and scaling the bias properly, one can verify that this neural network satisfy the statement.
E. S PARSE APPROXIMATION OF B ESOV FUNCTIONS USING B- SPLINE WAVELETS
Proposition 7.
Let α − d/p > 1 , r > 0 .
For any function in Besov space f 0 ∈ B αp,q and any positive integer ¯ M , there is an ¯ M -sparse approximation using B-spline basis of order m satisfying 0 < α < min( m, m − 1 + 1 /p ) :
ˇ f ¯ M = (cid:80) ¯ Mi =1 a k
i , s i M m,k i , s i for any positive integer
¯ M such that the approximation error is bounded as ∥
ˇ f ¯ M − f
∥
r ≲ ¯ M − α/d ∥ f 0 ∥ B αp,q , and the coefficients satisfy
[Equation]
Remark 1.
{+The requirement in Proposition 7: α − d/p > 1 is stronger than the condition typically found in approximation theorem α − d/p ≥ 
+}
(D˜ung, 2011), so-called “Boundary of continuity”, or the condition in Suzuki (2018)
α > d (1 /p − 1 /r )
+ .
This is because although the functions in B αp,q when 0 ≤ α − d/p < 1 can be approximated by B-spline basis, the sum of weighted coefficients may not converge.
One simple example is the step function f step ( x ) = 1 ( x ≥ 0 . 5) , f step ∈ B 11 , ∞ .
Although it can be decomposed using first order B-spline basis as in (12), the summation of the coefficients is infinite.
Actually one only needs a ReLU neural network with one hidden layer and two neurons to approximate this function to arbitrary precision, but the weight need to go to infinity.
The proof is divided into three steps:
Bound the 0-norm and the 1-norm of the coefficients of B-spline basis in order to approximate an arbitrary function in Besov space up to any ϵ > 0 . 2.
Bound p -norm of the coefficients of B-spline basis functions where 0 < p < 1 using the results above .
Add the approximation to neural network to B-spline basis computed in ??
into Step 2.
Proof.
D ˜ ung (2011, Theorem 3.1) Suzuki (2018, Lemma 2) proposed an adaptive sampling recovery method that approximates a function in Besov space.
The method is divided into two cases: when p ≥ r , and when p < r .
When p ≥ r , there exists a sequence of scalars λ j , j ∈ P d ( µ ) , P d ( µ ) :=
{ j ∈ Z d : | j i | ≤ µ, ∀ i ∈ d } for some positive µ , for arbitrary positive integer ¯ k , the linear operator Q [Equation] (cid:88)
[Equation]
has bounded approximation error
[Equation]
where ¯ f is the extrapolation of f , J (¯ k, m, d ) :
= { s : 2 ¯ k s ∈ Z d , − m/ 2 ≤ 2 ¯ k s i ≤ 2 ¯ k + m/ 2 , ∀ i ∈
[ d ] } .
See D ˜ ung (2011, 2.6-2.7) for the detail of the extrapolation as well as references for options of sequence λ j .
Furthermore, Q ¯ k ( f ) ∈ B αp,q so it can be decomposed in the form (12) with M = (cid:80) ¯ kk =
(2 k + m − 1) d ≲ 2 ¯ kd components and ∥{ ˜ c k, s } k, s ∥ ≲
∥ Q ¯ k ( f ) ∥ B αp,q ≲ ∥ f ∥ B αp,q where ˜ c k, s is the coefficients of the decomposition of Q ¯ k ( f ) .
Choosing ¯ k ≂ log 2 M/d leads to the desired approximation error.
On the other hand, when p < r , there exists a greedy algorithm that constructs
[Equation]
where ¯ k ≂ log 2 ( M ) , k ∗ =
[ ϵ − 1 log( λM )]
+ ¯ k + 1 , n k
=
[ λM 2 − ϵ
k − ¯ k ) ] for some 0 <
ϵ < α/δ − 1 , δ =
d (1 /p − 1 /r ) , λ > 0 , such that
[Equation]
and ¯
[Equation]
Finally, since α − d/p > 1 ,
[Equation]
) where the first line is because for arbitrary vectors a i , i ∈ [ n ] , ∥ (cid:80) ni
=1 a i ∥ p ≤ (cid:80) ni =1 ∥ a i ∥ p , the third line is because the sequence norm of B-spline decomposition is equivalent to the norm in
Besov space (see Section C.1) .
Note that when α − d/p = 1 , the sequence norm (23) is bounded (up to a factor of constant) by k ∗ ∥ f ∥ B αp,q , which can be proven by following (23) except the last line.
This adds a logarithmic term with respect to ¯ M compared with the result in Proposition 7.
This will add a logarithmic factor to the MSE.
We will not focus on this case in this paper of simplicity.
E. S PARSE APPROXIMATION OF B ESOV FUNCTIONS USING P ARALLEL N EURAL N ETWORKS
Theorem 8.
Under the same condition as Proposition 7, for any positive integer ¯ M , any function in
Besov space f 0 ∈ B αp,q can be approximated by a parallel neural network with no more than O ( ¯ M ) number of subnetworks satisfying:
Each subnetwork has width w =
O
( md ) and depth L . 2.
The weights in each layer satisfy ∥ ¯W ( ℓ ) k
∥ F ≤ O ( √ w ) except the first layer ∥ ¯W (1) k
∥ F ≤ O ( √ d ) , 3.
The scaling factors have bounded 2 /L
-norm: P ′ :
= ∥{ a j }∥ 2 /L 2 /L ≲ ¯ M 1 − 2 / ( pL ) .
The approximation error is bounded by
[Equation]
where c 4 , c 5 , c 6 are constants that depend only on m, d and p .
We first prove the following lemma.
Lemma 14.
For any a ∈ R ¯ M , 0 < p ′ < p , it holds that:
[Equation]
Proof.
(cid:88)
[Equation]
The first inequality uses a Holder’s inequality with conjugate pair p p ′ and 1 / (1 − p ′ p ) .
Proof of Theorem 8.
Using Proposition 7, one can construct ¯ M number of NN according to
Lemma 11, such that each NN represents one B-spline basis function.
The weights in the last layer of each NN is scaled to match the coefficients in Proposition 7.
Taking p ′ in Lemma 14 as 2 /L and combining with Lemma 11 finishes the proof.
F P ROOF OF THE M AIN T HEOREM
Theorem 1 extended form.
For any fixed α − d/p > 1 , q ≥ 1 , L ≥ 3 , define m = ⌈ α − 1 ⌉ .
For any f 0 ∈ B αp,q , given an L -layer parallel neural network satisfying
• The width of each subnetwork is fixed satisfying w ≥
O ( md ) .
See Theorem 8 for the detail.
• The number of subnetworks is large enough : M ≳ n {+1 − 2 /L 
+}
α/d +1 − 2 / ( pL ) .
Under the assumption as in Lemma 17, with proper choice of the parameter of regularizaton λ that depends on D , α, d, L , the solution ˆ f parameterized by (2) satisfies
[Equation]
where ˜ O shows the scale up to a logarithmic factor, and c 6 is the constant defined in Theorem 8.
Proof.
First recall the relationship between covering number (entropy) and estimation error:
Proposition 15.
Let F ⊆ { R d → [ − F, F ] } be a set of functions.
Assume that F can be decomposed into two orthogonal spaces
F = F ∥ × F ⊥ where F ⊥ is an affine space with dimension of N. Let f 0 ∈ { R d → [ − F, F ] } be the target function and ˆ f be the least squares estimator in F :
[Equation]
then it holds that
[Equation]
The proof of Proposition 15 is defered to the section below.
We choose F as the set of functions that can be represented by a parallel neural network as stated, the (null) space F ⊥ =
{ f : f ( x ) = constant } be the set of functions with constant output, which has dimension 1.
This space captures the bias in the last layer, while the other parameters contributes to the projection in F ∥ .
See Section D.2 for how we handle the bias in the other layers.
One can find that F ∥ is the set of functions that can be represented by a parallel neural network as stated, and further satisfy (cid:80) ni =1 f ( x i )
= 0 .
Because F ∥ ⊆
F , N ( F ∥ , δ ) ≤ N ( F , δ ) for all δ > 0 , and the latter is studied in Theorem 5.
In Theorem 1, the width of each subnetwork is no less than what is required in Theorem 8, while the depth and norm constraint are the same, so the approximation error is no more
that that in Theorem 8.
Choosing r = 2 , p = 2 /L , and taking Theorem 5 and Theorem 8 into this Proposition 15, one gets
[Equation]
where ∥ f ∥ B αp,q , m and d taken as constants
By choosing
[Equation]
we get
[Equation]
where MSE( ˆ f ) shows the MSE of the solution to constrained optimization problem (7) by optimally choosing ¯ M (or P ′ ).
Finally, under the assumption in Lemma 17, for any constrained optimization problem, there exists a regularized optimzation problem, whose MSE is not larger than the MSE of the constrained optimization problem up to a factor of a constant.
This closes the connection between (6) and (7) and finishes the proof.
Note that the empirical risk minimizer (ERM) of the parallel nerual network satisfy that the (2 /L ) - norm of the coefficients of the parallel neural network satisfy that ∥{ a j }∥ 2 /L 2 /L =
∥{ ˜ a j, ¯ M }∥ 2 /L 2 /L where { ˜ a j, ¯ M } is the coefficient of the particular ¯ M -sparse approximation, although { a j } is not necessarily ¯
M sparse.
Empirically, one only need to guarantee that during initialization, the number of subnetworks M ≥ ¯ M such that the ¯ M -sparse approximation is feasible, thus the approximation error bound from Theorem 8 can be applied.
Theorem 8 also says that ∥{ a j }∥ 2 /L 2 /L =
∥{ ˜ a j, ¯ M }∥ 2 /L 2 /L ≲ ¯ M 1 − 2 /pL , thus we can apply the covering number bound from Theorem 5 with P ′ =
¯ M 1 − 2 /pL .
Finally, if λ is optimally chosen, then it achieves a smaller MSE than this particular λ ′ , which has been proven to be no more than O ( ¯ M − α/d ) and completes the proof.
Proof of Proposition 15.
For any function f ∈ F , define f ⊥ = arg min
h ∈F ⊥ (cid:80) ni
=
( f ( x i ) − h ( x i ))
2 be the projection of f to F ⊥ , and define f ∥ = f − f ⊥ be the projection to the orthogonal complement.
Note that f ∥ is not necessarily in F ∥ .
However, if f ∈ F , then f ∥ ∈ F ∥ .
y i ⊥ and y i ∥ are defined by creating a function f
y such that f y ( x i ) =
y i , ∀ i , e.g. via interpolation.
Because
F ∥ and F ⊥ are orthogonal, the empirical loss and population loss can be decomposed in the same way: [Equation] ∥
[Equation]
such that L ( f ) =
L ∥ ( f ) + L ⊥ ( f ) , ˆ L ( f ) =
ˆ L ∥ ( f ) + ˆ L ⊥ ( f ) .
This can be verified by decomposing ˆ f, f 0 and y into two orthogonal components as shown above, and observing that (cid:80) ni
[Equation]
First prove the following claim
Claim 16.
Assume that ˆ f = arg min f ∈F ˆ L ( f ) is the empirical risk minimizer.
Then ˆ f ⊥ = arg min f ∈F ⊥ ˆ L ⊥ ( f ) , ˆ f ∥ = arg min f ∈F ∥ ˆ L ∥ ( f ) , where ˆ f ⊥ is the projections of ˆ f in F ⊥ , and ˆ f ∥
= ˆ f − ˆ f ⊥ respectively.
Proof.
Since ˆ f ∈ F , by definition ˆ f ∥ ∈ F ∥ .
Assume that there exist ˆ f ′⊥ , ˆ f ′∥ , and either ˆ L ⊥ ( ˆ f ′⊥ ) <
ˆ L ⊥ ( ˆ f ⊥ ) , or ˆ L ∥ ( ˆ f ′∥ ) <
ˆ L ∥ ( ˆ f ∥ ) .
Then
[Equation]
which shows that ˆ f is not the minimizer of ˆ L ( f ) and violates the assumption.
Then we bound MSE ⊥ ( f ) .
We convert this part into a finite dimension least square problem:
[Equation]
The forth line comes from our assumption that F ⊥ is orthogonal to F ∥ , so ∀ f ∈ F ⊥ , f + f 0 ⊥ + ϵ ⊥ is orthogonal to ϵ ∥ .
Let the basis function of F ⊥ be h 1 , h 2 , . .
, h N , the above problem can be reparameterized as
[Equation]
where X ∈ R n × N : X i =
h j ( x i ) , y = y
⊥ + ϵ , y 0 ⊥ =
[ f 0 ⊥ ( x 1 ) , . . .
, f 0 ⊥ ( x n )] , ϵ =
[ ϵ 1 , . .
ϵ n ] .
This problem has a closed-form solution
[Equation]
Observe that f 0 ⊥ ∈ F ⊥ , let y
⊥ =
X θ ∗ ,The MSE of this problem can be computed by
[Equation]
ϵ
[Equation]
Observing that Π :=
X ( X T X ) − 1 X T is an idempotent and independent projection whose rank is
N , and that E [ ϵϵ T ] =
σ 2 I , we get
[Equation]
which concludes that
[Equation]
See also (Hsu et al., 2011, Proposition 1).
Next we study MSE ∥
( ˆ f ) .
Denote ˜ σ 2 ∥ = 1 n (cid:80) ni
=
ϵ 2 i ∥ , E = max i
| ϵ i | .
Using Jensen’s inequality and union bound, we have
[Equation]
Taking expectation over both sides, we get
[Equation]
maximizing the right hand side over t yields
[Equation]
Let ˜ F ∥ be the covering set of F ∥ = { f ∥ : f ∈ F} .
For any ˜ f ∥ ∈ ˜ F ∥ ,
[Equation]
The first term can be bounded using Bernstein’s inequality: let h i
=
ϵ i ( f j ∥ ( x i ) − f 0 ∥ ( x i )) , by definition
| h i | ≤ 2 EF ,
[Equation]
using Bernstein’s inequality, for any ˜ f ∥ ∈ ˜ F ∥ , with probably at least 1 − δ p , n [Equation] n
[Equation]
the last inequality holds true for all ϵ > 0 .
The union bound shows that with probably at least 1 − δ , for all ˜ f ∥ ∈ ˜ F ∥ ,
[Equation]
By rearanging the terms and using the definition of L ( ˜ f ∥ )
[Equation]
we get
[Equation]
Taking the expectation (over D ) on both sides
[Equation]
and notice that E [˜ σ 2 ∥ ] = n − Nn σ 2 .
Furthermore, for any random variable X, E [ X ] = (cid:82) ∞
−∞ xdP ( X ≤ x ) , we get
[Equation]
where the integration can be computed by replacing δ with e x .
Though it is not integrable under
Riemann integral, it is integrable under Lebesgue integration.
Similarly, let ˇ f ∥ = arg min f [Equation]
L ∥ ( f ) ,
[Equation]
with probably at least 1 − δ q , for any ϵ > 0 , −
[Equation]
Taking the expectation on both sides
[Equation]
[Equation]
Finally, let ˆ f [Equation] arg [Equation]
˜ [Equation] ∥ (cid:80) n i =
[Equation]
( ˆ f ∥ ( x [Equation] − f ( x [Equation]
)) 2 be the projection of ˆ f ∥ in its δ -covering space,
[Equation]
and similarly
[Equation]
[Equation]
We can conclude that
[Equation]
where the first line comes from (27), and second comes from (29), the thid line is because ˆ f ∥ =
arg min f ∈F ∥ ˆ L ∥ ( f ) , and the last line comes from (28).
We also use that fact that ˆ L ∥ ( ˆ f ) ≤ ˆ L ∥ ( f ) , ∀ f .
Noticing that MSE( ˆ f )
=
MSE ∥
( ˆ f ) + MSE ⊥
( ˆ f ) , combining this with (26) finishes the proof.
Lemma 17.
Assume that these exists C 1 , C 2 > 1 (which may depend on the target function), for all P ′ > 0 , there exists λ > 0 , such that the soltion to the regularized optimization problem (6), denoted as ˜ f , satisfy
[Equation]
then the MSE of the regularized optimization problem satisfy
[Equation]
where C is a constant that depends on C 1 , C 2 , ˆ f is the solution to the constrained optimzation problem (7), and
[Equation]
Proof.
The MSE of the regularized problem can be achieved by taking our assumtion into (4).
We only need to prove the selection of λ .
We apply the decomposition as in Proposition 15, and only need to consider F ∥ , as F ⊥ is not imfluenced by regularization or constrained.
From the definition of ˜ f and λ , we have
[Equation]
From Proposition 15, we get
[Equation]
Observing that MSE( ˜ f ) ≥ 0 , and log N ( ∥{ ˆ a j }∥ [Equation] L ,δ ) n ≂ MSE ( ˆ f ) for the optimally chosen P ′ , taking the assumtion into the inequality proves the choice of λ . Remark 2.
Define R ( λ ) :
= R (arg min ˆ L ( f )+ λR ( f )) , where R ( f ) =
∥{ a j }∥ 2 /L 2 /L is the regularizer term of a parallel NN ( f ).
Notice that R ( λ ) is a non-increasing function of lambda (as proved below), the assumption in Lemma 17 is equivalent to that if R ( λ ) contains any uncontinuous points, then the uncontinuous points should not be larger than C 2 C 1 in ratio.
On the other hand, if λ is chosen as λ = O ( MSE( ˆ f ) P ′ ) , then from (30), we get [Equation] If the constant term in λ is large enough, the above inequality yields two sets of solutions:
[Equation]
and
[Equation]
In the first case, one can easily see from (30)
that MSE( ˜ f ) ≤ O (MSE( ˆ f )) , which says that the MSE of the regularized problem is close to the minimax rate; in the later case, the generalization gap of the regularized problem is bounded by O ( n 1 − 2 /L 2 /L
λ L/ 2 ) ,
which is much larger than the former case.
So a sufficient condition of the above assumption is that the model does not overfit significantly (by orders of magnitude) more than the constrained version.
In our experiment, we find that the latter case is Notably, as L gets larger, in the second case ∥{ ˜ a j }∥ 2 /L 2 /L increases exponentially with L (the constant terms depends at most polynomially on L ), which suggests that the latter case is less likely to happen for deep neural networks.
Claim 18.
For fixed D , the regularized problem satisfy that R ( λ ) as defined above is strictly nonincreasing with λ .
Proof.
We provide a short proof by contradiction: suppose that there exists lambda 1 < λ 2 , and the solution satisfy ( f 1 ) <
R ( f 2 ) where R ( f ) =
∥{ a j }∥ 2 /L 2 /L is the regularizer term of a parallel NN, f 1 , f 2 are the solution to the regularized problem with λ
=
λ 1 , λ 2 respectively.
Then by definition of f 1 , f 2 , we have ˆ L ( f 1 )+ λ 1 R ( f 1 ) ≤ ˆ L ( f 2 )+ λ 1 R ( f 2 ) , so λ 1 ≥ ˆ L ( f 1 ) − ˆ L ( f 2 ) R ( f 2 ) − R ( f 1 ) ; ˆ L ( f 2 )+ λ 2 R ( f 2 ) ≤ ˆ L ( f 1 ) + λ 2 R ( f 1 ) , so λ 2 ≤ ˆ L ( f 1 ) − ˆ L ( f 2 ) R ( f 2 ) − R ( f 1 ) which is controversal to our assumption that λ 1 < λ 2 .
G M ORE DISCUSSION ABOUT THE MAIN RESULT
Representation learning and adaptivity.
The results also shed a light on the role of representation learning in DNN’s ability to adapt.
Specifically, different from the two-layer NN in (Parhi & Nowak, 2021a), which achieves the minimax rate of BV ( m ) by choosing appropriate activation functions using each m , each subnetwork of a parallel NN can learn to approximate the spline basis of an arbitrary order, which means that if we choose L to be sufficiently large, such Parallel NN with optimally tuned λ is simultaneously near optimal for m = 1 , 2 , 3 , . . . .
In fact, even if different regions of the space has different orders of smoothness, the paralle NN will still be able to learn appropriate basis functions in each local region.
To the best of our knowledge, this is a property that none of the classical nonparametric regression methods possess.
Synthesis v.s. analysis methods.
Our result could also inspire new ideas in estimator design.
There are two families of methods in non-parametric estimation.
One called synthesis framework which focuses on constructing appropriate basis functions to encode the contemplated structures and regress the data to such basis, e.g., wavelets (Donoho et al., 1998).
The other is called analysis framework which uses analysis regularization on the data directly (see, e.g., RKHS methods (Scholkopf & Smola, 2001) or trend filtering (Tibshirani, 2014)).
It appears to us that parallel NN is doing both simultaneously.
It has a parametric family capable to synthesizing an O ( n ) subset of an exponentially large family of basis, then implicitly use sparsity-inducing analysis regularization to select the relevant basis functions.
In this way the estimator does not actually have to explicitly represent that exponentially large set of basis functions, thus computationally more efficient.
Random design problem.
This paper focuses on the fixed design problem such that the results are comparable to that in nonparametic regression.
One can easily apply the technique in this paper to achieve the estimation error bound on the random design problem:
Theorem 19.
Under the same condition as Theorem 1, the solution ˆ f parameterized by (2) satisfies
[Equation]
where ˜ O shows the scale up to a logarithmic factor, and c 6 is the constant defined in Theorem 8,
E D indicates that the expectation is taken with respect to the training set D , E f indicates that the expectation is taken with respect to the domain of f .
The proof is similar to that of Theorem 1.
The main difference lays in the proof of the estimation error.
For f ⊥ part, the estimation error can be bounded using VC-dimension, which is 1.
For f ∥ part, the estimation error can be bounded using its covering number, e.g. Lemma 8 in Schmidt-Hieber (2020).
H D ETAILED EXPERIMENTAL SETUP H. T ARGET F UNCTIONS
The doppler function used in Figure 3(d)-(f) is
[Equation]
The “vary” function used in Figure 3(g)-(i) is
[Equation]
where M 1 , M 3 are first and third order Cardinal B-spline bases functions respectively.
We uniformly take 256 samples from 0 to 1 in the piecewise cubic function experiment, and uniformly 1000 samples from 0 to 1 in the doppler function and “vary” function experiment.
We add zero mean independent (white) Gaussian noise to the observations.
The standard derivation of noise is 0.4 in the doppler function experiment and 0.1 in the “vary” function experiment.
H. T RAINING /F ITTING M ETHOD
In the piecewise polynomial function (“vary”) experiment, the depth of the PNN L = 10 , the width of each subnetwork w = 10 , and the model contains M = 500 subnetworks.
The depth of NN is also 10, and the width is 240 such that the NN and PNN have almost the same number of parameters.
In the doppler function experiment, the depth of the PNN L = 12 , the width of each subnetwork w = 10 , and the model contains M = 2000 subnetworks, because this problem requires a more complex model to fit.
The depth of NN is 12, and the width is 470.
We used Adam optimizer with learning rate of 10 − 3 .
We first train the neural network layer by layer without weight decay.
Specifically, we start with a two-layer neural network with the same number of subnetworks and the same width in each subnetwork, then train a three layer neural network by initializing the first layer using the trained two layer one, until the desired depth is reached.
After that, we turn the weight decay parameter and train it until convergence.
In both trend filtering and smoothing spline experiment, the order is 3, and in wavelet denoising experiment, we use sym4 wavelet with soft thresholding.
We implement the trend filtering problem according to Tibshirani (2014) using CVXPY, and use MOSEK to solve the convex optimization problem.
We directly call R function smooth.spline to solve smoothing spline.
H. P OST P ROCESSING
The degree of freedom of smoothing spline is returned by the solver in R, which is rounded to the nearest integer when plotting.
To estimate the degree of freedom of trend filtering, for each choice of λ , we repeated the experiment for 10 times and compute the average number of nonzero knots as estimated degree of freedom.
For neural networks, we use the definition (Tibshirani, 2015):
[Equation]
(31) where df denotes the degree of freedom, σ 2 is the variance of the noise, y are the labels, ˆ y are the predictions and y ′ are independent copy of y .
We find that estimating (31) directly by sampling leads to large error when the degree of freedom is small.
Instead, we compute
[Equation]
(32) where ˆ df is the estimated degree of freedom, E denotes the empirical average (sample mean), y 0 is the target function and ¯ y 0 is the mean of the target function in its domain.
Proposition 20.
The expectation of (32) over the dataset D equals (31).
Proof.
[Equation]
where D denotes the dataset.
In the third line, we make use of the fact that E [ ϵ i ] = 0 , E [ ϵ 2 i ] =
σ 2 , and in the last line, we make use of E
[ ϵ ′ i ]
= 0 , E
[ ϵ ′ i 2 ]
= σ 2 , and ϵ ′
i are independent of y i and y 0 ,
i
One can easily check that a “zero predictor” (a predictor that always predict ¯ y 0 , and it always predicts 0 if the target function has zero mean) always has an estimated degree of freedom of 0.
In Figure 3(h)(i), we take the minimum MSE over different choices of λ , and plot the average over 10 runs.
Due to optimization issue, sometimes the neural networks are stuck at bad local minima and the empirical loss is larger than the global minimum by orders of magnitude.
To deal with this problem, in Figure 3(h)(i), we manually detect these results by removing the experiments where the MSE is larger than 1.5 times the average MSE under the same setting, and remove them before computing the average.
H. M ORE EXPERIMENTAL RESULTS H.4. R EGULARIZATION WEIGHT VS DEGREE - OF - FREEDOM
As we explained in the previous section, the degree of freedom is the exact information-theoretic measure of the generalization gap.
A Larger degree-of-freedom implies more overfitting.
[Figure]
In figure Figure 4, we show the relationship between the estimated degree of freedom and the scaling factor of the regularizer λ in a parallel neural network and in trend filtering.
As is shown in the
[Figure] [Figure]
(c) 0.
Trend filtering ObservationTarget function prediction (d) 0.
Smoothing spline ObservationTarget function
Prediction (e) 0.
Output of each subnetwork (f) figure, generally speaking as λ decreases towards 0 , the degree of freedom should increase too.
However, for parallel neural networks, if λ is very close to 0 , the estimated degree of freedom will not increase although the degree of freedom is much smaller than the number of parameters — actually even smaller than the number of subnetworks.
Instead, it actually decreases a little.
This effect has not been observed in other nonparametic regression methods, e.g. trend filtering, which overfits every noisy datapoint perfectly when λ → 0 .
But for the neural networks, even if we do not regularize at all, the among of overfitting is still relatively mild 30 / 256 vs 80 / 1000 .
In our experiments using neural networks, when λ is small, we denoise the estimated degree of freedom using isotonic regression.
We do not know the exact reason of this curious observation.
Our hypothesis is that it might be related to issues with optimization, i.e., the optimizer ends up at a local minimum that generalizes better than a global minimum; or it could be connected to the “double descent” behavior of DNN (Nakkiran et al., 2021) under over-parameterization.
H.4. D ETAILED NUMERICAL RESULTS
In order to allow the readers to view our result in detail, we plot the numerical experiment results of each method separately in Figure 5 and
H.4. P RACTICAL EQUIVALENCE BETWEEN THE WEIGHT - DECAYED TWO - LAYER NN AND L1-T REND F ILTERING
In this section we investigate the equivalence of two-layer NN and the locally adaptive regression splines from Section B.
In the special case when m = 1 the special regularization reduces to weight decay and the non-standard truncated power activation becomes ReLU.
We compare L1 trend filtering (Kim et al., 2009) (shown to be equivalent to locally adaptive regression splines by Tibshirani (2014)) and an overparameterized version of the neural network for all regularization parameter λ > 0 , i
[Figure]
e., a regularization path.
The results are shown in Figure 7.
It is clear that as the weight decay increases, it induces sparsity in the number of knots it selects similarly to L1-Trend Filtering, and the regularization path matches up nearly perfectly even though NNs are also learning knots locations.
[Figure]