Bayesian Optimal Control of Smoothly Parameterized Systems
UAI, (May 2015)Abstract
We study Bayesian optimal control of a general class of smoothly parameterized Markov decision problems (MDPs).
We propose a lazy version of the so-called posterior sampling method, a method that goes back to Thompson and Strens, more recently studied by Osband, Russo and van Roy.
While Osband et al. derived a bound on the (Bayesian) regret of this method for undiscounted total cost episodic, finite state and action problems,
we consider the continuing, average cost setting with no cardinality restrictions on the state or action spaces.
While in the episodic setting, it is natural to switch to a new policy at the episode-ends,
in the continuing average cost framework we must introduce switching points explicitly and in a principled fashion, or the regret could grow linearly.
Our lazy method introduces these switching points based on monitoring the uncertainty left about the unknown parameter. To develop a suitable and easy-to-compute uncertainty measure, we introduce a new ``average local smoothness'' condition, which is shown to be satisfied in common examples. Under this, and some additional mild conditions, we derive rate-optimal bounds on the regret of our algorithm.
Our general approach allows us to use a single algorithm and a single analysis for a wide range of problems, such as finite MDPs or linear quadratic regulation, both being instances of smoothly parameterized MDPs.
The effectiveness of our method is illustrated by means of a simulated example.