In-Context Reinforcement Learning through Bayesian Fusion of Context and Value Prior
Not on the map. Why?
Abstract (arXiv)
In-context reinforcement learning (ICRL) promises fast adaptation to unseen environments without parameter updates, but current methods either cannot improve beyond the training distribution or require near-optimal data, limiting practical adoption. We introduce SPICE, a Bayesian ICRL method that learns a prior over Q-values via deep ensemble and updates this prior at test-time using in-context information through Bayesian updates. To recover from poor priors resulting from training on sub-optimal data, our online inference follows an Upper-Confidence Bound rule that favours exploration and adaptation. We prove that SPICE achieves regret-optimal behaviour in both stochastic bandits and finite-horizon MDPs, even when pretrained only on suboptimal trajectories. We validate these findings empirically across bandit and control benchmarks. SPICE achieves near-optimal decisions on unseen tasks, substantially reduces regret compared to prior ICRL and meta-RL approaches while rapidly adapting to unseen tasks and remaining robust under distribution shift.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 30 of its 49 references that are in the map. First posted on arXiv 6 Jan 2026.
Builds on
30 of 49 references.
References · 30
- 2017Attention Is All You Needcited by 59,932
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
- 2021Decision Transformer: Reinforcement Learning via Sequence Modelingcited by 1,528
- 2021Offline Reinforcement Learning with Implicit Q-Learningcited by 1,245
- 2019Advantage-Weighted Regression: Simple and Scalable Off-Policy Reinforcement Learningcited by 750
- 2020AWAC: Accelerating Online Reinforcement Learning with Offline Datasetscited by 647
- 2021Offline Reinforcement Learning as One Big Sequence Modeling Problemcited by 636
- 2016Deep Exploration via Bootstrapped DQNcited by 518
- 2017Minimax Regret Bounds for Reinforcement Learningcited by 500
- 2016RL2: Fast Reinforcement Learning via Slow Reinforcement Learningcited by 490
18 more
- 2020Bayesian Deep Learning and a Probabilistic Perspective of Generalizationcited by 480
- 2019Deep Ensembles: A Loss Landscape Perspectivecited by 438
- 2017A Tutorial on Thompson Samplingcited by 420
- 2019Efficient Off-Policy Meta-Reinforcement Learning via Probabilistic Context Variablescited by 372
- 2015Doubly Robust Off-policy Value Evaluation for Reinforcement Learningcited by 337
- 2016Data-Efficient Off-Policy Policy Evaluation for Reinforcement Learningcited by 285
- 2018Randomized Prior Functions for Deep Reinforcement Learningcited by 218
- 2022Multi-Game Decision Transformerscited by 212
- 2022Online Decision Transformercited by 194
- 2022In-context Reinforcement Learning with Algorithm Distillationcited by 186
- 2023Supervised Pretraining Can Learn In-Context Reinforcement Learningcited by 137
- 2022When does return-conditioned supervised learning work for offline reinforcement learning?cited by 73
- 2025A Survey of In-Context Reinforcement Learningcited by 35
- 2023On the Sublinear Regret of GP-UCBcited by 25
- 2022Hierarchical Decision Transformercited by 16
- 2024In-context Exploration-Exploitation for Reinforcement Learningcited by 16
- 2024UCB algorithms for multi-armed bandits: Precise regret and adaptive inferencecited by 16
- 2022Implicit Offline Reinforcement Learning via Supervised Learningcited by 3
Built on by
Not cited yet.