Lipschitz Networks and Distributional Robustness
Not on the map. Why?
Abstract (arXiv)
Robust risk minimisation has several advantages: it has been studied with regards to improving the generalisation properties of models and robustness to adversarial perturbation. We bound the distributionally robust risk for a model class rich enough to include deep neural networks by a regularised empirical risk involving the Lipschitz constant of the model. This allows us to interpretand quantify the robustness properties of a deep neural network. As an application we show the distributionally robust risk upperbounds the adversarial training risk.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 Sep 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 1; 2023: 0; 2024: 0; 2025: 0; 2026: 1.
6 papers.
- 2021Attention is Not All You Need: Pure Attention Loses Rank Doubly Exponentially with Depthcited by 411
- 2021Spectral Bias in Practice: The Role of Function Frequency in Generalizationcited by 36
- 2022Distributionally Robust Bayesian Optimization with varphi-divergencescited by 16
- 2021Miti-DETR: Object Detection based on Transformers with Mitigatory Self-Attention Convergencecited by 12
- 2021What training reveals about neural network complexitycited by 5
- 2026Sinkhorn doubly stochastic attention rank decay analysiscited by 2
- 2026Sinkhorn doubly stochastic attention rank decay analysis9 Apr 2026
- 2022Distributionally Robust Bayesian Optimization with varphi-divergences4 Mar 2022
- 2021Miti-DETR: Object Detection based on Transformers with Mitigatory Self-Attention Convergence26 Dec 2021
- 2021Spectral Bias in Practice: The Role of Function Frequency in Generalization6 Oct 2021
- 2021What training reveals about neural network complexity8 Jun 2021
- 2021Attention is Not All You Need: Pure Attention Loses Rank Doubly Exponentially with Depth5 Mar 2021