Reinforcement Learning in Factored MDPs: Oracle-Efficient Algorithms and
Tighter Regret Bounds for the Non-Episodic Setting

v1v2 (latest)

Reinforcement Learning in Factored MDPs: Oracle-Efficient Algorithms and Tighter Regret Bounds for the Non-Episodic Setting

6 February 2020

ArXiv (abs)PDF HTML

Papers citing "Reinforcement Learning in Factored MDPs: Oracle-Efficient Algorithms and Tighter Regret Bounds for the Non-Episodic Setting"

5 / 5 papers shown

Title
Efficient Planning in Combinatorial Action Spaces with Applications to Cooperative Multi-Agent Reinforcement Learning Volodymyr Tkachuk Seyed Alireza Bakhtiari Johannes Kirschner Matej Jusup Ilija Bogunovic Csaba Szepesvári 108 5 0 08 Feb 2023
Polynomial Time Reinforcement Learning in Factored State MDPs with Linear Value Functions Zihao Deng Siddartha Devic Brendan Juba 77 3 0 12 Jul 2021
Exploratory Grasping: Asymptotically Optimal Algorithms for Grasping Challenging Polyhedral Objects Michael Danielczuk Ashwin Balakrishna Daniel S. Brown Shivin Devgon Ken Goldberg OffRL 118 18 0 11 Nov 2020
Improved Exploration in Factored Average-Reward MDPs M. S. Talebi Anders Jonsson Odalric-Ambrym Maillard 129 8 0 09 Sep 2020
Towards Minimax Optimal Reinforcement Learning in Factored Markov Decision Processes Yi Tian Jian Qian S. Sra 98 25 0 24 Jun 2020