FLAMBE: Structural Complexity and Representation Learning of Low Rank MDPs
Alekh Agarwal, Sham M. Kakade, Akshay Krishnamurthy, Wen Sun
Abstract
In order to deal with the curse of dimensionality in reinforcement learning (RL), it is common practice to make parametric assumptions where values or policies are functions of some low dimensional feature space. This work focuses on the representation learning question: how can we learn such features? Under the assumption that the underlying (unknown) dynamics correspond to a low rank transition matrix, we show how the representation learning question is related to a particular non-linear matrix decomposition problem. Structurally, we make precise connections between these low rank MDPs and latent variable models, showing how they significantly generalize prior formulations for representation learning in RL. Algorithmically, we develop FLAMBE, which engages in exploration and representation learning for provably efficient RL in low rank transition models.
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 918ace06-7f81-43cf-a750-2dc42174a03fCited by top-tier papers140
- Bellman Eluder Dimension: New Rich Classes of RL Problems, and Sample-Efficient AlgorithmsChi Jin, Qinghua Liu, Sobhan MiryoosefiNeurIPS 2021 · 264 citations
- Doubly Regularized Markov Decision Processes for Robust Reinforcement LearningYiting He, Zhishuai Liu, Pan XuICML 2026 · 213 citations
- Pessimistic Model-based Offline Reinforcement Learning under Partial CoverageMasatoshi Uehara, Wen SunICLR 2022 · 176 citations
- Supervised Pretraining Can Learn In-Context Reinforcement LearningJonathan Lee, Annie Xie, Aldo Pacchiano, Yash Chandak et al.NeurIPS 2023 · 170 citations
- Representation Learning for Online and Offline RL in Low-rank MDPsMasatoshi Uehara, Xuezhou Zhang, Wen SunICLR 2022 · 138 citations
Builds on7
- CURL: Contrastive Unsupervised Representations for Reinforcement LearningMichael Laskin, Aravind Srinivas, Pieter AbbeelICML 2020 · 1,261 citations
- Provably Efficient Exploration in Policy OptimizationQi Cai, Zhuoran Yang, Chi Jin, Zhaoran WangICML 2020 · 304 citations
- Reward-Free Exploration for Reinforcement LearningChi Jin, Akshay Krishnamurthy, Max Simchowitz, Tiancheng YuICML 2020 · 226 citations
- Is a Good Representation Sufficient for Sample Efficient Reinforcement Learning?Simon S. Du, Sham M. Kakade, Ruosong Wang, Lin F. YangICLR 2020 · 213 citations
- Learning with Good Feature Representations in Bandits and in RL with a Generative ModelTor Lattimore, Csaba Szepesvári, Gellért WeiszICML 2020 · 181 citations
Related papers
- Efficient Model-Free Exploration in Low-Rank MDPsZakaria Mhammedi, Adam Block, Dylan J. Foster, Alexander RakhlinNeurIPS 2023 · 20 citations
- Reinforcement Learning in Feature Space: Matrix Bandit, Kernels, and Regret BoundLin Yang, Mengdi WangICML 2020 · 308 citations
- Extracting Latent State Representations with Linear Dynamics from Rich ObservationsAbraham Frandsen, Rong Ge, Holden LeeICML 2022 · 1 citation
- Reinforcement Learning in Low-rank MDPs with Density FeaturesAudrey Huang, Jinglin Chen, Nan JiangICML 2023 · 15 citations
- Efficient Reinforcement Learning in Block MDPs: A Model-free Representation Learning approachXuezhou Zhang, Yuda Song, Masatoshi Uehara, Mengdi Wang et al.ICML 2022 · 65 citations
