mlsanityData to 7 Oct 2026

Lipschitz Networks and Distributional Robustness

arXiv 1809.01129 ↗First posted 4 Sep 2018stat.ML cs.LGcited by 6

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

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 1; 2023: 0; 2024: 0; 2025: 0; 2026: 1.

6 papers.