Fetching the paper…
Reading the bibliography…
Most high-dimensional estimation and prediction methods propose to minimize a cost function (empirical risk) that is written as a sum of losses associated to each data point.
George K Atia and Venkatesh Saligrama, Boolean compressed sensing and noisy group testing , IEEE Transactions on Information Theory 58
1901
Earlier work this paper cites.
Ronald Aylmer Fisher, On the mathematical foundations of theoretical statistics , Philosophical Transactions of the Royal Society of London. Series A, Containing Papers of a Mathematical or Physical Character 222
1922
Earlier work this paper cites.
Herbert Robbins and Sutton Monro, A stochastic approximation method , The annals of mathematical statistics (1951), 400–407
1951
Earlier work this paper cites.
John Milnor, Morse theory , vol. 51, Princeton University Press, 1963
1963
Earlier work this paper cites.
Peter J Huber, Robust regression: asymptotics, conjectures and monte carlo , The Annals of Statistics (1973), 799–821
1973
Earlier work this paper cites.
John N Tsitsiklis, Dimitri P Bertsekas, and Michael Athans, Distributed asynchronous deterministic and stochastic gradient optimization algorithms , 1984 American Control Conference, 1984, pp. 484–489
1984
Earlier work this paper cites.
Vladimir Naumovich Vapnik, Statistical learning theory , vol. 1, Wiley New York, 1998
1998
Earlier work this paper cites.
Uri Alon, Naama Barkai, Daniel A Notterman, Kurt Gish, Suzanne Ybarra, Daniel Mack, and Arnold J Levine, Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays , Proceedings of the National Academy of Sciences 96
1999
Earlier work this paper cites.
Andrew R Conn, Nicholas IM Gould, and Ph L Toint, Trust region methods , vol. 1, Siam, 2000
2000
Earlier work this paper cites.
Sara A Van de Geer, Applications of empirical process theory , vol. 91, Cambridge University Press Cambridge, 2000
2000
Earlier work this paper cites.
Emmanuel J Candes and Terence Tao, Decoding by linear programming , IEEE transactions on information theory 51
2005
Earlier work this paper cites.
David L Donoho, Compressed sensing , IEEE Transactions on information theory 52
2006
Earlier work this paper cites.
Emmanuel Candes and Terence Tao, The dantzig selector: Statistical estimation when p is much larger than n , The Annals of Statistics (2007), 2313–2351
2007
Earlier work this paper cites.
Peter J Bickel, Ya’acov Ritov, and Alexandre B Tsybakov, Simultaneous analysis of lasso and dantzig selector , The Annals of Statistics (2009), 1705–1732
2009
Earlier work this paper cites.
Olivier Chapelle, Chuong B Do, Choon H Teo, Quoc V Le, and Alex J Smola, Tighter bounds for structured estimation , Advances in neural information processing systems, 2009, pp. 281–288
2009
Earlier work this paper cites.
Raghunandan H Keshavan, Sewoong Oh, and Andrea Montanari, Matrix completion from a few entries , Information Theory, 2009. ISIT 2009. IEEE International Symposium on, IEEE, 2009, pp. 324–328
2009
Cited alongside, same era.
Jie Peng, Ji Zhu, Anna Bergamaschi, Wonshik Han, Dong-Young Noh, Jonathan R Pollack, and Pei Wang, Regularized multivariate regression for identifying master predictors with application to integrative genomics study of breast cancer , The annals of applied statistics 4
2010
Cited alongside, same era.
Jason N Laska, Zaiwen Wen, Wotao Yin, and Richard G Baraniuk, Trust, but verify: Fast and accurate signal recovery from 1-bit compressive measurements , IEEE Transactions on Signal Processing 59
2011
Cited alongside, same era.
Mark Rudelson and Shuheng Zhou, Reconstruction from anisotropic random measurements , Ann Arbor 1001
2011
Cited alongside, same era.
Yurii Nesterov, Gradient methods for minimizing composite functions , Mathematical Programming 140
2013
Later among the works it cites.
Tan Nguyen and Scott Sanner, Algorithms for direct 0–1 loss optimization in binary classification , Proceedings of The 30th International Conference on Machine Learning, 2013, pp. 1085–1093
2013
Later among the works it cites.
Yaniv Plan and Roman Vershynin, One-bit compressed sensing by linear programming , Communications on Pure and Applied Mathematics 66
2013
Later among the works it cites.
VI Serdobolskii, Multivariate statistical analysis: A high-dimensional approach , vol. 41, Springer Science & Business Media, 2013
2013
Later among the works it cites.
Albert Ai, Alex Lapanowski, Yaniv Plan, and Roman Vershynin, One-bit compressed sensing with non-gaussian measurements , Linear Algebra and its Applications 441
2014
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Boris A Dubrovin, Anatolij Timofeevič Fomenko, and Sergeĭ Petrovich Novikov, Modern geometry—methods and applications: Part ii: The geometry and topology of manifolds , vol. 104, Springer, 2012
2012
Cited alongside, same era.
Jason N Laska and Richard G Baraniuk, Regime change: Bit-depth versus measurement-rate in compressive sensing , IEEE Transactions on Signal Processing 60
2012
Cited alongside, same era.
Po-Ling Loh and Martin J Wainwright, High-dimensional regression with noisy and missing data: Provable guarantees with nonconvexity , The Annals of Statistics (2012), 1637–1664
2012
Cited alongside, same era.
Sahand N Negahban, Padeep Ravikumar, Martin J Wainwright, and Bin Yu, A unified framework for high-dimensional analysis of m-estimators with decomposable regularizers , Statistical science 27
2012
Cited alongside, same era.
Roman Vershynin, Introduction to the non-asymptotic analysis of random matrices , Compressed Sensing (Y. C. Eldar and G. Kutyniok, eds.), Cambridge University Press, Cambridge, 2012
2012
Cited alongside, same era.
Yichao Wu and Yufeng Liu, Robust truncated hinge loss support vector machines , Journal of the American Statistical Association (2012)
2012
Cited alongside, same era.
Stéphane Boucheron, Gábor Lugosi, and Pascal Massart, Concentration inequalities: A nonasymptotic theory of independence , OUP Oxford, 2013
2013
Cited alongside, same era.
M. Lichman, UCI machine learning repository , 2013
2013
Cited alongside, same era.
Later among the works it cites.
Andrea Montanari and Emile Richard, A statistical model for tensor pca , Advances in Neural Information Processing Systems, 2014, pp. 2897–2905
2014
Later among the works it cites.
2014
Later among the works it cites.
Animashree Anandkumar, Rong Ge, and Majid Janzamin, Learning overcomplete latent variable models through tensor methods , Proceedings of the Conference on Learning Theory (COLT), Paris, France, 2015
2015
Later among the works it cites.
Yuxin Chen and Emmanuel Candes, Solving random quadratic systems of equations is nearly as easy as solving linear systems , Advances in Neural Information Processing Systems, 2015, pp. 739–747
2015
Later among the works it cites.
Yann LeCun, Yoshua Bengio, and Geoffrey Hinton, Deep learning , Nature 521
2015
Later among the works it cites.
2015
Later among the works it cites.
2015
Later among the works it cites.