Comments on `High-dimensional simultaneous inference with the bootstrap'
Richard A. Lockhart, Richard J. Samworth

TL;DR
This paper offers critical comments on a previous work about high-dimensional inference using bootstrap methods, discussing its strengths and limitations.
Contribution
It provides insights and potential improvements to the methodology proposed in the original high-dimensional bootstrap inference paper.
Findings
Highlights the robustness of bootstrap methods in high dimensions
Identifies limitations in the original approach
Suggests possible extensions for better accuracy
Abstract
We provide some comments on the article `High-dimensional simultaneous inference with the bootstrap' by Ruben Dezeure, Peter Buhlmann and Cun-Hui Zhang.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Comments on: High-dimensional simultaneous inference with the bootstrap
Richard A. Lockhart and Richard J. Samworth
Simon Fraser University and University of Cambridge
[email protected], [email protected]
1 Introduction
We congratulate the authors on their stimulating contribution to the burgeoning high-dimensional inference literature. The bootstrap offers such an attractive methodology in these settings, but it is well-known that its naive application in the context of shrinkage/superefficiency is fraught with danger (e.g. Samworth, 2003; Chatterjee and Lahiri, 2011). The authors show how these perils can be elegantly sidestepped by working with de-biased, or de-sparsified, versions of estimators.
In this discussion, we consider alternative approaches to individual and simultaneous inference in high-dimensional linear models, and retain the notation of the paper.
2 Why penalise coefficients of variables of interest?
Suppose that for some, presumably small, set , we want a confidence set for . Much of the recent literature, including the paper under discussion, proceeds by constructing an initial estimator, such as the Lasso estimator , and then attempting to de-bias it. Our starting point is the following provocative question: since we know in advance the set of variables we are interested in, why would we want to penalise these coefficients in the first place? Of course, it is standard practice not to penalise the intercept term in high-dimensional linear models, to preserve location equivariance, but we now consider taking this one stage further. More precisely, consider the linear model
[TABLE]
where the columns of have Euclidean length , where is positive definite, and where, for simplicity, we assume that . We further assume that the set of signal variables has cardinality , and let . For , let
[TABLE]
where we emphasise that is unpenalised. For fixed , the solution in the first argument is given by ordinary least squares:
[TABLE]
We therefore find that
[TABLE]
where denotes the matrix representing an orthogonal projection onto the column space of . In other words, is simply the Lasso solution with response and design matrix pre-multiplied by . Moreover,
[TABLE]
For our theoretical analysis of , we will require the following compatibility condition:
(A1)
There exists such that for all with , we have
[TABLE]
The theorem below is only a small modification of existing results in the literature (e.g. Bickel, Ritov and Tsybakov, 2009), but for completeness we provide a proof in the Appendix.
Theorem 1**.**
Assume (A1), and let . Then with probability at least ,
[TABLE]
Theorem 1 allows us to show that if, in addition to (A1), the columns of and those of satisfy a strong lack of correlation condition, then can be used for asymptotically valid inference for . To formalise this latter condition, it is convenient to let denote the matrix .
Corollary 2**.**
Consider an asymptotic framework in which and as , but and are constant. Assume (A1) holds for sufficiently large (with not depending on ), and also that . If we choose in the above procedure with constant , then
[TABLE]
Proof.
We can write
[TABLE]
where . Now
[TABLE]
Moreover, from the proof of Theorem 1, on \Omega_{0}:=\bigl{\{}\|\mathbf{X}_{-G}^{T}(I-P_{G})\epsilon\|_{\infty}/n\leq\lambda/2\},
[TABLE]
Since , the conclusion follows. ∎
We remark that for , is the coefficient in the ordinary least squares regression of on . Even though the condition on is strong, it may well be reasonable to suppose that, having pre-specified the index set of variables that we are interested in, we should avoid including in our model other variables that have significant correlation with .
3 More complicated settings
Without this strong orthogonality condition we might instead consider adjusting by debiasing or de-sparsifying . Following van de Geer et al. (2014) we suggest replacing by
[TABLE]
for some matrix . This yields the debiased estimator
[TABLE]
where is the matrix given by
[TABLE]
Under our Gaussian errors assumption, and are independent centred Gaussian random vectors; thus if the remainder term is of smaller order, we see that our estimate is approximately centred Gaussian. The techniques of van de Geer et al. (2014) or Javanmard and Montanari (2014) might then be used to give asymptotic justifications for Gaussian confidence sets and hypothesis tests concerning . But another very interesting direction would be to adapt the bootstrap approaches proposed in the current paper to the estimate .
As in van de Geer et al. (2014) we should choose depending on to control
[TABLE]
Note that we may write the matrix in terms of the sample covariance matrix of the covariates (using obvious notation for the partitioning) as
[TABLE]
Of course, if is invertible, then , so can be thought of as an approximation to (even though is not invertible when ). In general, we might use concentration inequalities for entries in to control ; if we think of as small, then we only have entries to control, rather than as is more typical in these debiasing problems. We hope to pursue these ideas elsewhere.
Acknowledgements
The first author thanks St John’s College, Cambridge for kind hospitality over the period where this research was carried out. The second author is support by an Engineering and Physical Sciences Research Council Fellowship and a grant from the Leverhulme Trust.
Appendix
Proof of Theorem 1.
The KKT conditions for the problem (2.1) state that
[TABLE]
where and if . Thus
[TABLE]
Let \Omega_{0}:=\bigl{\{}\|\mathbf{X}_{-G}^{T}(I-P_{G})\epsilon\|_{\infty}/n\leq\lambda/2\}. Then since , and since the diagonal entries of are bounded above by , we have . Moreover, on ,
[TABLE]
In particular, , so from (A1),
[TABLE]
Thus
[TABLE]
We conclude that
[TABLE]
as required. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Bickel, Ritov and Tsybakov (2009) Bickel, P. J., Ritov, Y. and Tsybakov, A. B. (2009) Simultaneous analysis of Lasso and Dantzig selector. Ann. Statist. , 37 , 1705–1732.
- 2Chatterjee and Lahiri (2011) Chatterjee, A. and Lahiri, S. N. (2011) Bootstrapping Lasso estimators. J. Amer. Statist. Assoc. , 106 , 608–625.
- 3Javanmard and Montanari (2014) Javanmard, A. and Montanari, A. (2014) Confidence Intervals and Hypothesis Testing for High-Dimensional Regression. J. Machine Learning Res. , 15 , 2869–2909.
- 4Samworth (2003) Samworth, R. (2003) A note on methods of restoring consistency to the bootstrap. Biometrika , 90 , 985–990.
- 5van de Geer et al. (2014) van de Geer, S., Bühlmann, P., Ritov, Y. and Dezeure, R. (2014) On asymptotically optimal confidence regions and tests for high-dimensional models. Ann. Statist. , 42 , 1166–1202.
