Towards Large Certified Radius in Randomized Smoothing using Quasiconcave Optimization

• Published in: arXiv.org 2023-12
• Main Authors: Bo-Han, Kung, Shang-Tse, Chen
• Format: Article
• Language: English
• Subjects: Algorithms; Artificial neural networks; Computing costs; Data points; Empirical analysis; Optimization; Smoothing
• ISSN: 2331-8422

Randomized smoothing is currently the state-of-the-art method that provides certified robustness for deep neural networks. However, due to its excessively conservative nature, this method of incomplete verification often cannot achieve an adequate certified radius on real-world datasets. One way to obtain a larger certified radius is to use an input-specific algorithm instead of using a fixed Gaussian filter for all data points. Several methods based on this idea have been proposed, but they either suffer from high computational costs or gain marginal improvement in certified radius. In this work, we show that by exploiting the quasiconvex problem structure, we can find the optimal certified radii for most data points with slight computational overhead. This observation leads to an efficient and effective input-specific randomized smoothing algorithm. We conduct extensive experiments and empirical analysis on CIFAR-10 and ImageNet. The results show that the proposed method significantly enhances the certified radii with low computational overhead.