暂无分享,去创建一个
[1] Elad Hazan,et al. Introduction to Online Convex Optimization , 2016, Found. Trends Optim..
[2] Frederick R. Forst,et al. On robust estimation of the location parameter , 1980 .
[3] Samuel B. Hopkins. Mean estimation with sub-Gaussian rates in polynomial time , 2018, The Annals of Statistics.
[4] Jerry Li,et al. Sever: A Robust Meta-Algorithm for Stochastic Optimization , 2018, ICML.
[5] Gregory Valiant,et al. Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers , 2017, ITCS.
[6] Henryk Wozniakowski,et al. Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start , 1992, SIAM J. Matrix Anal. Appl..
[7] Noga Alon,et al. The space complexity of approximating the frequency moments , 1996, STOC '96.
[8] Jacob Steinhardt,et al. ROBUST LEARNING: INFORMATION THEORY AND ALGORITHMS A DISSERTATION SUBMITTED TO THE DEPARTMENT OF COMPUTER SCIENCE AND THE COMMITTEE ON GRADUATE STUDIES OF STANFORD UNIVERSITY IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY , 2018 .
[9] Zeyuan Allen Zhu,et al. Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates , 2015, STOC.
[10] G. Lugosi,et al. Robust multivariate mean estimation: The optimality of trimmed mean , 2019, The Annals of Statistics.
[11] Yu Cheng,et al. High-Dimensional Robust Mean Estimation via Gradient Descent , 2020, ICML.
[12] R. Albert. Scale-free networks in cell biology , 2005, Journal of Cell Science.
[13] Santosh S. Vempala,et al. Agnostic Estimation of Mean and Covariance , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[14] G. Lugosi,et al. Sub-Gaussian mean estimators , 2015, 1509.05845.
[15] Pradeep Ravikumar,et al. A Unified Approach to Robust Mean Estimation , 2019, ArXiv.
[16] G. Lugosi,et al. Sub-Gaussian estimators of the mean of a random vector , 2017, The Annals of Statistics.
[17] Sanjeev Arora,et al. The Multiplicative Weights Update Method: a Meta-Algorithm and Applications , 2012, Theory Comput..
[18] John Darzentas,et al. Problem Complexity and Method Efficiency in Optimization , 1983 .
[19] David P. Woodruff,et al. Faster Algorithms for High-Dimensional Robust Covariance Estimation , 2019, COLT.
[20] Martin Zinkevich,et al. Online Convex Programming and Generalized Infinitesimal Gradient Ascent , 2003, ICML.
[21] Samuel B. Hopkins,et al. Quantum Entropy Scoring for Fast Robust Mean Estimation and Improved Outlier Detection , 2019, NeurIPS.
[22] M. Ledoux. The concentration of measure phenomenon , 2001 .
[23] Zhixian Lei,et al. A Fast Spectral Algorithm for Mean Estimation with Sub-Gaussian Rates , 2019, COLT 2019.
[24] Christos Faloutsos,et al. Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.
[25] Gerold Alsmeyer,et al. Chebyshev's Inequality , 2011, International Encyclopedia of Statistical Science.
[26] Leslie G. Valiant,et al. Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..
[27] Jerry Li,et al. Computationally Efficient Robust Sparse Estimation in High Dimensions , 2017, COLT.
[28] Jerry Zheng Li,et al. Principled approaches to robust machine learning and beyond , 2018 .
[29] Jerry Li,et al. Being Robust (in High Dimensions) Can Be Practical , 2017, ICML.
[30] Manfred K. Warmuth,et al. Randomized Online PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension , 2008 .
[31] Percy Liang,et al. Adaptivity and Optimism: An Improved Exponentiated Gradient Algorithm , 2014, ICML.
[32] Banghua Zhu,et al. Robust estimation via generalized quasi-gradients , 2020, Information and Inference: A Journal of the IMA.
[33] Daniel M. Kane,et al. List-decodable robust mean estimation and learning mixtures of spherical gaussians , 2017, STOC.
[34] Jerry Li,et al. Robustly Learning a Gaussian: Getting Optimal Error, Efficiently , 2017, SODA.
[35] Daniel M. Kane,et al. Robust Estimators in High Dimensions without the Computational Intractability , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[36] Jerry Li,et al. Mixture models, robustness, and sum of squares proofs , 2017, STOC.
[37] O. Catoni. Challenging the empirical mean and empirical variance: a deviation study , 2010, 1009.2048.
[38] Daniel M. Kane,et al. Recent Advances in Algorithmic High-Dimensional Robust Statistics , 2019, ArXiv.
[39] Mark Herbster,et al. Tracking the Best Linear Predictor , 2001, J. Mach. Learn. Res..
[40] Weiran Wang,et al. Projection onto the capped simplex , 2015, ArXiv.
[41] Ilias Diakonikolas,et al. Efficient Algorithms and Lower Bounds for Robust Linear Regression , 2018, SODA.
[42] Yu Cheng,et al. High-Dimensional Robust Mean Estimation in Nearly-Linear Time , 2018, SODA.
[43] Peter L. Bartlett,et al. Fast Mean Estimation with Sub-Gaussian Rates , 2019, COLT.
[44] Albert-László Barabási,et al. The origin of bursts and heavy tails in human dynamics , 2005, Nature.
[45] J. Kuczy,et al. Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start , 1992 .
[46] G. Lecu'e,et al. Robust sub-Gaussian estimation of a mean vector in nearly linear time , 2019, The Annals of Statistics.
[47] Michalis Faloutsos,et al. On power-law relationships of the Internet topology , 1999, SIGCOMM '99.