Adversarial / Foundations
verifiedCertified Robustness
Empirical defences are claims that nobody has broken them yet, and the history of the field is a list of such claims that were later broken. A certificate is different: a proof that no perturbation within a stated radius can change this prediction. It is much weaker in radius than empirical defences appear to be, and it is actually true.
Randomised smoothing is the practical route — classify a noisy vote rather than the input, and the smoothed classifier's margin yields a radius directly. The trade is that the certificate covers a specific norm ball and says nothing outside it, so a certified model is not a safe model; it is a model with one honest guarantee attached to it. Inference costs a batch of samples per prediction.
With g(x) = argmax P over noise η ~ N(0, σ²I) of f(x+η) = c, the prediction is certified within radius (σ/2)·(Φ super -1 (p sub A ) − Φ super -1 (p sub B )) for top-two class probabilities p sub A , p sub B . Radius grows with σ and with confidence, so more noise buys a larger certificate and a less accurate classifier — the trade is in one formula.
noise-scale holds 25% of the budget; rest holds the remaining 75%.
Certified radius bought against the clean accuracy given up for it, in equal units. Drag the smoothing noise up to watch the guarantee grow and the classifier beneath it get worse.
Reviewed by opendroid · 2026-08-18
- arXiv:1902.02918 — Certified Adversarial Robustness via Randomized Smoothing