Skip to yearly menu bar Skip to main content


Towards Minimax Optimal Reinforcement Learning in Factored Markov Decision Processes

Yi Tian · Jian Qian · Suvrit Sra

Poster Session 1 #501


We study minimax optimal reinforcement learning in episodic factored Markov decision processes (FMDPs), which are MDPs with conditionally independent transition components. Assuming the factorization is known, we propose two model-based algorithms. The first one achieves minimax optimal regret guarantees for a rich class of factored structures, while the second one enjoys better computational complexity with a slightly worse regret. A key new ingredient of our algorithms is the design of a bonus term to guide exploration. We complement our algorithms by presenting several structure dependent lower bounds on regret for FMDPs that reveal the difficulty hiding in the intricacy of the structures.

Chat is not available.