The paper investigates whether large language models (LLMs) can learn from rewards presented in context, a process termed in-context reinforcement learning (ICRL). Experiments across four benchmarks and six models show that while LLMs read reward signals, altering or removing these rewards has little impact on performance, and shuffled or corrupted trajectories are as effective as real ones. These findings suggest that direct ICRL behaves more like in-context learning (ICL) than true inference-time reinforcement learning.
By Minchan Kwon, Seunghee Koh, Sunghyun Baek, Minsung Bae, Junmo Kim
LLM agents increasingly improve at inference time by accumulating experience in context rather than by updating parameters. This process is often described as in-context reinforcement learning (ICRL)....
arXiv:2606. 19476v1 Announce Type: cross Abstract: Effective machine learning depends not only on how we model data, but also on what data we choose to collect.
By Eric Elmoznino, Sangnie Bhardwaj, Johannes von Oswald, Rajai Nasser, Blaise Ag\"uera y Arcas, Jo\~ao Sacramento, Rif A. Saurous, Guillaume Lajoie
arXiv:2607. 11906v1 Announce Type: new Abstract: The development of decision-pretrained transformers, algorithm distillation, long-context meta-RL, and retrieval-augmented agents has renewed interest in in-context reinforcement learning (ICRL): the ability of a pretrained or fine-tuned decision model to infer latent task rules and improve future behavior from interaction context, without test-time parameter updates.
By A Run, Ziluo Ding
Effective machine learning depends not only on how we model data, but also on what data we choose to collect. While large sequence models have revolutionized data modeling, the problem of automated data selection, or "intrinsic curiosity", remains a significant challenge.
The paper introduces Agentic In-Context Learning (Agentic ICL), a framework where fixed‑parameter Transformers learn from interactions that shape the context they receive. It models an interactive learner with state, update, and decision rules, covering active learning, bandits, and online reinforcement learning, and demonstrates that causal Transformers can approximate these algorithms over a finite horizon. Experiments show that Transformers can learn to execute recursions and that different reward signals produce distinct decision policies, with alignment between process supervision and outcome‑optimal actions influencing learned behavior.
By Shiguang Wu, Yaqing Wang, Quanming Yao