mlsanityData to 7 Oct 2026

Towards Minimax Optimal Reinforcement Learning in Factored Markov Decision Processes

arXiv 2006.13405 ↗First posted 24 Jun 2020cs.LG math.OC stat.MLcited by 13

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 24 Jun 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 5; 2022: 2; 2023: 4; 2024: 0; 2025: 2.

13 papers.

Sort: