Research map / Adversarial robustness and security / Certified and empirical robustness
Improved Generalization Bounds for Adversarially Robust Learning
Idan Attias, Aryeh Kontorovich, Yishay Mansour
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- On the Generalization Analysis of Adversarial Learning (ICML 2022 · similarity 0.92)
- Adversarially Robust Generalization Requires More Data (NeurIPS 2018 · similarity 0.91)
- Adversarially Robust Learning: A Generic Minimax Optimal Learner and Characterization (NeurIPS 2022 · similarity 0.91)
- Adversarial Robustness of Supervised Sparse Coding (NeurIPS 2020 · similarity 0.91)
- More Data Can Expand The Generalization Gap Between Adversarially Robust and Standard Models (ICML 2020 · similarity 0.90)
- Rademacher Complexity for Adversarially Robust Generalization (ICML 2019 · similarity 0.90)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
