Weak convergence of the regularization path in penalized M-estimation
Jean-Fran\c{c}ois Germain (LTCI), Fran\c{c}ois Roueff (LTCI)

TL;DR
This paper establishes the weak convergence of the regularization path in penalized M-estimation, extending classical results like the CLT for the lasso to a functional setting, with broad applications.
Contribution
It provides general conditions for the weak convergence of the entire regularization path in penalized M-estimation, extending existing CLT results to a functional framework.
Findings
Weak convergence results for the regularization path.
Extension of CLT for lasso to a functional setting.
Applicability to various contrast processes.
Abstract
We consider an estimator defined as the element minimizing a contrast process for each t. We give some general results for deriving the weak convergence of in the space of bounded functions, where, for each t, is the minimizing the limit of as . These results are applied in the context of penalized M-estimation, that is, when , where is a usual contrast process and a penalty such as the norm or the squared norm. The function is then called a \emph{regularization path}. For instance we show that the central limit theorem established for the lasso estimator in Knight and Fu (2000) continues to hold in a functional sense for the regularization path.…
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.
Taxonomy
TopicsStatistical Methods and Inference · Sparse and Compressive Sensing Techniques · Numerical methods in inverse problems
