paper-with-me

홈 › Papers

Learning How to Infer Partial MDPs for In-Context Adaptation and Exploration

2023-02-08 · Chentian Jiang, Nan Rosemary Ke, Hado van Hasselt

To generalize across tasks, an agent should acquire knowledge from past tasks that facilitate adaptation and exploration in future tasks. We focus on the problem of in-context adaptation and exploration, where an agent only relies on context, i.e., history of states, actions and/or rewards, rather than gradient-based updates. Posterior sampling (extension of Thompson sampling) is a promising approach, but it requires Bayesian inference and dynamic programming, which often involve unknowns (e.g., a prior) and costly computations. To address these difficulties, we use a transformer to learn an inference process from training tasks and consider a hypothesis space of partial models, represented as small Markov decision processes that are cheap for dynamic programming. In our version of the Symbolic Alchemy benchmark, our method's adaptation speed and exploration-exploitation balance approach those of an exact posterior sampling oracle. We also show that even though partial models exclude relevant information from the environment, they can nevertheless lead to good policies.

📄 PDF Abstract BibTeX arXiv:2302.04250

Code (0)

등록된 구현이 없습니다.

Tasks

Bayesian InferenceThompson Sampling

Methods 이 논문이 사용한 방법론

SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…

Similar Papers 제목 키워드 기반

RL in Latent MDPs is Tractable: Online Guarantees via Off-Policy Evaluation

2024-06-03 · Jeongyeol Kwon, Shie Mannor, Constantine Caramanis, Yonathan Efroni

In many real-world decision problems there is partially observed, hidden or latent information that remains fixed throughout an interaction. Such decision problems can be modeled as Latent Markov Decision Processes (LMDP…

LEMMAOff-policy evaluation

Sample-Efficient Reinforcement Learning of Undercomplete POMDPs

2020-06-22 · NeurIPS 2020 12 · Chi Jin, Sham M. Kakade, Akshay Krishnamurthy, Qinghua Liu

Partial observability is a common challenge in many reinforcement learning applications, which requires an agent to maintain memory, infer latent states, and integrate this past information into exploration. This challen…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Sequential Monte Carlo for Policy Optimization in Continuous POMDPs

2025-05-22 · Hany Abdulsamad, Sahel Iqbal, Simo Särkkä

Optimal decision-making under partial observability requires agents to balance reducing uncertainty (exploration) against pursuing immediate objectives (exploitation). In this paper, we introduce a novel policy optimizat…

Decision Making

In-Context Reinforcement Learning through Bayesian Fusion of Context and Value Prior

2026-01-06 · Anaïs Berkes, Vincent Taboga, Donna Vakalis, David Rolnick 외 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,…

Reinforcement Learning

Online Learning for Unknown Partially Observable MDPs

2021-02-25 · Mehdi Jafarnia-Jahromi, Rahul Jain, Ashutosh Nayyar

Solving Partially Observable Markov Decision Processes (POMDPs) is hard. Learning optimal controllers for POMDPs when the model is unknown is harder. Online learning of optimal controllers for unknown POMDPs, which requi…