On-line Learning in Tree MDPs by Treating Policies as Bandit Arms
arXiv:2605.04979v1 Announce Type: cross
Abstract: 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 trajectory. T-MDPs arise na…