Fetching the paper…
Reading the bibliography…
We study robustness to test-time adversarial attacks in the regression setting with $\ell_p$ losses and arbitrary perturbation sets.
A course on empirical processes
Richard M Dudley · 1984
Earlier work this paper cites.
Relating data compression and learnability
Nick Littlestone and Manfred Warmuth · 1986
Earlier work this paper cites.
Queries and concept learning
Dana Angluin · 1988
Earlier work this paper cites.
Efficient distribution-free learning of probabilistic concepts
Michael J Kearns and Robert E Schapire · 1994
Earlier work this paper cites.
Sample compression, learnability, and the vapnik-chervonenkis dimension
Sally Floyd and Manfred Warmuth · 1995
Earlier work this paper cites.
Scale-sensitive dimensions, uniform convergence, and learnability
Noga Alon, Shai Ben-David, Nicolo Cesa-Bianchi, and David Haussler · 1997
Earlier work this paper cites.
A decision-theoretic generalization of on-line learning and an application to boosting
Yoav Freund and Robert E Schapire · 1997
Earlier work this paper cites.
Bounds on the number of examples needed for learning functions
Hans Ulrich Simon · 1997
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.
Neural network learning: Theoretical foundations , volume 9
Martin Anthony, Peter L Bartlett, Peter L Bartlett, et al · 1999
Earlier work this paper cites.
Function learning from interpolation
Martin Anthony and Peter L Bartlett · 2000
Earlier work this paper cites.
Boosting methods for regression
Nigel Duffy and David Helmbold · 2002
Earlier work this paper cites.
Robust regression by boosting the median
Balázs Kégl · 2003
Earlier work this paper cites.
Maximum-margin matrix factorization
Nathan Srebro, Jason Rennie, and Tommi Jaakkola · 2004
Earlier work this paper cites.
Pac-bayesian compression bounds on the prediction error of learning algorithms for classification
Thore Graepel, Ralf Herbrich, and John Shawe-Taylor · 2005
Earlier work this paper cites.
Combinatorics of random processes and sections of convex bodies
Mark Rudelson and Roman Vershynin · 2006
Earlier work this paper cites.
Multiclass learnability and the erm principle
Amit Daniely, Sivan Sabato, Shai Ben-David, and Shai Shalev-Shwartz · 2011
Earlier work this paper cites.
Exact matrix completion via convex optimization
Emmanuel Candes and Benjamin Recht · 2012
Earlier work this paper cites.
Near-optimal algorithms for online matrix prediction
Elad Hazan, Satyen Kale, and Shai Shalev-Shwartz · 2012
Cited alongside, same era.
Convergence of stochastic processes
David Pollard · 2012
Cited alongside, same era.
Online learning for time series prediction
Oren Anava, Elad Hazan, Shie Mannor, and Ohad Shamir · 2013
Cited alongside, same era.
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
Cited alongside, same era.
Boosting: Foundations and algorithms
Robert E Schapire and Yoav Freund · 2013
Cited alongside, same era.
Intriguing properties of neural networks
Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian Goodfellow, and Rob Fergus · 2013
Online control with adversarial disturbances
Naman Agarwal, Brian Bullins, Elad Hazan, Sham Kakade, and Karan Singh · 2019
Later among the works it cites.
Improved generalization bounds for robust learning
Idan Attias, Aryeh Kontorovich, and Yishay Mansour · 2019
Later among the works it cites.
Adversarial examples from computational constraints
Sébastien Bubeck, Yin Tat Lee, Eric Price, and Ilya Razenshteyn · 2019
Later among the works it cites.
Sample compression for real-valued learners
Steve Hanneke, Aryeh Kontorovich, and Menachem Sadigurschi · 2019
Later among the works it cites.
An optimal unrestricted learning procedure
Shahar Mendelson · 2019
Later among the works it cites.
Vc classes are adversarially robustly learnable, but only improperly
Omar Montasser, Steve Hanneke, and Nathan Srebro · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Optimal learners for multiclass problems
Amit Daniely and Shai Shalev-Shwartz · 2014
Cited alongside, same era.
Explaining and harnessing adversarial examples
Ian J Goodfellow, Jonathon Shlens, and Christian Szegedy · 2014
Cited alongside, same era.
Learning and inference in the presence of corrupted inputs
Uriel Feige, Yishay Mansour, and Robert Schapire · 2015
Cited alongside, same era.
Classification with low rank and missing data
Elad Hazan, Roi Livni, and Yishay Mansour · 2015
Cited alongside, same era.
Supervised learning through the lens of compression
Ofir David, Shay Moran, and Amir Yehudayoff · 2016
Cited alongside, same era.
The optimal sample complexity of pac learning
Steve Hanneke · 2016
Cited alongside, same era.
Later among the works it cites.
Rademacher complexity for adversarially robust generalization
Dong Yin, Ramchandran Kannan, and Peter Bartlett · 2019
Later among the works it cites.
Black-box certification and learning under adversarial perturbations
Hassan Ashtiani, Vinayak Pathak, and Ruth Urner · 2020
Later among the works it cites.
Adversarial learning guarantees for linear hypotheses and neural networks
Pranjal Awasthi, Natalie Frank, and Mehryar Mohri · 2020
Later among the works it cites.
Sharp statistical guaratees for adversarially robust gaussian classification
Chen Dan, Yuting Wei, and Pradeep Ravikumar · 2020
Later among the works it cites.
Sample complexity of robust linear classification on separated data
Robi Bhattacharjee, Somesh Jha, and Kamalika Chaudhuri · 2021
Later among the works it cites.
On the hardness of robust classification
Pascale Gourdeau, Varun Kanade, Marta Kwiatkowska, and James Worrell · 2021
Later among the works it cites.
Primal and dual combinatorial dimensions
Pieter Kleer and Hans Simon · 2021
Later among the works it cites.
Fat-shattering dimension of k k -fold maxima
Aryeh Kontorovich and Idan Attias · 2021
Later among the works it cites.
Adversarially robust estimate and risk analysis in linear regression
Yue Xing, Ruizhi Zhang, and Guang Cheng · 2021
Later among the works it cites.
A characterization of semi-supervised adversarially-robust pac learnability
Idan Attias, Steve Hanneke, and Yishay Mansour · 2022
Closest in time.
Theoretically grounded loss functions and algorithms for adversarial robustness
Pranjal Awasthi, Anqi Mao, Mehryar Mohri, and Yutao Zhong · 2023
Closest in time.
Cross-entropy loss functions: Theoretical analysis and applications
Anqi Mao, Mehryar Mohri, and Yutao Zhong · 2023
Closest in time.