Near-optimal estimates for the $\ell^p$-Lipschitz constants of deep random ReLU neural networks

Sjoerd Dirksen, Patrick Finke, Paul Geuchen, Dominik Stöger, Felix Voigtlaender
6/24/2025
stat.MLcs.LGmath.PR

No confident code implementation found for this paper.

Abstract

This paper studies the $\ell^p$-Lipschitz constants of ReLU neural networks $Φ: \mathbb{R}^d \to \mathbb{R}$ with random parameters for $p \in [1,\infty]$. The distribution of the weights follows a variant of the He initialization and the biases are drawn from symmetric distributions. We derive high probability upper and lower bounds for wide networks that differ at most by a factor that is logarithmic in the network's width and linear in its depth. In the special case of shallow networks, we obtain matching bounds. Remarkably, the behavior of the $\ell^p$-Lipschitz constant varies significantly between the regimes $ p \in [1,2) $ and $ p \in [2,\infty] $. For $p \in [2,\infty]$, the $\ell^p$-Lipschitz constant behaves similarly to $\Vert g\Vert_{p'}$, where $g \in \mathbb{R}^d$ is a $d$-dimensional standard Gaussian vector and $1/p + 1/p' = 1$. In contrast, for $p \in [1,2)$, the $\ell^p$-Lipschitz constant aligns more closely to $\Vert g \Vert_{2}$.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{dirksen2025nearoptimal,
  title  = {Near-optimal estimates for the $\ell^p$-Lipschitz constants of deep random ReLU neural networks},
  author = {Sjoerd Dirksen and Patrick Finke and Paul Geuchen and Dominik Stöger and Felix Voigtlaender},
  year   = {2025},
  eprint = {2506.19695},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.19695v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2506.19695.svg)](https://codeofpaper.com/paper/2506.19695)

Discussion