On-line Learning in Tree MDPs by Treating Policies as Bandit Arms

Anvay Shah, Ramsundar Anandanarayanan, Sharayu Moharir +1

A Tree Markov Decision Problem (T-MDP) is a finite-horizon MDP with a starting state $s_1$, in which every state is reachable from $s_1$ through exactly one state-action trajec…