atlas

Research map / Learning theory and algorithms / Sample complexity

Lipschitz regularity of deep neural networks: analysis and efficient estimation

NeurIPS 2018 · Learning theory and algorithms › Sample complexity · approach: Robust and surrogate-loss learning bounds · 135 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
split the bound computation across consecutive layers using SeqLipAutoLip on MNIST-CNN · MNIST-CNN, 10 layersLipschitz upper-bound tightness relative to AutoLip: factor of 5Helped
use Greedy SeqLip with the 200 highest singular values of each linear layerAlexNet Lipschitz estimation · AlexNetLipschitz upper bound: 3.62 \times 10^7 -> 5.45 \times 10^6Helped
use gradient-ascent Greedy SeqLip instead of exact SeqLip optimization (ablation)SeqLip · synthetic MLP simulationserror relative to SeqLip: 0.01%No clear effect
use gradient-ascent Greedy SeqLip when the exact optimum is computable (ablation)SeqLip · settings where the exact optimum is computableoptimization error: at most 1%No clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy