atlas

Research map / Architectures and efficiency / RNNs and normalization

DeepBern-Nets: Taming the Complexity of Certifying Neural Networks Using Bernstein Polynomial Activations and Precise Bound Propagation

AAAI 2024 · Architectures and efficiency › RNNs and normalization · approach: Width and depth of ReLU networks · 5 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes DeepBern-Nets, networks whose activations are learnable Bernstein polynomials, and Bern-IBP, an interval-bound-propagation certifier that yields tight output bounds for robustness certification and certified training.

Problem

Incomplete certifiers for ReLU networks give loose bounds that degrade with depth, so adversarially trained networks are hard to certify efficiently.

Approach

Replace ReLU with learnable Bernstein-polynomial activations whose range-enclosure and subdivision properties let interval-style bound propagation compute tight bounds cheaply, with bounds of each activation's input precomputed during training.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use Bern-IBP instead of standard IBPDeepBern-Nets · MNIST and CIFAR-10 adversarial robustnesscertified accuracy (%): 0 -> 88.69; 0 -> 72.12; 0 -> 65.22; 0 -> 80.21; 0 -> 56.49; 0 -> 72.35; 0 -> 27.74; 0 -> 33.49; 0 -> 28.55; 0 -> 14.7Helped
Use Bernstein polynomial activations with Bern-IBP for certified training instead of the SOK ReLU setupFCNNa · MNIST, ϵ=0.1certified accuracy (%): 68 -> 72Helped
Use Bernstein polynomial activations with Bern-IBP for certified training instead of the SOK ReLU setupFCNNa · CIFAR-10, ϵ=8/255certified accuracy (%): 27 -> 28Helped
Use Bernstein polynomial activations with Bern-IBP for certified training instead of the SOK ReLU setupFCNNa · CIFAR-10, ϵ=2/255certified accuracy (%): 33 -> 38Helped

Surprising findings

Limitations

Experimental setup

Datasets: MNIST CIFAR-10

Benchmarks: MNIST CIFAR-10 SOK benchmark

Metrics: certified accuracy verification time lower bound on robustness volume error of reachable sets

Baselines: IBP (auto_LiRPA) alpha-CROWN CROWN CROWN-IBP (SOK benchmark)

Builds on: interval bound propagation CROWN-IBP PGD adversarial training Bernstein polynomial subdivision and enclosure properties

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