AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Semialgebraic Optimization for Lipschitz Constants of ReLU Networks

Tong Chen, Jean B Lasserre, Victor Magron, Edouard Pauwels

NeurIPS 2020 · Learning theory and algorithms › Combinatorial and search optimization · approach: Semidefinite relaxations for verification · 17 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
HR-2 SDP relaxation instead of LipOpt-3 LP(80,80) network · global Lipschitz bound, sparsity 80Lipschitz upper bound (lower better): 4.68 -> 2.68Improved
HR-2 instead of LipOpt-3 at low sparsity(80,80) network · global Lipschitz bound, sparsity 20Lipschitz upper bound: 1.55 -> 1.45Mixed
HR-2 instead of LipOpt-3(80,80) network · solver time, sparsity 80time (s): 71.49 -> 9.82Improved
HR-2 instead of Shor relaxationSDP-NN (784,500) · global Lipschitz boundLipschitz upper bound: 17.85 -> 14.56Improved
HR-2 instead of Shor relaxationSDP-NN (784,500) · solver timetime (s): 2869 -> 12246Hurt
HR-2 instead of LipOpt-3 for certification(80,80) binary classifier · certified ratio eps=0.03certified ratio: 4.78% -> 62.46%Improved
HR-2 instead of LipOpt-4(80,80) network · global Lipschitz bound, sparsity 20Lipschitz upper bound: 1.43 -> 1.45Mixed

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