Fetching the paper…
Reading the bibliography…
We obtain bounds on estimation error rates for regularization procedures of the form \begin{equation*} \hat f \in {\rm argmin}_{f\in F}\left(\frac{1}{N}\sum_{i=1}^N\left(Y_i-f(X_i)\right)^2+\lambda \Psi(f)\right) \end{equation*} when $\Psi$ is a norm and $F$ is convex.
Characterization of the subdifferential of some matrix norms
G. Alistair Watson · 1992
Earlier work this paper cites.
Regression shrinkage and selection via the lasso
Robert Tibshirani · 1996
Earlier work this paper cites.
The concentration of measure phenomenon
Michel Ledoux · 2001
Earlier work this paper cites.
High-dimensional graphs and variable selection with the lasso
Nicolai Meinshausen and Peter Bühlmann · 2006
Earlier work this paper cites.
On model selection consistency of Lasso
Peng Zhao and Bin Yu · 2006
Earlier work this paper cites.
The deterministic lasso
Sara A. van de Geer · 2007
Earlier work this paper cites.
Oracle inequalities in empirical risk minimization and sparse recovery problems
Vladimir Koltchinskii · 2008
Earlier work this paper cites.
Sup-norm convergence rate and sign concentration property of Lasso and Dantzig estimators
Karim Lounici · 2008
Earlier work this paper cites.
High-dimensional generalized linear models and the lasso
Sara A. van de Geer · 2008
Earlier work this paper cites.
Simultaneous analysis of lasso and Dantzig selector
Peter J. Bickel, Ya’acov Ritov, and Alexandre B. Tsybakov · 2009
Earlier work this paper cites.
Lasso-type recovery of sparse representations for high-dimensional data
Nicolai Meinshausen and Bin Yu · 2009
Earlier work this paper cites.
Structured sparsity-inducing norms through submodular functions
Francis R. Bach · 2010
Earlier work this paper cites.
Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
Benjamin Recht, Maryam Fazel, and Pablo A. Parrilo · 2010
Earlier work this paper cites.
Statistics for high-dimensional data
Peter Bühlmann and Sara van de Geer · 2011
Cited alongside, same era.
Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements
Emmanuel J. Candès and Yaniv Plan · 2011
Cited alongside, same era.
Recovering low-rank matrices from few coefficients in any basis
David Gross · 2011
Cited alongside, same era.
Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
Vladimir Koltchinskii, Karim Lounici, and Alexandre B. Tsybakov · 2011
Cited alongside, same era.
Estimation of high-dimensional low-rank matrices
Angelika Rohde and Alexandre B. Tsybakov · 2011
Cited alongside, same era.
Restricted strong convexity and weighted matrix completion: optimal bounds with noise
Sahand Negahban and Martin J. Wainwright · 2012
Small ball probabilities for linear images of high dimensional distributions
Mark Rudelson and Roman Vershynin · 2014
Later among the works it cites.
Upper and lower bounds for stochastic processes
Michel Talagrand · 2014
Later among the works it cites.
Weakly decomposable regularization penalties and structured sparsity
Sara van de Geer · 2014
Later among the works it cites.
On asymptotically optimal confidence regions and tests for high-dimensional models
Sara van de Geer, Peter Bühlmann, Ya’acov Ritov, and Ruben Dezeure · 2014
Later among the works it cites.
Confidence intervals for low dimensional parameters in high dimensional linear models
Cun-Hui Zhang and Stephanie S. Zhang · 2014
Later among the works it cites.
Asymptotic geometric analysis. Part I
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A unified framework for high-dimensional analysis of
Sahand N. Negahban, Pradeep Ravikumar, Martin J. Wainwright, and Bin Yu · 2012
Cited alongside, same era.
Learning subgaussian classes: Upper and minimax bounds
Guillaume Lecué and Shahar Mendelson · 2013
Cited alongside, same era.
Learning without concentration for general loss function
Shahar Mendelson · 2013
Cited alongside, same era.
Confidence sets in sparse regression
Richard Nickl and Sara van de Geer · 2013
Cited alongside, same era.
Sparse recovery under weak moment assumptions
Guillaume Lecué and Shahar Mendelson · 2014
Cited alongside, same era.
Learning without concentration
Shahar Mendelson · 2014
Cited alongside, same era.
Shiri Artstein-Avidan, Apostolos Giannopoulos, and Vitali D. Milman · 2015
Later among the works it cites.
SLOPE—Adaptive variable selection via convex optimization
Małgorzata Bogdan, Ewout van den Berg, Chiara Sabatti, Weijie Su, and Emmanuel J. Candès · 2015
Later among the works it cites.
Bounding the Smallest Singular Value of a Random Matrix Without Concentration
Vladimir Koltchinskii and Shahar Mendelson · 2015
Later among the works it cites.
Regularization and the small-ball method ii: complexity-based bounds
Guillaume Lecué and Shahar Mendelson · 2015
Later among the works it cites.
Learning without concentration
Shahar Mendelson · 2015
Later among the works it cites.
’local vs. global parameters’, breaking the gaussian compexity barrier
Shahar Mendelson · 2015
Later among the works it cites.
On multiplier processes under weak moment assumptions
Shahar Mendelson · 2015
Later among the works it cites.
SLOPE is adaptive to unknown sparsity and asymptotically minimax
Weijie Su and Emmanuel Candès · 2016
Closest in time.