paper-with-me

홈 › Papers

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

2025-06-24 · Sjoerd Dirksen, Patrick Finke, Paul Geuchen, Dominik Stöger, Felix Voigtlaender

This paper studies the $\ell^p$-Lipschitz constants of ReLU neural networks $\Phi: \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}$.

📄 PDF Abstract BibTeX arXiv:2506.19695

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

ReLU How Do I Communicate to Expedia? How Do I Communicate to Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Live Support & Special Travel…

Similar Papers 제목 키워드 기반

Private Stochastic Convex Optimization with Heavy Tails: Near-Optimality from Simple Reductions

2024-06-04 · Hilal Asi, Daogao Liu, Kevin Tian

We study the problem of differentially private stochastic convex optimization (DP-SCO) with heavy-tailed gradients, where we assume a $k^{\text{th}}$-moment bound on the Lipschitz constants of sample functions rather tha…

Lipschitz Continuity of Mahalanobis Distances and Bilinear Forms

2016-04-04 · Valentina Zantedeschi, Rémi Emonet, Marc Sebban

Many theoretical results in the machine learning domain stand only for functions that are Lipschitz continuous. Lipschitz continuity is a strong form of continuity that linearly bounds the variations of a function. In th…

BIG-bench Machine Learning

Efficiently Computing Local Lipschitz Constants of Neural Networks via Bound Propagation

2022-10-13 · Zhouxing Shi, Yihan Wang, huan zhang, Zico Kolter 외

Lipschitz constants are connected to many properties of neural networks, such as robustness, fairness, and generalization. Existing methods for computing Lipschitz constants either produce relatively loose upper bounds o…

Fairness

Near-optimal Delta-convex Estimation of Lipschitz Functions

2025-11-19 · Gábor Balázs arxiv

This paper presents a tractable algorithm for estimating an unknown Lipschitz function from noisy observations and establishes an upper bound on its convergence rate. The approach extends max-affine methods from convex s…

Lipschitz regularity of graph Laplacians on random data clouds

2020-07-13 · Jeff Calder, Nicolas Garcia Trillos, Marta Lewicka

In this paper we study Lipschitz regularity of elliptic PDEs on geometric graphs, constructed from random data points. The data points are sampled from a distribution supported on a smooth manifold. The family of equatio…