Near-optimal estimates for the p-Lipschitz constants of deep random ReLU neural networks

arXiv:2506.19695 · stat.ML, cs.LG, math.PR · Submitted 2025-06-24 · Read on arXiv

stat.ML, cs.LG, math.PR

Submitted: 2025-06-24

Updated: 2026-09-10

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Generalization — 4× in this paper · explained in 13 episodes
• Robustness — 2× in this paper · explained in 5 episodes
• Adversarial Attacks — 1× in this paper · explained in 1 episode
• Adversarial Examples — 1× in this paper · explained in 2 episodes
• Adversarial Robustness — 1× in this paper · explained in 3 episodes
• Decoupling — 1× in this paper · explained in 2 episodes
• Embeddings — 1× in this paper · explained in 2 episodes
• Homogeneity — 1× in this paper · explained in 2 episodes
• IEEE International Conference on Computer Vision — 1× in this paper
• Sparsity — 1× in this paper · explained in 4 episodes
• Trace — 1× in this paper · explained in 2 episodes
• Verification — 1× in this paper · explained in 2 episodes

Sources

• A Convergence Theory for Deep Learning via Over-Parameterization
• Near-Optimal Bounds for Binary Embeddings of Arbitrary Sets

Related papers

• Behavior of prediction performance metrics with rare events
• Optimal Estimation of Generic Dynamics by Path-Dependent Neural Jump ODEs
• A Posterior-Dynamics Framework for Imaging Inverse Problems with Pretrained Diffusion Priors
• Efficient quadratic entropy with distance sketches
• Embedding-Bias in Conditional Independence Testing
• From Log-Odds to Shapley Values: An Explanatory Geometry for the Weighted Naive Bayes Classifier