Oracle-Efficient Regret Minimization in Factored MDPs with Unknown StructureDownload PDF

May 21, 2021 (edited Oct 08, 2021)NeurIPS 2021 PosterReaders: Everyone
  • Keywords: regret minimization, factored MDP, online learning, reinforcement learning theory, reinforcement learning, learning theory
  • TL;DR: Oracle-efficient regret minimization in factored MDPs with unknown structure and a new lower bound for the known structure case.
  • Abstract: We study regret minimization in non-episodic factored Markov decision processes (FMDPs), where all existing algorithms make the strong assumption that the factored structure of the FMDP is known to the learner in advance. In this paper, we provide the first algorithm that learns the structure of the FMDP while minimizing the regret. Our algorithm is based on the optimism in face of uncertainty principle, combined with a simple statistical method for structure learning, and can be implemented efficiently given oracle-access to an FMDP planner. Moreover, we give a variant of our algorithm that remains efficient even when the oracle is limited to non-factored actions, which is the case with almost all existing approximate planners. Finally, we leverage our techniques to prove a novel lower bound for the known structure case, closing the gap to the regret bound of Chen et al. [2021].
  • Supplementary Material: pdf
  • Code Of Conduct: I certify that all co-authors of this work have read and commit to adhering to the NeurIPS Statement on Ethics, Fairness, Inclusivity, and Code of Conduct.
  • Code:
10 Replies