1 paper
Andrey Zhitnikov, Ori Sztyglic, Vadim Indelman
Continuous POMDPs with general belief-dependent rewards are notoriously difficult to solve online. In this paper, we present a complete provable theory of adaptive multilevel simpl…