Research map / Adversarial robustness and security / Certified and empirical robustness
Achieving Robustness in Classification Using Optimal Transport With Hinge Regularization
Check your idea against 108,967 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
- Lower Bounds on Adversarial Robustness from Optimal Transport (NeurIPS 2019 · similarity 0.91)
- Generalised Lipschitz Regularisation Equals Distributional Robustness (ICML 2021 · similarity 0.89)
- Regularized Optimal Transport is Ground Cost Adversarial (ICML 2020 · similarity 0.89)
- Theoretical Analysis of Adversarial Learning: A Minimax Approach (NeurIPS 2019 · similarity 0.89)
- Certified Robustness via Dynamic Margin Maximization and Improved Lipschitz Regularization (NeurIPS 2023 · similarity 0.89)
- Pay attention to your loss : understanding misconceptions about Lipschitz neural networks (NeurIPS 2022 · similarity 0.89)
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.
