LGMLApr 3, 2018

Renewal Monte Carlo: Renewal theory based reinforcement learning

arXiv:1804.01116v113 citations
Originality Incremental advance
AI Analysis

This work addresses a specific bottleneck in reinforcement learning for researchers and practitioners, offering an incremental improvement over existing Monte Carlo methods.

The paper tackles the problem of high variance and delayed updates in Monte Carlo reinforcement learning for infinite horizon Markov decision processes by introducing Renewal Monte Carlo (RMC), which uses renewal theory to estimate performance gradients and converges to locally optimal policies, as demonstrated in numerical experiments on MDPs, event-triggered communication, and inventory management.

In this paper, we present an online reinforcement learning algorithm, called Renewal Monte Carlo (RMC), for infinite horizon Markov decision processes with a designated start state. RMC is a Monte Carlo algorithm and retains the advantages of Monte Carlo methods including low bias, simplicity, and ease of implementation while, at the same time, circumvents their key drawbacks of high variance and delayed (end of episode) updates. The key ideas behind RMC are as follows. First, under any reasonable policy, the reward process is ergodic. So, by renewal theory, the performance of a policy is equal to the ratio of expected discounted reward to the expected discounted time over a regenerative cycle. Second, by carefully examining the expression for performance gradient, we propose a stochastic approximation algorithm that only requires estimates of the expected discounted reward and discounted time over a regenerative cycle and their gradients. We propose two unbiased estimators for evaluating performance gradients---a likelihood ratio based estimator and a simultaneous perturbation based estimator---and show that for both estimators, RMC converges to a locally optimal policy. We generalize the RMC algorithm to post-decision state models and also present a variant that converges faster to an approximately optimal policy. We conclude by presenting numerical experiments on a randomly generated MDP, event-triggered communication, and inventory management.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes