atlas

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

Beta-CROWN: Efficient Bound Propagation with Per-neuron Split Constraints for Neural Network Robustness Verification

NeurIPS 2021 · Learning theory and algorithms › Combinatorial and search optimization · approach: Semidefinite relaxations for verification · 94 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
add per-neuron split constraints (beta) to CROWN bound propagation in BaBCROWN-based BaB (Fast-and-Complete) · CIFAR-10 Baseavg verification time (s): 695.01 -> 226.06Helped
use FSB branching instead of BaBSR (ablation)β-CROWN · CIFAR-10 Baseavg verification time (s): 226.06 -> 118.23Helped
β-CROWN FSB vs PRIMA multi-neuron relaxationincomplete verification · MNIST MLP 8x100verified accuracy (%): 42.8 -> 62.0Helped
β-CROWN FSB vs PRIMAincomplete verification · CIFAR ResNetverified accuracy (%)No clear effect
β-CROWN FSB vs SDP-FOadversarially trained CNNs · MNIST CNN-A-Advverified accuracy (%): 43.4 -> 70.5Helped
compute intermediate bounds with MIP before BaBβ-CROWN FSB on small MLPs · MNIST MLPsverified accuracyHelped

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