Laplace-Bridged Randomized Smoothing for Fast Certified Robustness
Miao Lin, MD Saifur Rahman Mazumder, Feng Yu, Daniel Takabi, Rui Ning

TL;DR
This paper introduces Laplace-Bridged Smoothing, an analytic method that enhances randomized smoothing for certified robustness, significantly reducing computational costs and enabling deployment on edge devices.
Contribution
We propose Laplace-Bridged Smoothing, an analytic reformulation that eliminates the need for noise-augmented training and reduces certification computation in randomized smoothing.
Findings
LBS achieves stronger certified robustness than traditional RS on CIFAR-10 and ImageNet.
LBS reduces certification cost per sample by nearly tenfold.
LBS enables practical deployment on resource-constrained edge devices with speedups up to 494×.
Abstract
Randomized Smoothing (RS) offers formal guarantees for arbitrary base classifiers but faces two key practical bottlenecks: (i) it often relies on noise-augmented training to achieve nontrivial certificates, which increases training cost, can reduce clean accuracy, and weakens RS as a genuinely post-hoc defense; and (ii) certification is computationally expensive, typically requiring tens of thousands of noisy forward passes per input, which hinders deployment, especially on resource-constrained edge devices. To address both limitations, we propose Laplace-Bridged Smoothing (LBS), an analytic reformulation of RS that replaces high-dimensional input-space Monte Carlo (MC) sampling with efficient computations in a low-dimensional probability space. LBS preserves formal robustness guarantees without requiring noise-augmented training while substantially reducing certification…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
