Keeping up with dynamic attackers: Certifying robustness to adaptive online data poisoning
원문 초록
The rise of foundation models fine-tuned on human feedback from potentially untrusted users has increased the risk of adversarial data poisoning, necessitating the study of robustness of learning algorithms against such attacks. Existing research on provable certified robustness against data poisoning attacks primarily focuses on certifying robustness for static adversaries who modify a fraction of the dataset used to train the model before the training algorithm is applied. In practice, particularly when learning from human feedback in an online sense, adversaries can observe and react to the learning process and inject poisoned samples that optimize adversarial objectives better than when they are restricted to poisoning a static dataset once, before the learning algorithm is applied. Indeed, it has been shown in prior work that online dynamic adversaries can be significantly more powerful than static ones. We present a novel framework for computing certified bounds on the impact of dynamic poisoning, and use these certificates to design robust learning algorithms. We give an illustration of the framework for the mean estimation and binary classification problems and outline directions for extending this in further work. The code to implement our certificates and replicate our results is available at https://github.com/Avinandan22/Certified-Robustness.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Investigating cybersecurity incidents using large language models in latest-generation wireless networks
Addressing The Devastating Effects Of Single-Task Data Poisoning In Exemplar-Free Continual Learning
Inverse Scene Text Removal
EDINET-Bench: Evaluating LLMs on Complex Financial Tasks using Japanese Financial Statements
VLMs Can Aggregate Scattered Training Patches
PatchDEMUX: A Certifiably Robust Framework for Multi-label Classifiers Against Adversarial Patches
토론
이 논문과 연결된 포럼 글이 아직 없습니다.