Adenoviral-mediated wild-type p53 gene expression sensitizes colorectal cancer cells to ionizing radiation

Professiona

Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path

Gábor Lugosi, Hans-Ulrich Simon (Eds.): COLT 2006. 19th annual conference on learning theory. Pittsburgh, 2006. Berlin, Springer, 2006. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical work, we consider the case when the training data consists of a single sample path (trajectory) of some behaviour policy.In particular, we do not assume access to a generative model of the environment.The algorithm studied is fitted Q-iteration where in successive iterations the $Q$-functions of the intermediate policies are obtained by means of minimizing a novel Bellman-residual type error.PAC-style polynomial bounds are derived on the number of samples needed to guarantee near-optimal performancewhere the bound depends on the mixing rate of the trajectory, the smoothness properties of the underlying Markovian Decision Problem, the approximation power and capacity of the function set used

On Bayes inference for a bathtub failure rate via S-paths

10.1007/s10463-009-0253-1Annals of the Institute of Statistical Mathematics634827-850AISX