The DOI matches its Crossref record; 90 of the 90 references it cites were found in a registry or an index.
A Unified Framework for High-Dimensional Analysis of $M$-Estimators with Decomposable Regularizers
Open accessAbstract
High-dimensional statistical inference deals with models in which the the number of parameters $p$ is comparable to or larger than the sample size $n$. Since it is usually impossible to obtain consistent procedures unless $p/n\rightarrow0$, a line of recent work has studied models with various types of low-dimensional structure, including sparse vectors, sparse and structured matrices, low-rank matrices and combinations thereof. In such settings, a general approach to estimation is to solve a regularized optimization problem, which combines a loss function measuring how well the model fits the data with some regularization function that encourages the assumed structure. This paper provides a unified framework for establishing consistency and convergence rates for such regularized $M$-estimators under high-dimensional scaling. We state one main theorem and show how it can be used to re-derive some existing results, and also to obtain a number of new results on consistency and convergence rates, in both $\ell_{2}$-error and related norms. Our analysis also identifies two key properties of loss and regularization functions, referred to as restricted strong convexity and decomposability, that ensure corresponding regularized $M$-estimators have fast convergence rates and which are optimal in many well-studied cases.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Donoho, D. L. (2004) · Cited by 16,703
Model Selection and Estimation in Regression with Grouped Variables
Yuan, M., & Lin, Y. (2006) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00532.x · Cited by 7,261
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
Vandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., & Parrilo, P. A. (2010) · SIAM Review · doi:10.1137/070697835 · Cited by 3,471
Cited by
Optimization for Machine Learning
(2011) · The MIT Press eBooks · doi:10.7551/mitpress/8996.001.0001 · Cited by 875
Optimization with Sparsity-Inducing Penalties
Bach, F. (2011) · now publishers, Inc. eBooks · doi:10.1561/9781601985118 · Cited by 608
Candès, E. J., & Plan, Y. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2111771 · Cited by 569
Minimax Rates of Estimation for High-Dimensional Linear Regression Over $\ell_q$-Balls
Raskutti, G., Wainwright, M. J., & Yu, B. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2165799 · Cited by 455
Self-citationStructured Variable Selection with Sparsity-Inducing Norms
Jenatton, R., Audibert, J.-Y., & Bach, F. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0904.3523 · Cited by 431
Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
Negahban, S. N., & Wainwright, M. J. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1009.2118 · Cited by 402
Self-citationRestricted Eigenvalue Properties for Correlated Gaussian Designs
Raskutti, G., Wainwright, M. J., & Yu, B. (2010) · doi:10.5555/1756006.1859929 · Cited by 367
Self-citationTumor origin detection with tissue-specific miRNA and DNA methylation markers
Tang, W., Wan, S., Yang, Z., Teschendorff, A. E., & Zou, Q. (2018) · Bioinformatics · doi:10.1093/bioinformatics/btx622 · Cited by 347
Structured Sparsity through Convex Optimization
Bach, F., Jenatton, R., Mairal, J., & Obozinski, G. (2012) · Statistical Science · doi:10.1214/12-sts394 · Cited by 315
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
Agarwal, A., Negahban, S., & Wainwright, M. J. (2012) · The Annals of Statistics · doi:10.1214/12-aos1000 · Cited by 280
Self-citationDavenport, M. A., Plan, Y., van den Berg, E., & Wootters, M. (2014) · Information and Inference · doi:10.1093/imaiai/iau006 · Cited by 277
Learning with Submodular Functions: A Convex Optimization Perspective
Bach, F. (2013) · now publishers, Inc. eBooks · doi:10.1561/9781601987570 · Cited by 273
Online Decision Making with High-Dimensional Covariates
Bastani, H., & Bayati, M. (2020) · Operations Research · doi:10.1287/opre.2019.1902 · Cited by 263
Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
Oymak, S., Jalali, A., Fazel, M., Eldar, Y. C., & Hassibi, B. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2401574 · Cited by 252
Sparse Group Lasso: Consistency and Climate Applications
Chatterjee, S., Steinhaeuser, K., Banerjee, A., Chatterjee, S., & Ganguly, A. (2012) · Proceedings of the 2012 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972825.5 · Cited by 72
Metadata
- Authors
- Negahban, S. N., Ravikumar, P., Wainwright, M. J., & Yu, B.
- Venue
- Statistical Science
- Publisher
- Institute of Mathematical Statistics
- Published
- 2012-11-01
- Volume
- 27
- Issue
- 4
- Pages
- 538-557
- ISSN
- 0883-4237 (ISSN-L)
- OpenAlex
- W2151825876
- Cited by
- 287
- References
- 90
- FWCI
- 32.06
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.