Preference poisoning against log-linear DPO reduces to a binary sparse approximation problem solved by lattice-reduction (BAL-A) and matching-pursuit (BMP-A) algorithms that carry recovery guarantees.
Adversarial attacks on adversarial bandits
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.LG 2verdicts
UNVERDICTED 2roles
method 1polarities
use method 1representative citing papers
Introduces bounded fake data injection attacks that force a class of stochastic bandit algorithms to select a target arm in nearly all rounds at sublinear attack cost.
citing papers explorer
-
Efficient Preference Poisoning Attack on Offline RLHF
Preference poisoning against log-linear DPO reduces to a binary sparse approximation problem solved by lattice-reduction (BAL-A) and matching-pursuit (BMP-A) algorithms that carry recovery guarantees.
-
Practical Adversarial Attacks on Stochastic Bandits via Fake Data Injection
Introduces bounded fake data injection attacks that force a class of stochastic bandit algorithms to select a target arm in nearly all rounds at sublinear attack cost.