Adversarially robust low dimensional representations
Original
Pranjal Awasthi, Vaggos Chatziafratis, Xue Chen, and Aravindan Vijayaraghavan · 1911
Earlier work this paper cites.
The sizes of compact subsets of hilbert space and continuity of gaussian processes
Richard M Dudley · 1967
Earlier work this paper cites.
Learning disjunction of conjunctions
Leslie G Valiant · 1985
Earlier work this paper cites.
Learning from noisy examples
Dana Angluin and Philip Laird · 1988
Earlier work this paper cites.
Learnability and the Vapnik-Chervonenkis dimension
Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, and Manfred K. Warmuth · 1989
Earlier work this paper cites.
Learning in the presence of malicious errors
Michael Kearns and Ming Li · 1993
Earlier work this paper cites.
Characterizations of learnability for classes of {0, …, n}-valued functions
Shai Ben-David, Nicolò Cesa-Bianchi, David Haussler, and Philip M. Long · 1995
Earlier work this paper cites.
Prediction, learning, uniform convergence, and scale-sensitive dimensions
Peter L Bartlett and Philip M Long · 1998
Earlier work this paper cites.
Generalization performance of support vector machines and other pattern classifiers , pages 43–54
Peter Bartlett and John Shawe-Taylor · 1999
Earlier work this paper cites.
Adaptive game playing using multiplicative weights
Yoav Freund and Robert E Schapire · 1999
Earlier work this paper cites.
On the size of convex hulls of small sets
Shahar Mendelson · 2001
Earlier work this paper cites.
Rademacher and gaussian complexities: Risk bounds and structural results
Peter L Bartlett and Shahar Mendelson · 2002
Earlier work this paper cites.
Entropy and the combinatorial dimension
S. Mendelson and R. Vershynin · 2003
Earlier work this paper cites.
Theory of classification: A survey of recent advances
Stéphane Boucheron, Olivier Bousquet, and Gábor Lugosi · 2005
Earlier work this paper cites.
Efficiently learning adversarially robust halfspaces with noise
Original
Omar Montasser, Surbhi Goel, Ilias Diakonikolas, and Nathan Srebro · 2005
Earlier work this paper cites.
Nightmare at test time: robust learning by feature deletion
Amir Globerson and Sam Roweis · 2006
Earlier work this paper cites.
Improved second-order bounds for prediction with expert advice
Nicolo Cesa-Bianchi, Yishay Mansour, and Gilles Stoltz · 2007
Earlier work this paper cites.
Convex learning with invariances
Choon H Teo, Amir Globerson, Sam T Roweis, and Alex J Smola · 2008
Earlier work this paper cites.
Robust Optimization
A. Ben-Tal, L. El Ghaoui, and A.S. Nemirovski · 2009
Earlier work this paper cites.
Learning to classify with missing and corrupted features
Ofer Dekel, Ohad Shamir, and Lin Xiao · 2010
Earlier work this paper cites.
Reducing adversarially robust learning to non-robust pac learning
Original
Omar Montasser, Steve Hanneke, and Nathan Srebro · 2010
Earlier work this paper cites.
Robustness and generalization
Huan Xu and Shie Mannor · 2012
Earlier work this paper cites.
Evasion attacks against machine learning at test time
Battista Biggio, Igino Corona, Davide Maiorca, Blaine Nelson, Nedim Šrndić, Pavel Laskov, Giorgio Giacinto, and Fabio Roli · 2013
Earlier work this paper cites.