Improved generalization bounds for robust learning

MaRDI QIDQ7034402zbMATH OpenFDO

Authors Idan Attias, Aryeh Kontorovich, Yishay Mansour

Publication date 31 January 2025

Full work available at URL https://proceedings.mlr.press/v98/attias19a.html

zbMATH Keywords

Rademacher complexityzero-sum gamegeneralization boundsrobust learningadversarial learningfat-shattering dimension

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80)

Cites work

• scientific article; zbMATH DE number 7014202 (Why is no real title available?)
• 10.1162/153244303321897690
• Adaptive game playing using multiplicative weights
• Characterizations of learnability for classes of \(\{0,\dots,n\}\)-valued functions
• Efficient Classification for Metric Data
• Entropy and the combinatorial dimension
• Foundations of machine learning
• Learnability and the Vapnik-Chervonenkis dimension
• Learning Theory
• Learning in the Presence of Malicious Errors
• Machine learning in adversarial environments
• Robust optimization
• Robust probabilistic inference
• Robustness and generalization
• The sizes of compact subsets of Hilbert space and continuity of Gaussian processes
• Theory of Classification: a Survey of Some Recent Advances

Cited in

(2)

• Robust empirical risk minimization with tolerance
• Adversarially robust learning with tolerance

This page was built for publication: Improved generalization bounds for robust learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034402)