paper-with-me

Papers

Keeping up with dynamic attackers: Certifying robustness to adaptive online data poisoning

2025-02-23 · Avinandan Bose, Laurent Lessard, Maryam Fazel, Krishnamurthy Dj Dvijotham

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.

📄 PDF Abstract BibTeX arXiv:2502.16737

Code (1)

avinandan22/certified-robustness 공식 구현 pytorch

Tasks

Binary ClassificationData Poisoning

Similar Papers 제목 키워드 기반

Semidefinite relaxations for certifying robustness to adversarial examples

2018-11-02 · NeurIPS 2018 12 · Aditi Raghunathan, Jacob Steinhardt, Percy Liang

Despite their impressive performance on diverse tasks, neural networks fail catastrophically in the presence of adversarial inputs---imperceptibly but adversarially perturbed versions of natural inputs. We have witnessed…

CROP: Certifying Robust Policies for Reinforcement Learning through Functional Smoothing

2021-06-17 · ICLR 2022 4 · Fan Wu, Linyi Li, Zijian Huang, Yevgeniy Vorobeychik 외

As reinforcement learning (RL) has achieved great success and been even adopted in safety-critical domains such as autonomous vehicles, a range of empirical studies have been conducted to improve its robustness against a…

Atari GamesAutonomous Vehiclesreinforcement-learningReinforcement Learning+1

On Certifying Robustness against Backdoor Attacks via Randomized Smoothing

2020-02-26 · Binghui Wang, Xiaoyu Cao, Jinyuan Jia, Neil Zhenqiang Gong

Backdoor attack is a severe security threat to deep neural networks (DNNs). We envision that, like adversarial examples, there will be a cat-and-mouse game for backdoor attacks, i.e., new empirical defenses are developed…

Backdoor Attack

Adaptive Diffusion Denoised Smoothing : Certified Robustness via Randomized Smoothing with Differentially Private Guided Denoising Diffusion

2025-07-10 · Frederick Shpilevskiy, Saiyue Lyu, Krishnamurthy Dj Dvijotham, Mathias Lécuyer 외 arxiv

We propose Adaptive Diffusion Denoised Smoothing, a method for certifying the predictions of a vision model against adversarial examples, while adapting to the input. Our key insight is to reinterpret a guided denoising …

Certifying Robustness via Topological Representations

2025-01-18 · Jens Agerberg, Andrea Guidolin, Andrea Martinelli, Pepijn Roos Hoefgeest 외

We propose a neural network architecture that can learn discriminative geometric representations of data from persistence diagrams, common descriptors of Topological Data Analysis. The learned representations enjoy Lipsc…

Topological Data Analysis