A C OMPARISON OF H AMMING E RRORS OF R EPRESENTATIVE V ARIABLE S ELECTION M ETHODS
A BSTRACT
Lasso is a celebrated method for variable selection in linear models, but it faces challenges when the variables are moderately or strongly correlated.
This motivates alternative approaches such as using a non-convex penalty, adding a ridge regularization, or conducting a post-Lasso thresholding.
In this paper, we compare Lasso with 5 other methods: Elastic net, SCAD, forward selection, thresholded Lasso, and forward backward selection.
We measure their performances theoretically by the expected Hamming error, assuming that the regression coefﬁcients are iid drawn from a two-point mixture and that the Gram matrix is block-wise diagonal.
By deriving the rates of convergence of Hamming errors and the phase diagrams, we obtain useful conclusions about the pros and cons of different methods.
I NTRODUCTION
Variable selection is one of the core problems in high-dimensional data analysis.
Consider a linear regression, where the response y ∈ R n and the design matrix X
=
[ x 1 , . . .
, x p ] ∈ R n × p satisfy that
[Equation]
The goal is estimating the support of β ( Supp( β ) ).
Lasso (Tibshirani, 1996) is a popular method:
[Equation]
Lasso has good rates of convergence on the L q -estimation error or prediction error (Bickel et al., 2009).
However, it can be unsatisfactory for variable selection, especially when the columns in the design matrix are moderately or strongly correlated.
Zhao & Yu (2006) showed that an irrepresentable condition on X is necessary for Lasso to recover Supp( β ) with high probability, and such a condition is restrictive when p is large (Fan & Lv, 2010).
Ji & Jin (2012) studied the Hamming error of Lasso and revealed Lasso’s non-optimality by lower-bounding its Hamming error rate.
Many alternative strategies were proposed for variable selection, such as using non-convex penalties (Fan & Li, 2001;
Zhang, 2010; Shen et al., 2012), adding a ridge regularization (Zou & Hastie, 2005), post-processing on the Lasso estimator (Zou, 2006; Zhou, 2009), and iterative algorithms (Zhang, 2011; Donoho et al., 2012).
In this paper, our main interest is to theoretically compare these different strategies.
Existing theoretical studies focused on ‘model selection consistency’ (e.g., Fan & Li (2001);
Zhao &
Yu (2006); Zou (2006); Meinshausen & Bühlmann (2010); Loh & Wainwright (2017)), which uses
P (Supp(ˆ β ) =
Supp( β )) to measure the performance of variable selection.
However, for many real applications, the study of the Hamming error (i.e., total number of false positives and false negatives) is in urgent need.
For example, in genome-wide association studies (GWAS) or Genetic Regulatory
Network, the goal is to identify the genes or SNPs that are truly associated with a given phenotype, and we hope to ﬁnd a multiple testing procedure that simultaneously controls the FDR and maximizes the power (for multiple testing).
This problem can be re-cast as minimizing the Hamming error in a special regression setting (Efron, 2004; Jin, 2012; Sun & Cai, 2007).
This motivates us to study the
Hamming errors of variable selection methods, which were rarely considered in the literature.
We adopt the rare and weak signal model (Donoho & Jin, 2004; Arias-Castro et al., 2011; Jin & Ke, 2016), which is often used in theoretical analysis of sparse linear models.
Let p be the asymptotic parameter.
Given constants ϑ ∈ (0 , 1) and r > 0 , we assume that β j ’s are iid generated such that β j = (cid:26)
τ p , with probability (cid:15) p , 0 , with probability 1 − (cid:15) p , where (cid:15) p
[Equation]
As p → ∞ , (cid:107) β (cid:107)
≈ p 1 − ϑ , and a nonzero β j is at the critical order (cid:112) log( p ) .
The two parameters ( ϑ, r ) capture the sparsity level and signal strength, respectively.
We may generalize (3) to let nonzero β j ’s take different values in [ τ p , ∞ ) , but the current form is more convenient for presentation.
The blockwise covariance structure is frequently observed in real applications.
In genetic data, there may exist strong correlations between nearby genetic markers, but the long-range dependence is usually negligible; as a result, the sample covariance matrix is approximately blockwise diagonal (Dehman et al., 2015).
In ﬁnancial data, the sample covariance matrix of stock returns (after common factors are removed) is also approximately blockwise diagonal, where each block corresponds to an industry group (Fan et al., 2015).
Motivated by these examples, we consider an idealized setting, where the Gram matrix G = X (cid:48)
X is block-wise diagonal consisting of 2 × 2 blocks:
G = diag( B, B, . . .
, B, B 0 ) , where B =
(cid:20)ρ ρ (cid:21) and B 0 = (cid:26) B, if p is even , 1 , if p is odd .
This is an idealization of the blockwise covariance structures in real applications.
We may generalize (4) to allow unequal block sizes and unequal off-diagonal entries, but we keep the current form for convenience of presentation.
Model (4) is also closely connected to the random designs in compressed sensing (Donoho, 2006).
Write X
=
[ X 1 , X 2 , . . .
, X n ] (cid:48) .
Suppose X 1 , X 2 , . . .
X n are iid generated from N (cid:0) 0 , n − 1 Σ) , where Σ has the same form as G in (4).
In a high-dimensional sparse setting, we have (cid:107) β (cid:107) 0 (cid:28) n (cid:28) p .
Then, G = X (cid:48)
X ≈ Σ , and due to the blessing of sparsity of β , Gβ ≈ Σ β .
As a result, X (cid:48)
y (sufﬁcient statistic of β ) satisﬁes that X (cid:48)
y =
Gβ + N (0 , G ) ≈
Σ β + N (0 , Σ) , and the right hand side reduces to Model (4) (Genovese et al., 2012).
In Section 3.5, we formally show that this random design setting is asymptotically equivalent to Model (4).
Now, under model (3) and model (4), we have three parameters ( ϑ, r, ρ ) .
They capture the sparsity level, signal strength and design correlations, respectively.
Our main results are the explicit convergence rates of Hamming error, as a function of ( ϑ, r, ρ ) , for different methods.
We will study six methods: (i) Lasso as in (2); (ii) Elastic net (Zou & Hastie, 2005), which adds an additional L 2penalty to (2), (iii) smoothly clipped absolute deviation (SCAD) (Fan & Li, 2001), which replaces the
L 1 -penalty by a non-convex penalty, (iv) thresholded Lasso (Zhou, 2009), which further thresholds the Lasso solution, and two iterative algorithms, (v) forward selection and (vi) forward backward selection (Huang et al., 2016); see Section 3 for a precise description of each method.
To our best knowledge, our results are the ﬁrst that directly compare Hamming errors of these methods.
A PREVIEW OF MAIN RESULTS AND SOME
DISCUSSIONS
For any ˆ β , its Hamming error is H (ˆ β, β )
=
(cid:80) pj =1 1 { ˆ β j (cid:54)
= 0 , β j = 0 } + (cid:80) pj =1 1 { ˆ β j = 0 , β j (cid:54) = 0 } .
As we shall show, for any of the six methods studied here, there exists a function h ( ϑ, r, ρ ) ∈ [0 , 1] such that E
[ H (ˆ β, β )]
=
L p p 1 − h ( ϑ,r,ρ ) , where L p is a multi- log( p ) term.
(A multi- log( p ) term is such that L p · p (cid:15) → ∞ and L p · p − (cid:15) → 0 for any (cid:15) > 0 .)
Since the expected number of true relevant variables is p 1 − ϑ , we are interested in three cases:
• Exact recovery: h ( ϑ, r, ρ ) > 1 .
In this case, the expected Hamming error is o (1) as p → ∞ .
It follows that model selection consistency holds.
• Almost full recovery: ϑ < h ( ϑ, r, ρ ) < 1 .
In this case, the expected Hamming error does not vanish as p → ∞ , but it is much smaller than the total number of true relevant variables.
Variable selection is still satisfactory (although model selection consistency no longer holds).
• No recovery: h ( ϑ, r, ρ ) ≤ ϑ .
In this case, the expected Hamming error is comparable with or much larger than the total number of true relevant variables.
Variable selection fails.
[Figure] We call the two-dimensional space ( ϑ, r ) the phase space .
For each ﬁxed ρ , the phase space is divided into three regions: Region of Exact Recovery (ER) , which is the subset { ( ϑ, r ) : h ( ϑ, r, ρ ) > 1 } , and
Region of Almost Full Recovery (AFR) and Region of No Recovery (NR) deﬁned similarly.
This gives rise to a phase diagram for each method.
We denote the curve separating ER region and AFR region by r =
U ( ϑ ) and the curve separating AFR region and NR region by r = L ( ϑ ) ; they are called the upper and lower phase curves , respectively.
The phase diagram and phase curves are convenient ways to visualize the convergence rates of the Hamming error.
Figure 1 shows the phase curves for the six methods (with explicit expressions in the theorems in
Section 3).
These phase curves depend on the correlation parameter ρ .
Under our model, for each diagonal block ( j, j + 1) , it holds that E [ x (cid:48)
j y | β ] =
β j + ρβ j +1 , where β j , β j +1 ∈ { 0 , τ p } .
Therefore, a positive ρ boosts the signal at each individual site (i.e., E [ x (cid:48)
j y | β ] ≥ β j ), while a negative ρ leads to potential ‘signal cancellation’ (i.e., E [ x (cid:48)
j y | β ] ≤ β j ).
This is why the phase curves have different shapes for positive and negative ρ .
In Figure 1, we plot the phase curves for ρ = 0 .
5 and ρ = − 0 .
For other positive/negative value of ρ , the patterns are similar.
Discussion of SCAD .
SCAD is a representative of non-convex penalization methods.
There have been inspiring works that demonstrate the advantages of using a non-convex penalty (e.g., Fan & Peng (2004); Loh & Wainwright (2017)).
Our results support their insights from a different angle: The phase curve of SCAD is strictly better than that of Lasso, when ϑ < 0 .
5 and ρ < 0 .
Furthermore, our results illustrate where the advantage of SCAD comes from — compared with Lasso, it handles ‘signal cancellation’ better.
To see this, we recall that ‘signal cancellation’ only happens for ρ < 0 .
Moreover, under our model (3), the expected number of signal pairs (a signal pair is a diagonal block { j, j + 1 } where both β j and β j +1 are nonzero) is (cid:16) p(cid:15) 2 p = p 1 − 2 ϑ .
Therefore, ‘signal cancellation’ becomes problematic only when ϑ < 0 .
5 and ρ < 0 both hold.
This explains why the phase curves of SCAD and Lasso are the same for the other values of ϑ and ρ .
We note that in the previous studies (e.g., Loh & Wainwright (2017)), the advantages of a non-convex penalty in handling ‘signal cancellation’ are reﬂected in the weaker conditions of ( X, β ) for achieving model selection consistency.
Our results support the advantage of using a non-convex penalty by directly studying the Hamming errors and phase diagrams.
The performance of SCAD can be further improved by adding an entry-wise thresholding on ˆ β .
We believe that the phase diagrams of thresholded SCAD are better than those of SCAD itself, although the extremely tedious analysis impedes us from speciﬁc results for now.
Also, we are cautious about what to conclude from comparing SCAD and thresholded Lasso.
In our settings, Lasso has no model selection consistency mainly because the signals are too weak (i.e., r is not sufﬁciently large).
In such settings, thresholded Lasso outperforms SCAD in terms of the Hamming error.
However, there are cases where Lasso has no model selection consistency no matter how large the signal strength is (Zhao & Yu, 2006).
For those cases, it is possible that SCAD is better than thresholded Lasso (see
Wainwright (2009) for a related study).
Discussion of Elastic net .
The phase curve of Elastic net is worse than that of Lasso.
As we will explain in Section 3.1, Elastic net is a ‘bridge’ between Lasso and marginal regression in our case.
Since the phase curve of marginal regression is always worse than that of Lasso for the blockwise diagonal design, we do not beneﬁt from using Elastic net in the current setting.
We must note that
Elastic net is motivated by genetic applications where several correlated variables are competing as predictors, and where it is implicitly assumed that groups of correlated variables tend to be all relevant or all irrelevant (Zou & Hastie, 2005).
This is not captured by our model (3).
Therefore, our results do not go against the beneﬁts of Elastic net known in the literature, but rather our results support that the advantages of Elastic net come from ‘group’ appearance of signal variables.
Discussion of thresholded Lasso .
Thresholded Lasso is a representative of improving Lasso by post-processing.
There have been inspiring works that demonstrate the advantages of such a postprocessing (van de Geer et al., 2011; Wang et al., 2020; Weinstein et al., 2020).
Our results support these insights from a different angle.
It is surprising (and very encouraging) that the improvement by post-Lasso thresholding is so signiﬁcant.
We note that Lasso is a 1-stage method, which solves a single optimization to obtain ˆ β .
By comparison, thresholded Lasso is a 2-stage method.
Lasso has only one algorithm parameter λ , while thresholded Lasso has two algorithm parameters λ and t (the threshold).
In Lasso, we control false positives and false negatives with the same algorithm parameter λ , and it is sometimes hard to ﬁnd a value of λ that simultaneously controls the two types of errors well.
In thresholded Lasso, the two types of errors can be controlled separately by two algorithm parameters.
This explains why thresholded Lasso enjoys such a big improvement upon
Lasso.
It inspires us to modify other 1-stage methods, such as SCAD, by adding a post-processing step of thresholding.
For example, we conjecture that thresholded SCAD also has a strictly better phase diagram than that of Lasso, even for a positive ρ .
On the other hand, thresholding is no free lunch.
It leaves one more tuning parameter to be decided in practice.
Our theoretical results are based on ideal tuning parameters.
How to properly choose these tuning parameters in a data-driven way is an interesting question.
Weinstein et al.
(2020) proposes a promising approach, where they use cross-validation to select λ and FDR control by knockoff to select t .
We leave it for future work to study the phase diagrams with data-driven tuning parameters.
Discussion of the two iterative algorithms .
We consider two iterative algorithms, forward selection (‘Forward’) and forward backward selection (‘FB’).
The FB algorithm we analyze is a simpliﬁed version in Huang et al.
(2016), which has only one backward step (after all the forward steps have ﬁnished) by thresholding the reﬁtted least-squares solution.
Our results show that both methods outperform Lasso, and between these two methods, FB is strictly better than Forward.
In the literature, there are very interesting theoretical works showing the advantages of iterative algorithms for variable selection (Donoho et al., 2012; Zhang, 2011).
Our results support their insights from a different angle.
We discover that, for a wide range of ρ , FB has the best phase diagram among all the six methods.
This is a very encouraging result.
Of course, it is as important to note that the performance of an iterative algorithm tends to be more sensitive to the form of the design, due to its sequential nature.
M AIN R ESULTS
Consider model (1), (3), and (4), where we set σ 2 = 1 without loss of generality.
Let E [ H (ˆ β, β )] be the expected Hamming error, where the expectation is with respect to the randomness of β and z .
Let
L p denote a generic multi- log( p ) term such that L p p (cid:15) → ∞ and L p p − (cid:15) → 0 for any (cid:15) > 0 .
Theorem 1.
Under Models (1) , (3) , and (4) , for each of the methods considered in this paper (Lasso, Elastic net, SCAD, thresholded Lasso, forward selection, forward backward selection, as well as marginal regression in Section 3.1), there exists a function h ( ϑ, r, ρ )
such that E
[ H (ˆ β, β )] =
L p p 1 − h ( ϑ,r,ρ ) .
The explicit expressions of h ( ϑ, r, ρ ) , which may depend on the tuning parameters of a method, are given in Theorems B.1, C.1, D.1-D.3, F.1, G.1, H.1-H.4 of the supplement.
In the main article, to save space, we only present the expressions of the upper phase curve U ( ϑ ) =
U ( ϑ ; ρ ) and the lower phase curve L ( ϑ ) =
L ( ϑ ; ρ ) for each method, which are deﬁned as follows:
[Equation]
1.0        r = 0.
( Marg .
Reg .)
=
=0.5 =
( Lasso ) 0.
1.0      = 0.
( Marg .
Reg .)
=
=0.5 =
( Lasso ) 0.
1.0        = 0.
( Marg .
Reg .)
=
=0.5 =
( Lasso )
3. E LASTIC NET AND L ASSO
The Elastic net (Zou & Hastie, 2005) is a method that estimates β by
[Equation]
Compared with Lasso, it adds an additional L 2 -penalty to the objective function.
Below, we ﬁx µ >and re-parametrize λ = (cid:112) 2 q log( p ) , for some constant q > 0 .
The choice of q affects the exponent, 1 − h ( ϑ, r, ρ ) , in the expression of E [ H (ˆ β, β )] .
We choose the ideal q that minimizes 1 − h
( ϑ, r, ρ ) .
The next theorem is proved in the supplement.
Theorem 2 (Elastic Net) .
Under Models (1) , (3) , and (4) , let ˆ β EN be the Elastic net estimator in (6) .
Fix µ and write η = ρ/ (1 + µ ) .
Let λ =
(cid:112) 2 q log( p ) with an ideal choice of q that minimizes the exponent of E
[ H (ˆ β, β )] .
The phase curves are given by L ( ϑ )
= ϑ , and
U ( ϑ ) =
[Equation]
[Equation]
, when ρ ≥ 0 , max { h
[Equation]
, h
[Equation]
[Equation]
[Equation]
[-ρη 
 −|-], when ρ < 0 , where h 1 ( ϑ ) = (1 + √ 1 − ϑ ) 2 , h 2 ( ϑ ) = {+(cid:0) 1 −| η | 1 −| ρ | + √ 1+ η 2 − 2 ρη 
+}
−| ρ | (cid:1) 2 (1 − ϑ ) , h 3 ( ϑ ) = 1 (1 −| ρ | ) 2 (cid:0) 1 + √ 1+ η 2 − 2 ρη 1+ | η | √ 1 − 2 ϑ (cid:1) 2 , and h 4 ( ϑ ) =
[Equation]
Lasso is a special case with µ = 0 .
By setting µ = 0 (equivalently, η = ρ ) in Theorem 2, we obtain the phase curves for Lasso.
They agree with the results in Ji & Jin (2012) (but Ji & Jin (2012) does not cover Elastic net).
To see the effect of the L 2 -penalty, we consider an extreme case where µ → ∞ .
Some elementary algebra shows that (1 + µ )ˆ β EN converges to the soft-thresholding of X (cid:48)
y at the threshold λ .
In other words, as µ → ∞ , Elastic net converges to marginal screening (i.e., select variables by thresholding the marginal regression coefﬁcients).
At the same time, when µ = 0 , (1 + µ )ˆ β EN equals the Lasso estimate.
Hence, Elastic net serves as a bridge between Lasso and marginal regression.
In the setting here, the phase diagram of marginal regression is inferior to that of Lasso, and so the phase diagram of Elastic net is also inferior to that of Lasso.
See the proposition below and Figure 2:
Proposition 1.
In Theorem 2, for each ﬁxed ϑ ∈ (0 , 1) , as µ → 0 , U ( ϑ ) is monotone decreasing and converges to U Lasso ( ϑ ) , which is the upper phase curve of Lasso; as µ → ∞ , U ( ϑ ) is monotone increasing and converges to U MR ( ϑ ) , which is the upper phase curve of marginal regression.
Furthermore, when ρ ≤ − 1 2 , U MR ( θ ) = ∞ for all 0 < ϑ ≤ 1 2 (i.e. exact recovery is impossible to achieve no matter how large r is).
3. S MOOTHLY CLIPPED ABSOLUTE DEVIATION PENALTY (SCAD)
SCAD (Fan & Li, 2001) is a non-convex penalization method.
For any a > 2 , it deﬁnes a penalty function q λ ( θ ) on (0 , ∞ ) by q λ ( θ ) =
(cid:82) θ 0 q (cid:48) λ
( t ) dt , where q (cid:48) λ
( θ ) =
λ (cid:8) I ( θ ≤ λ )
+ ( aλ − θ ) + ( a − 1)
λ
I ( θ > λ ) (cid:9) .
1.0     r = 0.
( 1 | | 1+| | 1 2 1 | | + 1+| | 1 | | 11| | ) 2 ( 5+3| | 1 | | ) (1 ) h 6 ( )
Same as Lasso Same as Lasso 0.
1.026101418 = 0.
SCAD Lasso 0.
1.0         = 0.
SCAD Lasso
The resulting penalty function q λ ( · ) coincides with the L 1 -penalty in (0 , λ ] and becomes a constant in [ aλ, ∞ ) .
Let Q λ ( β )
=
(cid:80) pj =1 q λ ( | β j | ) .
Then, SCAD estimates β by
[Equation] The following theorem is proved in the supplemental material (see Figure 3, left panel):
Theorem 3 (SCAD) .
Under Models (1) , (3) , and (4) , let ˆ β SCAD be the SCAD estimator in (7) .
Fix a ∈ (2 , 2 1 −| ρ | ) .
Let λ =
(cid:112) 2 q log( p ) with an ideal choice of q that minimizes the rates of convergence of the expected Hamming error.
The phase curves are given by L ( ϑ )
= ϑ , and
[Equation] , when ρ ≥ 0 , max { h 1 ( ϑ ) , h 2 ( ϑ ) , h 4 ( ϑ ) , h 5 ( ϑ ) } , when ρ < 0 , where h 1 ( ϑ ) = (1 + √ 1 − ϑ ) 2 , and h 2 ( ϑ )
=
(cid:0) 1 + (cid:113) 1+ | ρ | 1 −| ρ | (cid:1) 2 (1 − ϑ ) , h 4 ( ϑ ) =
(cid:0)(cid:113) 1 − 2 ϑ 1 −| ρ | 2 + 1 1 −| ρ | (cid:1) 2 , h 3 ( ϑ ) = (cid:0) 3+ ρ 2(1 − ρ 2 ) (cid:113) 1+ ρ 1 − ρ √ 1 − ϑ + 12 (cid:113) 2(1 − 2 ϑ ) 1+ ρ − (1 − ϑ ) (1 − ρ ) 2 (cid:1) 2 , and h 5 ( ϑ ) =
  (cid:0) 5+3 | ρ | 1 −| ρ | (cid:1) (1 − ϑ ) , if (cid:113) 1 − 2 ϑ 1 − ϑ ≥ 3 − 4 | ρ |− 3 ρ 2 (1 −| ρ | ) (cid:113) 1+ | ρ | 5+3 | ρ | , 1 (1 −| ρ | ) 2 (cid:0)(cid:113) 1+ | ρ | 1 −| ρ | √ 1 − ϑ + (cid:113) 1 −| ρ | 1+ | ρ | √ 1 − 2 ϑ (cid:1) 2 , if (cid:113) 1 − 2 ϑ 1 − ϑ ≤ (1+ | ρ | )(1 − 2 | ρ | ) 1 −| ρ | , h 6 ( ϑ ) other wise , with h 6 ( ϑ ) =   (cid:115) 1 − 2 ϑ 1 − ρ 2 + 1 − 2 | ρ | 1 −| ρ | (cid:113) 1 − 2 ϑ 1 − ρ 2 + (cid:113)(cid:2)(cid:0) 1 − 2 | ρ | 1 −| ρ | (cid:1) 2 + 1 −| ρ | 1+ | ρ
[Equation]
 
[Equation]
Note that the phase curves of Lasso are given in Theorem 2 by setting η = ρ .
We compare SCAD with Lasso.
When ρ < 0 , the upper phase curve in Theorem 3 is strictly lower than that of Lasso (see
Figure 3, middle and right panels).
When ρ ≥ 0 , the upper phase curve in Theorem 3 is sometimes higher than that of Lasso.
Note that we restrict a < 2 1 −| ρ | in Theorem 3.
In fact, a larger a may be preferred for ρ ≥ 0 .
The next proposition is about using an optimal a .
Proposition 2.
In the SCAD estimator, we choose a = a ∗ and λ = (cid:112) 2 q ∗ log( p ) such that ( a ∗ , q ∗ ) =
( a ∗ ( ϑ, r, ρ ) , q ∗ ( ϑ, r, ρ )) minimize the rates of convergence of the expected Hamming error among all choices of ( a, q ) .
Let U ∗ ( ϑ ) be the resulting upper phase curve for SCAD.
Then, U ( ϑ ) =
U Lasso ( ϑ ) when ρ ≥ 0 , and U ( ϑ ) <
U Lasso ( ϑ ) when ρ < 0 .
The phase curves of SCAD are insensitive to the choice of a .
When a < 0 , the optimal a ∗ can be any value in (2 , 2 1 −| ρ | ) .
When ρ ≥ 0 , there exists a constant c = c ( ϑ, ρ ) such that the optimal a ∗ is any value in ( c, ∞ ) .
As a → ∞ , the SCAD penalty reduces to the L 1 -penalty.
This explains why the phase curve of SCAD is the same as that of Lasso when ρ ≥ 0 .
1.0    r = 0.
Thresholded Lasso Lasso (1+ 1 ) 2 4(1 )/(1 2 ) ( 1+ 1+1 ) 2 (1 ) 0.
1.0    = 0.
(1+ 1 ) 2 4(1 )/(1 2 ) ( 1+ 1+| | 2 11 2 + 1 | | 2 1 2 1 2 )( 1 | | 1+| | 1 2 1 | |
+ 1+| | 1 | | 11| | )0.
1.0    = 0.
(1+ 1 ) 2 4(1 )/(1 2 ) ( 1+ 1+| | 2 11 2 + 1 | | 2 1 2 1 2 )
3. T HRESHOLDED L ASSO
Let ˆ β Lasso be the Lasso estimator in (2).
The thresholded Lasso estimator ˆ β TL is obtained by applying coordinate-wise hard-thresholding to the Lasso estimator:
[Equation]
Theorem 4 (Thresholded Lasso) .
Under Models (1) , (3) , and (4) , let ˆ β
TL be the thresholded Lasso estimator in (8) .
Let λ =
(cid:112) 2 q log( p ) and t = (cid:112) 2 w log( p ) with the ideal ( q, w ) that minimize the exponent of the expected Hamming error.
The phase curves are given by L ( ϑ )
= ϑ , and
U ( ϑ ) = (cid:26) max { h 1 ( ϑ ) , h 2 ( ϑ ) } , when ρ ≥ 0 , max { h 1 ( ϑ ) , h 2 ( ϑ ) , h 3 ( ϑ ) } , when ρ < 0 , where h 1 ( ϑ ) =
(1+ √ 1 − ϑ ) 2 , h 2 ( ϑ ) =
4(1 − ϑ ) 1 − ρ 2 , and h 3 ( ϑ ) = (cid:0) 1+ 1+ | ρ | 2 (cid:113) 1 − ϑ 1 − ρ 2 + 1 −| ρ | 2 (cid:113) 1 − 2 ϑ 1 − ρ 2 (cid:1) 2 .
See Figure 4 for a comparison with Lasso (a special case of t = 0 ).
With the ﬂexibility of using an optimal t , the phase diagram of thresholded Lasso is always better than that of Lasso.
Theorem 4 also gives other interesting facts about thresholded Lasso.
First, the shape of phase curves is much less affected by the sign of ρ .
This differs from Lasso, Elastic net, and SCAD, for which the shape of phase curves is signiﬁcantly different for positive and negative ρ .
Second, the optimal λ in thresholded Lasso is considerably smaller than the optimal λ in Lasso (it can be seen from the proofs of Theorem 4 and Theorem 2).
This is because the λ in thresholded Lasso only serves to control false negatives, but the λ in Lasso is used to simultaneously control false positives and false negatives, hence, cannot be too small.
We observe the same phenomenon in simulations; see Section 4.
3. F ORWARD SELECTION AND FORWARD BACKWARD SELECTION
Forward selection is a classical textbook method for variable selection.
Write X
=
[ x 1 , x 2 , . . .
, x p ] , where x i ∈ R n for 1 ≤ i ≤ p .
For any subset A ⊂ { 1 , 2 , . . .
, p } , let P ⊥ A be the projection onto the orthogonal complement of the linear space spanned by { x i : i ∈ A } .
Given a threshold t > 0 , the forward selection algorithm initializes with S 0 = ∅ and ˆ r 0 = y .
At the k th iteration, compute
[Equation]
If δ > t , compute S k
= S k − 1 ∪ { i ∗ } and ˆ r k = P
⊥ S k y ; otherwise, output ˆ β forward as the least-squares estimator restricted to S k − 1 .
The stopping rule of δ ≤ t is equivalent to measuring the decrease of the residual sum of squares.
The following theorem is proved in the supplemental material:
Theorem 5 (Forward Selection) .
Under Models (1) , (3) , and (4) , let ˆ β forward be the estimator from forward selection.
Let t = (cid:112) 2 q log( p ) with the ideal q that minimizes the exponent of the expected
Hamming error.
The phase curves are given by L ( ϑ )
= ϑ , and
[Equation] [Equation]
(cid:26) max { h 1 ( ϑ ) , h 2 ( ϑ ) , h 3 ( ϑ ) } , when ρ ≥ 0 , max { h 1 ( ϑ ) , h 2 ( ϑ ) , h 3 ( ϑ ) , h 4 ( ϑ ) } , when ρ < 0 , with h 1 ( ϑ ) = (1+ √ 1 − ϑ ) 2 , h 2 ( ϑ ) =
2(1 − ϑ ) 1 −| ρ | , h 3 ( ϑ ) =
(1+ √ 1 − 2 ϑ ) 2 1 − ρ, h 4 ( ϑ ) =
(cid:0)(cid:113) 1 − 2 ϑ 2(1 −| ρ | ) + 1 1 −| ρ | (cid:1) 2 .
1.0    r =0.7 Forward selection
Forward backward selection (1+ 1 ) 2 2(1 )/(1 )
(1+ 1 2 ) 2 /(1 2 ) ( 1 + 1 2 ) 2 /(1 2 ) 0.
1.0    = 0.
Forward selection
[Figure]
backward selection 0.
1.026101418 = 0.
[Figure]
Forward backward selection (FB) modiﬁes forward selection by allowing to drop variables.
We use the FB algorithm in Huang et al.
(2016), where the backward step is conducted after all the forward steps are ﬁnished.
For a threshold v > 0 , it applies entry-wise thresholding on ˆ β forward : ˆ β FB
[Equation]
Theorem 6 (Forward Backward Selection) .
Under Models (1) , (3) , and (4) , let ˆ β FB be the estimator from forward selection.
Let t = (cid:112) 2 q log( p ) and v = (cid:112) 2 u log( p ) with the ideal ( q, u ) that minimize the exponent of the expected Hamming error.
When ρ ≥ 0 , the phase curves are given by L ( ϑ )
= ϑ , and
[Equation]
where h 1 ( ϑ ) and h 2 ( ϑ ) are the same as in Theorem 5 and h ∗ 3 ( ϑ )
= ( √ 1 − ϑ + √ 1 − 2 ϑ ) 2 1 − ρ.
When ρ < 0 ,
U ( ϑ ) ≤ max { g 1 ( ϑ ) , g 2 ( ϑ ) , g 3 ( ϑ ) , g 4 ( ϑ ) } , where g 1 ( ϑ ) =
( v min ( ϑ ) + √ 1 − ϑ ) 2 , g 2 ( ϑ ) =
2(1 − ϑ ) 1 −| ρ | , g 3 ( ϑ ) =
(cid:0)(cid:113) 1 − 2 ϑ 1 − ρ 2 + v min ( ϑ ) (cid:1) 2 , g 4 ( ϑ ) =
(cid:0)(cid:113) 1 − 2 ϑ 2(1 −| ρ | ) + t min ( ϑ ) 1 −| ρ | (cid:1) 2 , v min ( ϑ ) = max (cid:8) 1 , (cid:113) 1 − ϑ 1 − ρ 2 (cid:9) , and t min ( ϑ ) = max (cid:8) √ 22 , v min ( ϑ ) 1+ | ρ | / √ 1 − ρ 2 (cid:9) .
Theorem 6 gives U ( ϑ ) for ρ ≥ 0 and an upper bound of it for ρ < 0 .
Combining it with Theoremsand 5, we conclude that the upper phase curve of FB is always better than those of Lasso and forward selection (for ρ < 0 , the upper bound here is already better than U ( ϑ ) for the other two methods).
We remark that we did obtain the exact phase curve for ρ < 0 in the proof of Theorem 6.
It is just too complicated and space-consuming to present it in the main text.
However, given speciﬁc values of ( ϑ, ρ ) , we can always plot the exact phase curve using the (complicated) formulas in the supplement.
In Figures 1 and 5, the phase curves of FB are indeed the exact ones.
3. C ONNECTION TO THE RANDOM DESIGN MODEL
Consider the random design as mentioned in Section 1.
The minimax Hamming error is H ∗ ( ϑ, r, ρ )
=
inf ˆ β E
[ H (ˆ β, β )] , where the inﬁmum is taken over all methods ˆ β and the expectation is with respect to the randomness of ( X, β, z ) .
We can deﬁne H ∗ ( ϑ, r, ρ ) in the same way for our current model (4).
The minimax Hamming error is related to the statistical limit of the model setting, but not any speciﬁc method.
The next theorem shows that, when n (cid:29) s p = p 1 − ϑ (we allow both p ≤ n and p > n ), the convergence rate of the minimax Hamming error is the same under two models.
Theorem 7.
Under Models (1) and (3) , suppose X is independent of ( β, z ) and its rows are iid generated from N (0 , n − 1 Σ) , with Σ having the same form as G in (4) .
Suppose n = p ω , with ω > 1 − ϑ
(note: this allows ω < 1 , which corresponds to n (cid:28) p ).
There exists a number h
∗∗ ( ϑ, r, ρ ) such that the minimax Hamming error satisﬁes that H ∗ ( ϑ, r, ρ ) =
L p p 1 − h ∗∗ ( ϑ,r,ρ ) .
Furthermore, if we instead have X (cid:48) X = Σ (i.e., model (4) ), then it also holds that H ∗ ( ϑ, r, ρ ) =
L p p 1 − h ∗∗ ( ϑ,r,ρ ) .
S IMULATIONS
In Experiments 1-3, ( n, p ) =
In Experiment 4, ( n, p ) =
Experiment 1 (block-wise diagonal designs).
We generate ( X, β ) as in (3)-(4).
For each method, we select the ideal tuning parameters that minimize the average Hamming error over 50 repetitions.
The averaged Hamming errors and its standard deviations under the ideal tuning parameters overrepetitions are reported below.
The results are consistent with the theoretical phase diagrams (see
Figure 1).
E.g., thresholded Lasso and forward backward selection are the two methods that perform the best; Lasso is more unsatisfactory when ρ < 0 ; SCAD improves Lasso when ρ < 0 .
[Table]
Experiment 2 (general designs).
In the Toeplitz design, we let ( X (cid:48)
X )
i,j = 0 .
7 | i − j | and set ( ϑ, r ) =
In the factor model design, we let X (cid:48)
X = BB (cid:48)
− diag ( BB (cid:48) )
+ I p , where entries of B ∈ R p × 2 are iid from Unif(0 , 0 . 6) , and set ( ϑ, r ) =
Same as in Experiment 1, we use the ideal tuning parameters.
The averaged Hamming errors and its standard deviations are reported below.
The Toeplitz design is a setting where each variable is only highly correlated with a few other variables.
The factor model design is a setting where a variable is (weakly) correlated with all the other variables.
The results are quite similar to those in Experiment 1.
This conﬁrms that the insight gained in the study of the block-wise diagonal design continues to apply to more general designs.
[Table]
Experiment 3 (tuning parameters).
Fix ( ϑ, r ) =
(0 . 1 , 1 . 5) and ρ ∈ {± 0 .
5 } in the block-wise diagonal design.
We study the effect of tuning parameters in Lasso, thresholded Lasso (ThreshLasso), forward selection (ForwardSelect), and forward backward selection (FB).
In (a)-(b), we show the heatmap of averaged Hamming error (over 50 repetitions) of ThreshLasso for a grid of ( t, λ ) ; when t = 0 , it reduces to Lasso.
In (c)-(d), we show the Hamming error of FB for a grid of ( v, t ) ; when v = 0 , it reduces to ForwardSelect.
Cyan points are theoretically optimal tuning parameters (formulas are in proofs of theorems).
Red points are empirically optimal tuning parameters that minimize the averaged Hamming error.
The theoretical tuning parameter values are quite close to the empirically optimal ones.
Moreover, the optimal λ in ThreshLasso is smaller than the optimal λ in Lasso
[Figure]
Experiment 4 ( p > n and random designs).
Fix ( n, p, ϑ, r ) =
We simulate data from the random design setting in Theorem 7.
We study the average Hamming error overrepetitions (tuning parameters are set in the same way as in Experiment 1).
See Table 3.
We have some similar observations as before: e.g., ThreshLasso and FoBackward are still the best two,