Fetching the paper…
Reading the bibliography…
Learning from data in the presence of outliers is a fundamental problem in statistics.
A survey of sampling from contaminated distributions
J.W Tukey · 1960
Earlier work this paper cites.
Robust estimation of a location parameter
Peter J. Huber · 1964
Earlier work this paper cites.
A general qualitative definition of robustness
Frank R. Hampel · 1971
Earlier work this paper cites.
Mathematics and the picturing of data
J. W. Tukey · 1975
Earlier work this paper cites.
Robust statistics. The approach based on influence functions
F. R. Hampel, E. M. Ronchetti, P. J. Rousseeuw, and W. A. Stahel · 1986
Earlier work this paper cites.
On the sum of the largest eigenvalues of a symmetric matrix
Michael L. Overton and Robert S. Womersley · 1992
Earlier work this paper cites.
Coloring random and semi-random k-colorable graphs
A Blum and J Spencer · 1995
Earlier work this paper cites.
Heuristics for semirandom graph problems
Uriel Feige and Joe Kilian · 2001
Earlier work this paper cites.
Convex optimization and Euclidean distance geometry
J. Dattorro · 2005
Earlier work this paper cites.
A discriminative framework for clustering via similarity functions
Maria-Florina Balcan, Avrim Blum, and Santosh Vempala · 2008
Earlier work this paper cites.
Robust Statistics
Peter J. Huber · 2011
Earlier work this paper cites.
The multiplicative weights update method: a meta-algorithm and applications
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2012
Earlier work this paper cites.
Faster and simpler width-independent parallel algorithms for positive semidefinite programming
Richard Peng, Kanat Tangwongsan, and Peng Zhang · 2012
Earlier work this paper cites.
Lecture notes on metric embeddings
Jirı Matoušek · 2013
Earlier work this paper cites.
The strong convexity of von neumann’s entropy
Yao-Liang Yu · 2013
Earlier work this paper cites.
A survey on operator monotonicity, operator convexity, and operator means
Pattrawut Chansangiam · 2015
Cited alongside, same era.
Randomized block krylov methods for stronger and faster approximate singular value decomposition
Cameron Musco and Christopher Musco · 2015
Cited alongside, same era.
A combinatorial, primal-dual approach to semidefinite programs
Sanjeev Arora and Satyen Kale · 2016
Cited alongside, same era.
Even faster SVD decomposition yet without agonizing pain
Zeyuan Allen Zhu and Yuanzhi Li · 2016
Cited alongside, same era.
Using optimization to obtain a width-independent, parallel, simpler, and faster positive SDP solver
Zeyuan Allen Zhu, Yin Tat Lee, and Lorenzo Orecchia · 2016
Cited alongside, same era.
Robust estimators in high dimensions without the computational intractability
Ilias Diakonikolas, Gautam Kamath, Daniel M Kane, Jerry Li, Ankur Moitra, and Alistair Stewart · 2016
Robust moment estimation and improved clustering via sum of squares
Pravesh K. Kothari, Jacob Steinhardt, and David Steurer · 2018
Later among the works it cites.
High-dimensional robust mean estimation in nearly-linear time
Yu Cheng, Ilias Diakonikolas, and Rong Ge · 2019
Later among the works it cites.
Faster algorithms for high-dimensional robust covariance estimation
Yu Cheng, Ilias Diakonikolas, Rong Ge, and David P. Woodruff · 2019
Later among the works it cites.
Quantum entropy scoring for fast robust mean estimation and improved outlier detection
Yihe Dong, Samuel Hopkins, and Jerry Li · 2019
Later among the works it cites.
Recent advances in algorithmic high-dimensional robust statistics, 2019
Ilias Diakonikolas and Daniel M. Kane · 2019
Later among the works it cites.
Outlier-robust high-dimensional sparse estimation via iterative filtering
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Agnostic estimation of mean and covariance
Kevin A Lai, Anup B Rao, and Santosh Vempala · 2016
Cited alongside, same era.
Computationally efficient robust sparse estimation in high dimensions
Sivaraman Balakrishnan, Simon S. Du, Jerry Li, and Aarti Singh · 2017
Cited alongside, same era.
Learning from untrusted data
Moses Charikar, Jacob Steinhardt, and Gregory Valiant · 2017
Cited alongside, same era.
Statistical query lower bounds for robust estimation of high-dimensional gaussians and gaussian mixtures
Ilias Diakonikolas, Daniel M. Kane, and Alistair Stewart · 2017
Cited alongside, same era.
Better agnostic clustering via relaxed tensor norms
Pravesh K Kothari and Jacob Steinhardt · 2017
Cited alongside, same era.
Robust learning of fixed-structure bayesian networks
Yu Cheng, Ilias Diakonikolas, Daniel M. Kane, and Alistair Stewart · 2018
Cited alongside, same era.
Ilias Diakonikolas, Daniel Kane, Sushrut Karmalkar, Eric Price, and Alistair Stewart · 2019
Later among the works it cites.
Efficient algorithms and lower bounds for robust linear regression
Ilias Diakonikolas, Weihao Kong, and Alistair Stewart · 2019
Later among the works it cites.
Introduction to online convex optimization
Elad Hazan · 2019
Later among the works it cites.
How hard is robust mean estimation?
Samuel B. Hopkins and Jerry Li · 2019
Later among the works it cites.
List-decodable linear regression
Sushrut Karmalkar, Adam R. Klivans, and Pravesh Kothari · 2019
Later among the works it cites.
List-decodable subspace recovery via sum-of-squares, 2020
Ainesh Bakshi and Pravesh Kothari · 2020
Closest in time.
Positive semidefinite programming: Mixed, parallel, and width-independent
Arun Jambulapati, Yin Tat Lee, Jerry Li, Swati Padmanabhan, and Kevin Tian · 2020
Closest in time.
A new algorithm for the robust semi-random independent set problem
Theo McKenzie, Hermish Mehta, and Luca Trevisan · 2020
Closest in time.
List decodable learning via sum of squares
Prasad Raghavendra and Morris Yau · 2020
Closest in time.
List decodable subspace recovery, 2020
Prasad Raghavendra and Morris Yau · 2020
Closest in time.