Fetching the paper…
Reading the bibliography…
Modern large-scale statistical models require to estimate thousands to millions of parameters.
Estimation of the Mean of a Multivariate Normal Distribution
Charles M. Stein · 1981
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
Arkadii Semenovich Nemirovsky and David Borisovich Yudin · 1983
Earlier work this paper cites.
Spin glass theory and beyond: An Introduction to the Replica Method and Its Applications
Marc Mézard, Giorgio Parisi, and Miguel Virasoro · 1987
Earlier work this paper cites.
Asymptotic Statistics
Aad W. van der Vaart · 1998
Earlier work this paper cites.
Analytic and algorithmic solution of random satisfiability problems
Marc Mézard, Giorgio Parisi, and Riccardo Zecchina · 2002
Earlier work this paper cites.
Testing Statistical Hypotheses
E.L. Lehmann and Joseph P. Romano · 2005
Earlier work this paper cites.
A generalization of the Lindeberg principle
Sourav Chatterjee · 2006
Earlier work this paper cites.
The Dantzig selector: statistical estimation when p is much larger than n
Emmanuel Candés and Terence Tao · 2007
Earlier work this paper cites.
High-dimensional analysis of semidefinite relaxations for sparse principal components
Arash A Amini and Martin J Wainwright · 2008
Earlier work this paper cites.
Limit of the smallest eigenvalue of a large dimensional sample covariance matrix
Zhi-Dong Bai and Yong-Qua Yin · 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.
On consistency and sparsity for principal components analysis in high dimensions
Iain M Johnstone and Arthur Yu Lu · 2009
Earlier work this paper cites.
Probabilistic graphical models: principles and techniques
Daphne Koller and Nir Friedman · 2009
Earlier work this paper cites.
Reconstruction for the potts model
Allan Sly · 2009
Earlier work this paper cites.
Probability: Theory and Examples
Rick Durrett · 2010
Earlier work this paper cites.
Generalized power method for sparse principal component analysis
Michel Journée, Yurii Nesterov, Peter Richtárik, and Rodolphe Sepulchre · 2010
Earlier work this paper cites.
Matrix completion from noisy entries
Raghunandan H Keshavan, Andrea Montanari, and Sewoong Oh · 2010
Cited alongside, same era.
Optimal Transport, old and new
Cèdric Villani · 2010
Cited alongside, same era.
The dynamics of message passing on dense graphs, with applications to compressed sensing
Mohsen Bayati and Andrea Montanari · 2011
Cited alongside, same era.
High-dimensional regression with noisy and missing data: Provable guarantees with non-convexity
Po-Ling Loh and Martin J Wainwright · 2011
Cited alongside, same era.
Probability and Measure
Patrick Billingsley · 2012
Cited alongside, same era.
Introduction to the non-asymptotic analysis of random matrices
Roman Vershynin · 2012
Cited alongside, same era.
Measure Theory and Fine Properties of Functions
Lawrence C. Evans and Ronald F. Gariepy · 2015
Later among the works it cites.
Sum-of-squares lower bounds for sparse PCA
Tengyu Ma and Avi Wigderson · 2015
Later among the works it cites.
Optimal rates of convergence for noisy sparse phase retrieval via thresholded Wirtinger flow
T Tony Cai, Xiaodong Li, and Zongming Ma · 2016
Later among the works it cites.
Sparse pca via covariance thresholding
Yash Deshpande and Andrea Montanari · 2016
Later among the works it cites.
Local algorithms for block models with side information
Elchanan Mossel and Jiaming Xu · 2016
Later among the works it cites.
Statistical algorithms and a lower bound for detecting planted cliques
Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh S Vempala, and Ying Xiao · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Optimal M-estimation in high-dimensional regression
Derek Bean, Peter J Bickel, Noureddine El Karoui, and Bin Yu · 2013
Cited alongside, same era.
Optimal detection of sparse principal components in high dimension
Quentin Berthet and Philippe Rigollet · 2013
Cited alongside, same era.
State evolution for general approximate message passing algorithms, with applications to spatial coupling
Adel Javanmard and Andrea Montanari · 2013
Cited alongside, same era.
Sparse signal recovery from quadratic measurements via convex programming
Xiaodong Li and Vladislav Voroninski · 2013
Cited alongside, same era.
Sparse principal component analysis and iterative thresholding
Zongming Ma · 2013
Cited alongside, same era.
Proximal Algorithms
Neal Parikh and Stephen Boyd · 2013
Cited alongside, same era.
Statistical query algorithms for mean vector estimation and stochastic convex optimization
Vitaly Feldman, Cristobal Guzman, and Santosh Vempala · 2017
Later among the works it cites.
Reducibility and computational lower bounds for problems with planted sparse structure
Matthew Brennan, Guy Bresler, and Wasim Huleihel · 2018
Later among the works it cites.
Debiasing the lasso: Optimal sample size for gaussian designs
Adel Javanmard and Andrea Montanari · 2018
Later among the works it cites.
Lectures on convex optimization
Yurii Nesterov · 2018
Later among the works it cites.
Glassy nature of the hard phase in inference problems
Fabrizio Antenucci, Silvio Franz, Pierfrancesco Urbani, and Lenka Zdeborová · 2019
Later among the works it cites.
Optimal errors and phase transitions in high-dimensional generalized linear models
Jean Barbier, Florent Krzakala, Nicolas Macris, Léo Miolane, and Lenka Zdeborová · 2019
Later among the works it cites.
State evolution for approximate message passing with non-separable functions
Raphael Berthier, Andrea Montanari, and Phan-Minh Nguyen · 2019
Later among the works it cites.
Fundamental limits of symmetric low-rank matrix estimation
Marc Lelarge and Léo Miolane · 2019
Later among the works it cites.
Fundamental limits of weak recovery with applications to phase retrieval
Marco Mondelli and Andrea Montanari · 2019
Later among the works it cites.
Structured signal recovery from quadratic measurements: Breaking sample complexity barriers via nonconvex optimization
Mahdi Soltanolkotabi · 2019
Later among the works it cites.