LiST: Lipschitz Scaling Training for Robust and Calibrated Neural Networks
Not on the map. Why?
Abstract (arXiv)
While accuracy, robustness, and calibration are all essential for reliable neural networks, they are often studied separately; developing models that satisfy all three simultaneously remains a central challenge. Lipschitz-constrained models guarantee robustness by design, yet the manual selection of the Lipschitz constraint L governs the resulting accuracy-robustness trade-off, and their calibration properties remain largely underexplored. In this work, we highlight a theoretical and empirical link between the enforced Lipschitz constraint and Temperature Scaling, a state-of-the-art calibration method. Specifically, we find that for a given training scheme, there exists a non-trivial value L* that yields an out-of-the-box calibrated network, and that calibration acts as a principled criterion to select a well-defined operating point on the accuracy-robustness Pareto front. Leveraging these insights, we introduce Lipschitz Scaling Training (LiST), a novel training paradigm that iteratively adjusts the global Lipschitz constant to reach this operating point. Through a margin parameter in the training loss, LiST further enables the construction of a fully calibrated Pareto front, allowing users to navigate the accuracy-robustness trade-off while remaining calibrated throughout. At convergence, LiST also enables the reintegration of calibration data into training, improving sample efficiency without sacrificing calibration. We validate LiST on CIFAR-10/100 and Tiny-ImageNet, demonstrating competitive accuracy and robustness against constrained and unconstrained baselines, while remaining calibrated out of the box. Code is available at GitHub.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 41 of its 52 references that are in the map. First posted on arXiv 8 Jul 2026.
Builds on
41 of 52 references.
References · 41
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2013Intriguing properties of neural networkscited by 5,114
- 2017On Calibration of Modern Neural Networkscited by 4,860
- 2021Convex optimizationcited by 2,479
- 2016Equality of Opportunity in Supervised Learningcited by 2,000
- 2018Spectral Normalization for Generative Adversarial Networkscited by 1,618
- 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,442
- 2019When Does Label Smoothing Help?cited by 985
- 2017Spectrally-normalized margin bounds for neural networkscited by 681
- 2018Lipschitz regularity of deep neural networks: analysis and efficient estimationcited by 413
29 more
- 2019Beyond temperature scaling: Obtaining well-calibrated multiclass probabilities with Dirichlet calibrationcited by 359
- 2020Calibrating Deep Neural Networks using Focal Losscited by 353
- 2017A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networkscited by 309
- 2017Size-Independent Sample Complexity of Neural Networkscited by 289
- 2018Sorting out Lipschitz function approximationcited by 211
- 2018Lipschitz-Margin Training: Scalable Certification of Perturbation Invariance for Deep Neural Networkscited by 193
- 2024The Road Less Scheduledcited by 158
- 2020Improving model calibration with accuracy versus uncertainty optimizationcited by 123
- 2021Orthogonalizing Convolutional Layers with the Cayley Transformcited by 105
- 2021The Devil is in the Margin: Margin-based Label Smoothing for Network Calibrationcited by 91
- 2019Preventing Gradient Attenuation in Lipschitz Constrained Convolutional Networkscited by 86
- 2021Skew Orthogonal Convolutionscited by 67
- 2021A Dynamical System Perspective for Lipschitz Neural Networkscited by 59
- 2023A Unified Algebraic Perspective on Lipschitz Neural Networkscited by 58
- 2022Almost-Orthogonal Layers for Efficient General-Purpose Lipschitz Networkscited by 39
- 2023Dual Focal Loss for Calibrationcited by 33
- 2022LOT: Layer-wise Orthogonal Training on Improving ℓ2 Certified Robustnesscited by 32
- 2021Pay attention to your loss: understanding misconceptions about 1-Lipschitz neural networkscited by 30
- 2020Achieving robustness in classification using optimal transport with hinge regularizationcited by 27
- 2020Improving Calibration through the Relationship with Adversarial Robustnesscited by 26
- 2022Robust Models are less Over-Confidentcited by 25
- 2021Disrupting Deep Uncertainty Estimation Without Harming Accuracycited by 19
- 2023Mitigating Transformer Overconfidence via Lipschitz Regularizationcited by 15
- 2018The Limitations of Model Uncertainty in Adversarial Settingscited by 14
- 2025An Adaptive Orthogonal Convolution Scheme for Efficient and Flexible CNN Architecturescited by 8
- 2024Calibration Attacks: A Comprehensive Study of Adversarial Attacks on Model Confidencecited by 7
- 2025Enhancing Certified Robustness via Block Reflector Orthogonal Layers and Logit Annealing Losscited by 5
- 2024Intriguing Properties of Robust Classificationcited by 3
- 2024On the Robustness of Adversarial Training Against Uncertainty Attackscited by 2
Built on by
Not cited yet.