Random Policy Enables In-Context Reinforcement Learning within Trust Horizons
Not on the map. Why?
Abstract (arXiv)
Pretrained foundation models have exhibited extraordinary in-context learning performance, allowing zero-shot generalization to new tasks not encountered during pretraining. In the case of reinforcement learning (RL), in-context RL (ICRL) emerges when pretraining FMs on decision-making problems in an autoregressive-supervised manner. Nevertheless, current state-of-the-art ICRL algorithms, like Algorithm Distillation, Decision Pretrained Transformer and Decision Importance Transformer, impose stringent requirements on the pretraining dataset concerning the source policies, context information, and action labels. Notably, these algorithms either demand optimal policies or require varying degrees of well-trained behavior policies for all pretraining environments. This significantly hinders the application of ICRL to real-world scenarios, where acquiring optimal or well-trained policies for a substantial volume of real-world training environments can be intractable. To overcome this challenge, we introduce a novel approach, termed State-Action Distillation (SAD), that allows to generate an effective pretraining dataset guided solely by random policies. In particular, SAD selects query states and corresponding action labels by distilling outstanding state-action pairs from the entire state and action spaces by using random policies within a trust horizon, and then inherits the classical autoregressive-supervised mechanism during pretraining. To the best of our knowledge, this is the first work that enables effective ICRL under random policies and random contexts. We also establish quantitative analysis of the trustworthiness as well as the performance guarantees of SAD. Moreover, our empirical results across multiple popular ICRL benchmark environments demonstrate that, on average, SAD outperforms the best baseline by 236.3% in the offline evaluation and by 135.2% in the online evaluation.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 39 of its 47 references that are in the map. First posted on arXiv 25 Oct 2024.
Builds on
39 of 47 references.
References · 39
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2023InternVL: Scaling up Vision Foundation Models and Aligning for Generic Visual-Linguistic Taskscited by 2,534
- 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problemscited by 1,873
- 2020Conservative Q-Learning for Offline Reinforcement Learningcited by 1,777
- 2021Decision Transformer: Reinforcement Learning via Sequence Modelingcited by 1,528
- 2021Offline Reinforcement Learning with Implicit Q-Learningcited by 1,245
- 2021An Explanation of In-context Learning as Implicit Bayesian Inferencecited by 915
- 2021Florence: A New Foundation Model for Computer Visioncited by 802
- 2022A Generalist Agentcited by 802
- 2021Offline Reinforcement Learning as One Big Sequence Modeling Problemcited by 636
- 2017Minimax Regret Bounds for Reinforcement Learningcited by 500
- 2023Larger language models do in-context learning differentlycited by 386
27 more
- 2013(More) Efficient Reinforcement Learning via Posterior Samplingcited by 233
- 2023Transformers as Algorithms: Generalization and Stability in In-context Learningcited by 220
- 2022Multi-Game Decision Transformerscited by 212
- 2019VariBAD: A Very Good Method for Bayes-Adaptive Deep RL via Meta-Learningcited by 210
- 2022In-context Reinforcement Learning with Algorithm Distillationcited by 186
- 2022CREPE: Can Vision-Language Foundation Models Reason Compositionally?cited by 177
- 2021A Survey of Zero-shot Generalisation in Deep Reinforcement Learningcited by 164
- 2023Foundation Models for Decision Making: Problems, Methods, and Opportunitiescited by 160
- 2022Prompting Decision Transformer for Few-Shot Policy Generalizationcited by 143
- 2023Supervised Pretraining Can Learn In-Context Reinforcement Learningcited by 137
- 2023The Learnability of In-Context Learningcited by 126
- 2023Structured State Space Models for In-Context Reinforcement Learningcited by 109
- 2019Benchmarking Batch Deep Reinforcement Learning Algorithmscited by 108
- 2023Transformers as Decision Makers: Provable In-Context Reinforcement Learning via Supervised Pretrainingcited by 82
- 2019Model-free Reinforcement Learning in Infinite-horizon Average-reward Markov Decision Processescited by 81
- 2022NLX-GPT: A Model for Natural Language Explanations in Vision and Vision-Language Taskscited by 60
- 2022A Policy-Guided Imitation Approach for Offline Reinforcement Learningcited by 58
- 2018Hierarchical Reinforcement Learning for Zero-shot Generalization with Subtask Dependenciescited by 43
- 2023AMAGO: Scalable In-Context Reinforcement Learning for Adaptive Agentscited by 36
- 2023Beyond OOD State Actions: Supported Cross-Domain Offline Reinforcement Learningcited by 27
- 2023Emergence of In-Context Reinforcement Learning from Noise Distillationcited by 26
- 2023In-Context Reinforcement Learning for Variable Action Spacescited by 23
- 2024Transformers Can Learn Temporal Difference Methods for In-Context Reinforcement Learningcited by 22
- 2023Explore to Generalize in Zero-Shot RLcited by 20
- 2021Improving Zero-shot Generalization in Offline Reinforcement Learning using Generalized Similarity Functionscited by 17
- 2024Strategist: Self-improvement of LLM Decision Making via Bi-Level Tree Searchcited by 16
- 2024Provable Domain Adaptation for Offline Reinforcement Learning with Limited Samplescited by 5
Built on by
Citing papers per year: 2025: 1.
1 paper.