atlas

Research map / Learning theory and algorithms / Sample complexity

Lipschitz constant estimation of Neural Networks via sparse polynomial optimization

ICLR 2020 · Learning theory and algorithms › Sample complexity · approach: Robust and surrogate-loss learning bounds · 25 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
Use LiPopt-4 instead of SDPLipschitz estimation · MNIST, label 8Lipschitz bound: 98.8 -> 88.3Helped
Increase the LiPopt hierarchy degree from 3 to 4 (ablation)LiPopt · MNIST, label 8Lipschitz bound: 94.6 -> 88.3Helped
Use LiPopt-3 instead of SDPLipschitz estimation · MNIST, label 8Lipschitz bound: 98.8 -> 94.6Helped
Use LiPopt-4 instead of the product of layer-wise boundsLipschitz estimation · MNIST, label 8Lipschitz bound: 691.5 -> 88.3Helped
Use tighter activation-derivative bounds from the restricted input region (ablation)LiPopt-3 · Local Lipschitz estimation on random networksLipschitz boundHelped
Increase LiPopt hierarchy degree by 1 beyond the minimum degree (ablation)LiPopt-k · Random networks with one or two hidden layersRelative errorHelped
Exploit network sparsity in the LP certificate (ablation)LiPopt-k · Random networks with one or two hidden layersComputation timeHelped

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