03/08/2020

Finite-Memory Near-Optimal Learning for Markov Decision Processes with Long-Run Average Reward

Jan Kretinsky, Fabian Michel, Lukas Michel, Guillermo Perez

Keywords:

Abstract Paper Similar Papers

Abstract: We consider learning policies online in Markov decision processes with the long-run average reward (a.k.a. mean payoff). To ensure implementability of the policies, we focus on policies with finite memory. Firstly, we show that near optimality can be achieved almost surely, using an unintuitive gadget we call forgetfulness. Secondly, we extend the approach to a setting with partial knowledge of the system topology, introducing two optimality measures and providing near-optimal algorithms also for these cases.

 0
 0
 0
 0
  Share    
This is an embedded video. Talk and the respective paper are published at UAI 2020 virtual conference. If you are one of the authors of the paper and want to manage your upload, see the question "My papertalk has been externally embedded..." in the FAQ section.

Comments

Post Comment
no comments yet
code of conduct: tbd Characters remaining: 140

Similar Papers

 0
 0
 0
 0
 17:07 
 0
 0
 0
 0
 2:57 
 0
 0
 0
 0
 15:18 
 0
 0
 0
 0
 14:13 
 0
 0
 0
 0
 15:44 
 0
 0
 0
 0
 10:41 
 0
 0
 0
 0
 5:09 
 0
 0
 0
 0
 5:20 
 0
 0
 0
 0
 3:09 
 0
 0
 0
 0
 13:11 
 0
 0
 0
 0
 15:31 
 0
 0
 0
 0
 17:04 
 0
 0
 0
 0
 14:18 
 0
 0
 0
 0
 13:49 
 0
 0
 0
 0
 11:20 
 0
 0
 0
 0
 5:35 
 0
 0
 0
 0
 5:09 
 0
 0
 0
 0
 2:57 
 0
 0
 0
 0
 3:24 
 0
 0
 0
 0
 13:10 
 0
 0
 0
 0
 13:24 
 0
 0
 0
 0
 10:52 
 0
 0
 0
 0
 2:42 
 0
 0
 0
 0
 12:49 
 0
 0
 0
 0
 14:50 
 0
 0
 0
 0
 15:04 
 0
 0
 0
 0
 3:06 
 0
 0
 0
 0
 15:04 
 0
 0
 0
 0
 10:34 
 0
 0
 0
 0
 5:03 
 0
 0
 0
 0
 10:43 
 0
 0
 0
 0
 3:11 
 0
 0
 0
 0
 11:58 
 0
 0
 0
 0
 3:11 
 0
 0
 0
 0
 19:42 
 0
 0
 0
 0
 10:54 
 0
 0
 0
 0
 5:08 
 0
 0
 0
 0
 2:52 
 0
 0
 0
 0
 12:46 
 0
 0
 0
 0
 3:10