MixTrain: Scalable Training of Verifiably Robust Neural Networks
Not on the map. Why?
Abstract (arXiv)
Making neural networks robust against adversarial inputs has resulted in an arms race between new defenses and attacks. The most promising defenses, adversarially robust training and verifiably robust training, have limitations that restrict their practical applications. The adversarially robust training only makes the networks robust against a subclass of attackers and we reveal such weaknesses by developing a new attack based on interval gradients. By contrast, verifiably robust training provides protection against any L-p norm-bounded attacker but incurs orders of magnitude more computational and memory overhead than adversarially robust training. We propose two novel techniques, stochastic robust approximation and dynamic mixed training, to drastically improve the efficiency of verifiably robust training without sacrificing verified robustness. We leverage two critical insights: (1) instead of over the entire training set, sound over-approximations over randomly subsampled training data points are sufficient for efficiently guiding the robust training process; and (2) We observe that the test accuracy and verifiable robustness often conflict after certain training epochs. Therefore, we use a dynamic loss function to adaptively balance them for each epoch. We designed and implemented our techniques as part of MixTrain and evaluated it on six networks trained on three popular datasets including MNIST, CIFAR, and ImageNet-200. Our evaluations show that MixTrain can achieve up to 95.2% verified robust accuracy against L_∞ norm-bounded attackers while taking 15 and 3 times less training time than state-of-the-art verifiably robust training and adversarially robust training schemes, respectively. Furthermore, MixTrain easily scales to larger networks like the one trained on ImageNet-200, significantly outperforming the existing verifiably robust training methods.
Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). First posted on arXiv 6 Nov 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 4; 2024: 2; 2025: 1.
9 papers.
- 2022Linearity Grafting: Relaxed Neuron Pruning Helps Certifiable Robustnesscited by 10
- 2023Efficient Error Certification for Physics-Informed Neural Networkscited by 10
- 2021Explaining Adversarial Vulnerability with a Data Sparsity Hypothesiscited by 4
- 2023Certified Adversarial Robustness Within Multiple Perturbation Boundscited by 4
- 2023Certifying Ensembles: A General Certification Theory with S-Lipschitznesscited by 2
- 2024On the Effectiveness of Adversarial Training on Malware Classifierscited by 1
- 2023The Power of Typed Affine Decision Structures: A Case Studycited by 0
- 2024Confidence-aware Denoised Fine-tuning of Off-the-shelf Models for Certified Robustnesscited by 0
- 2025Probably Approximately Global Robustness Certificationcited by 0
- 2025Probably Approximately Global Robustness Certification9 Nov 2025
- 2024On the Effectiveness of Adversarial Training on Malware Classifiers24 Dec 2024
- 2024Confidence-aware Denoised Fine-tuning of Off-the-shelf Models for Certified Robustness13 Nov 2024
- 2023Efficient Error Certification for Physics-Informed Neural Networks17 May 2023
- 2023The Power of Typed Affine Decision Structures: A Case Study28 Apr 2023
- 2023Certifying Ensembles: A General Certification Theory with S-Lipschitzness25 Apr 2023
- 2023Certified Adversarial Robustness Within Multiple Perturbation Bounds20 Apr 2023
- 2022Linearity Grafting: Relaxed Neuron Pruning Helps Certifiable Robustness15 Jun 2022
- 2021Explaining Adversarial Vulnerability with a Data Sparsity Hypothesis1 Mar 2021