Skip to content

An f-Divergence-Based Certified Robustness Framework Against Backdoor Poisoning Attacks

A Certified Robustness Framework for Backdoor Poisoning Attacks using $f$-Divergences

arXiv· arXiv:2610.34934· Evan Rose, Alina OpreaNortheastern UniversityIndexed by this site · 17 days ago· Originally publishedDefenses

Translation in progress — untranslated text is omitted.

Quick read

Defenses

Based on the paper PDF (AI-generated); refer to the original

AI summaryResearchers propose a certified robustness framework based on f-divergence for defending against data poisoning and backdoor poisoning attacks. The framework randomizes inputs by combining data subsampling with noise added to features, labels and test samples, and provides a composable certification procedure that can handle any combination of threat model and noise-adding strategy, covering several previous certification mechanisms as special cases. The authors state that the experiments provide, for the first time, certification for poisoning adversaries under general ℓp constraints with bagging combined with Laplace, Gaussian and Uniform noise.

Questions
Machine learning systems trained on untrusted data face data poisoning and backdoor poisoning attacks; the authors argue that existing randomized smoothing certified defenses apply only to specific threat models and simple smoothing mechanisms, and struggle to handle composite threats.
Methods
The threat model is decomposed into four independent axes: number of contaminated samples, feature, label, and test perturbation; the smoothing mechanism combines data subsampling (bagging) with feature, label, and test noise; certification is reduced to convex optimization under f-divergence constraints, and a recombination joint convexity bound is used to handle the mixture distribution.
Experiments and results
Certifies ℓ1, ℓ2, ℓ∞ feature adversaries on MNIST, CIFAR10, and binary classification variants; the authors report that under the backdoor adversary the method in this paper is clearly better than RAB (still above 45% at R=2% on MNIST-17, while RAB drops to zero after R=0.5%), and exactly reproduces the certificates of Jia et al. and BagFlip.
Limitations and future work
The authors note that the method requires training thousands of base learners, does not exploit dataset or base-learner properties, and that the trade-off between subsampling and noise addition is insufficiently understood; experiments cover only image classification on MNIST, CIFAR10, and their binary variants.

Related events and news

1 events · 0 news mentions

Related papers

Show 3 more papers
Read originalarxiv.org