- Rating
- 4
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
A "backdoor poisoned" example in ML is one where an attacker pairs a hidden trigger (such as a small patch in an image or rare phrase in text) with a deliberately set incorrect label. The authors present a formula that relates the number of poisoned examples to the number of poison-counterexamples (ones with that pattern but correctly labeled) in order for an attack to succeed or fail.
Critical strengths
- Treating counter-examples as a priced additive term is a novel and interesting approach.
- The predictions from this equation are carefully tested, including a robustness analysis.
- The finding that the weight w for CIFAR-10 is 0.73, so a backdoor forms even when counterexamples exceed poisoned examples, is a noteable discovery - and bad news for defenses against data poisoning.
Critical weaknesses
- Not really a weakness, but as the paper notes, Souly et al. (2025) and Yang et al. (2022) developed the count and Natarajan et al. (2013) and Patrini et al. (2017) the one-half threshold, so the contribution is the linear interpolation between them and the counter-example term.
- An important and highly relevent prior work missed by the authors is Manoj and Blum (NeurIPS 2021), "Excess Capacity and Backdoor Poisoning", which attempts to provide a theoretical framework to explain poisoning.
- Study is limited to CFAR-10; could this be a phenomena of that particular model?
Questions for authors
The title promises a explanation ("Why") for the relationship between between poisoning and counterexamples. The paper, however, demonstrates the relationship but does not explain it. Can the authors speculate on why it holds?
Thank you.
The shared points (where Eq. 1 comes from, Manoj and Blum, new experiments, the rewrite) are in the general comment. Here are the ones specific to your review.
Q1, why linear. Linearity is an assumption of our model, so it is the first thing we tested. It held, in three ways. A curved term is zero over a fifteenfold range of counter-examples. Each threshold is predicted from the others. A threshold at 200 counter-examples was predicted from data up to 100: 186.6 predicted, 181.9 measured (Section 5). Within one setting (one dataset, one corpus size, one network) the weight is the average effect per counter-example, and we test that it does not change with the number of counter-examples. Between settings it does change, for example with corpus size.
Q2, relation to hard negatives and backdoor sample complexity. The two costs map onto the two literatures. The build cost is the backdoor sample complexity: the count of poisoned examples needed when nothing opposes them, which Manoj and Blum prove does not depend on the clean data (general comment). The weight is the effect of one hard negative: our counter-examples are hard negatives, images that carry the trigger under their true label. Sagawa et al. (ICML 2020) show that a network memorises such minority examples, and Qi et al. (ICLR 2023) use them to hide a backdoor; neither gives how many poisoned examples one of them cancels. What the model adds: that number (the weight), the fact that it is not always one, and that the two costs add into one threshold. Section 9 has been expanded.
Q3, larger scale. Does it hold a larger scale, yes. We added: ImageNet32 with 100 classes, 120,000 images, a ResNet-18, up to 200 counter-examples. The threshold is again a straight line, with weight 0.53 (Appendix K). One limit, stated in Appendix K: the paper reads the threshold where the target rate passes the true-label accuracy. If the threshold is read where the target rate reaches one half, the line bends on this dataset, because a quarter of the probes go to other classes. We read it the first way because it asks whether the rule beats the true label, which makes sense for any number of classes; with 100 classes the target rate can stay under one half while the rule already wins.
Terminology. The paper joins two literatures, and neither vocabulary covers both cases. "Trigger" assumes an added patch; in the label-noise case there is none. We used neutral words, and this made the paper harder for readers from the backdoor literature. Each word now has its standard term at first use, and Table 3 lists the equivalents.