AdaptDel: Adaptable Deletion Rate Randomized Smoothing for Certified Robustness
Zhuoqun Huang, Neil G. Marchant, Olga Ohrimenko, Benjamin I. P. Rubinstein
TL;DR
This work targets certified robustness for sequence classification under edit-distance perturbations by moving beyond fixed-rate deletion smoothing. It introduces AdaptDel, an input-length dependent deletion mechanism, and AdaptDel+, which adds calibrated binning and optimization to maximize certified radius while maintaining clean accuracy. The authors extend randomized smoothing theory to variable-rate deletions, deriving tractable bounds via longest common subsequences and knapsack-style optimizations, and they demonstrate substantial gains across four NLP tasks, especially for longer inputs. The results show large improvements in robustness (mean CR and median CC) with modest trade-offs in clean accuracy, highlighting the practical impact of input-adaptive smoothing for real-world, variable-length sequences.
Abstract
We consider the problem of certified robustness for sequence classification against edit distance perturbations. Naturally occurring inputs of varying lengths (e.g., sentences in natural language processing tasks) present a challenge to current methods that employ fixed-rate deletion mechanisms and lead to suboptimal performance. To this end, we introduce AdaptDel methods with adaptable deletion rates that dynamically adjust based on input properties. We extend the theoretical framework of randomized smoothing to variable-rate deletion, ensuring sound certification with respect to edit distance. We achieve strong empirical results in natural language tasks, observing up to 30 orders of magnitude improvement to median cardinality of the certified region, over state-of-the-art certifications.
