Can In-Context Reinforcement Learning Recover From Reward Poisoning Attacks?

Paulius Sasnauskas, Yiğit Yalın, Goran Radanović
6/7/2025
cs.LGcs.CR

No confident code implementation found for this paper.

Abstract

We study the corruption-robustness of in-context reinforcement learning (ICRL), focusing on the Decision-Pretrained Transformer (DPT, Lee et al., 2023). To address the challenge of reward poisoning attacks targeting the DPT, we propose a novel adversarial training framework, called Adversarially Trained Decision-Pretrained Transformer (AT-DPT). Our method simultaneously trains an attacker to minimize the true reward of the DPT by poisoning environment rewards, and a DPT model to infer optimal actions from the poisoned data. We evaluate the effectiveness of our approach against standard bandit algorithms, including robust baselines designed to handle reward contamination. Our results show that the proposed method significantly outperforms these baselines in bandit settings, under a learned attacker. We additionally evaluate AT-DPT on an adaptive attacker, and observe similar results. Furthermore, we extend our evaluation to the MDP setting, confirming that the robustness observed in bandit scenarios generalizes to more complex environments.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{sasnauskas2025incontext,
  title  = {Can In-Context Reinforcement Learning Recover From Reward Poisoning Attacks?},
  author = {Paulius Sasnauskas and Yiğit Yalın and Goran Radanović},
  year   = {2025},
  eprint = {2506.06891},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.06891v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2506.06891.svg)](https://codeofpaper.com/paper/2506.06891)

Discussion