mlsanityData to 7 Oct 2026

On the Paradox of Certified Training

arXiv 2102.06700 ↗First posted 12 Feb 2021cs.LG cs.AIcited by 12

Not on the map. Why?

Abstract (arXiv)

Certified defenses based on convex relaxations are an established technique for training provably robust models. The key component is the choice of relaxation, varying from simple intervals to tight polyhedra. Counterintuitively, loose interval-based training often leads to higher certified robustness than what can be achieved with tighter relaxations, which is a well-known but poorly understood paradox. While recent works introduced various improvements aiming to circumvent this issue in practice, the fundamental problem of training models with high certified robustness remains unsolved. In this work, we investigate the underlying reasons behind the paradox and identify two key properties of relaxations, beyond tightness, that impact certified training dynamics: continuity and sensitivity. Our extensive experimental evaluation with a number of popular convex relaxations provides strong evidence that these factors can explain the drop in certified robustness observed for tighter relaxations. We also systematically explore modifications of existing relaxations and discover that improving unfavorable properties is challenging, as such attempts often harm other properties, revealing a complex tradeoff. Our findings represent an important first step towards understanding the intricate optimization challenges involved in certified training.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 27 of its 51 references that are in the map. First posted on arXiv 12 Feb 2021.

Builds on

27 of 51 references.

References · 27

  1. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  2. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  3. 2013Intriguing properties of neural networkscited by 5,114
  4. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
  5. 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,324
  6. 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 748
  7. 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 739
  8. 2020RobustBench: a standardized adversarial robustness benchmarkcited by 659
  9. 2017Provable defenses against adversarial examples via the convex outer adversarial polytopecited by 564
  10. 2018Efficient Neural Network Robustness Certification with General Activation Functionscited by 439
  11. 2019Provably Robust Deep Learning via Adversarially Trained Smoothed Classifierscited by 328
  12. 2018On the Effectiveness of Interval Bound Propagation for Training Verifiably Robust Modelscited by 322
15 more
  1. 2018Certified Defenses against Adversarial Examplescited by 305
  2. 2018Towards Fast Computation of Certified Robustness for ReLU Networkscited by 254
  3. 2017Formal Verification of Piece-Wise Linear Feed-Forward Neural Networkscited by 241
  4. 2019Towards Stable and Efficient Training of Verifiably Robust Neural Networkscited by 204
  5. 2018Formal Security Analysis of Neural Networks using Symbolic Intervalscited by 185
  6. 2018Semidefinite relaxations for certifying robustness to adversarial examplescited by 178
  7. 2018Efficient Formal Safety Analysis of Neural Networkscited by 165
  8. 2020Randomized Smoothing of All Shapes and Sizescited by 146
  9. 2018Scaling provable adversarial defensescited by 141
  10. 2019A Convex Relaxation Barrier to Tight Robustness Verification of Neural Networkscited by 124
  11. 2020Enabling certification of verification-agnostic networks via memory-efficient semidefinite programmingcited by 65
  12. 2020The Convex Relaxation Barrier, Revisited: Tightened Single-Neuron Relaxations for Neural Network Verificationcited by 50
  13. 2020Scaling Polyhedral Neural Network Verification on GPUscited by 43
  14. 2021Towards Certifying L-infinity Robustness using Neural Networks with L-inf-dist Neuronscited by 40
  15. 2019Universal Approximation with Certified Networkscited by 9

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 5; 2024: 5; 2025: 0; 2026: 2.

12 papers.