Sample-Efficient Learning of POMDPs with Multiple Observations In Hindsight
Jiacheng Guo, Minshuo Chen, Huan Wang, Caiming Xiong, Mengdi Wang, Yu Bai
Abstract
This paper studies the sample-efficiency of learning in Partially Observable Markov Decision Processes (POMDPs), a challenging problem in reinforcement learning that is known to be exponentially hard in the worst-case. Motivated by real-world settings such as loading in game playing, we propose an enhanced feedback model called ``multiple observations in hindsight'', where after each episode of interaction with the POMDP, the learner may collect multiple additional observations emitted from the encountered latent states, but may not observe the latent states themselves. We show that sample-efficient learning under this feedback model is possible for two new subclasses of POMDPs: multi-observation revealing POMDPs and distinguishable POMDPs. Both subclasses generalize and substantially relax revealing POMDPs -- a widely studied subclass for which sample-efficient learning is possible under standard trajectory feedback. Notably, distinguishable POMDPs only require the emission distributions from different latent states to be different instead of linearly independent as required in revealing POMDPs.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext dc5d9f41-d5a1-4579-8b47-c771514cd42eCited by top-tier papers5
- Provable Partially Observable Reinforcement Learning with Privileged InformationYang Cai, Xiangyu Liu, Argyris Oikonomou, Kaiqing ZhangNeurIPS 2024 · 22 citations
- Reinforcement Learning Under Latent Dynamics: Toward Statistical and Algorithmic ModularityPhilip Amortila, Dylan J. Foster, Nan Jiang, Akshay Krishnamurthy et al.NeurIPS 2024 · 6 citations
- Learning to Explore in POMDPs with Informational RewardsAnnie Xie, Logan M. Bhamidipaty, Evan Zheran Liu, Joey Hong et al.ICML 2024 · 2 citations
- Provably Efficient Partially Observable Risk-sensitive Reinforcement Learning with Hindsight ObservationTonghe Zhang, Yu Chen, Longbo HuangICML 2024
- Statistical Tractability of Off-policy Evaluation of History-dependent Policies in POMDPsYuheng Zhang, Nan JiangICLR 2025
Builds on15
- Kinematic State Abstraction and Provably Efficient Rich-Observation Reinforcement LearningDipendra Misra, Mikael Henaff, Akshay Krishnamurthy, John LangfordICML 2020 · 158 citations
- RL for Latent MDPs: Regret Guarantees and a Lower BoundJeongyeol Kwon, Yonathan Efroni, Constantine Caramanis, Shie MannorNeurIPS 2021 · 91 citations
- Sample-Efficient Reinforcement Learning of Undercomplete POMDPsChi Jin, Sham M. Kakade, Akshay Krishnamurthy, Qinghua LiuNeurIPS 2020 · 88 citations
- Provably Efficient Reinforcement Learning in Partially Observable Dynamical SystemsMasatoshi Uehara, Ayush Sekhari, Jason D. Lee, Nathan Kallus et al.NeurIPS 2022 · 48 citations
- Provable Reinforcement Learning with a Short-Term MemoryYonathan Efroni, Chi Jin, Akshay Krishnamurthy, Sobhan MiryoosefiICML 2022 · 45 citations
Related papers
- Learning in POMDPs is Sample-Efficient with Hindsight ObservabilityJonathan Lee, Alekh Agarwal, Christoph Dann, Tong ZhangICML 2023 · 25 citations
- Provably Efficient Representation Learning with Tractable Planning in Low-Rank POMDPJiacheng Guo, Zihao Li, Huazheng Wang, Mengdi Wang et al.ICML 2023 · 8 citations
- Provable Representation with Efficient Planning for Partially Observable Reinforcement LearningHongming Zhang, Tongzheng Ren, Chenjun Xiao, Dale Schuurmans et al.ICML 2024 · 9 citations
- Lower Bounds for Learning in Revealing POMDPsFan Chen, Huan Wang, Caiming Xiong, Song Mei et al.ICML 2023 · 18 citations
- Sample-Efficient Reinforcement Learning of Partially Observable Markov GamesQinghua Liu, Csaba Szepesvári, Chi JinNeurIPS 2022 · 43 citations
