Linear Programming for Large-Scale Markov Decision Problems

Abstract

We consider the problem of controlling a Markov decision process (MDP) with a large state space, so as to minimize average cost. Since it is intractable to compete with the optimal policy for large scale problems, we pursue the more modest goal of competing with a low-dimensional family of policies. We use the dual linear programming formulation of the MDP average cost problem, in which the variable is a stationary distribution over state-action pairs, and we consider a neighborhood of a low-dimensional subset of the set of stationary distributions (defined in terms of state-action features) as the comparison class. We propose two techniques, one based on stochastic convex optimization, and one based on constraint sampling. In both cases, we give bounds that show that the performance of our algorithms approaches the best achievable by any policy in the comparison class. Most importantly, these results depend on the size of the comparison class, but not on the size of the state space. Preliminary experiments show the effectiveness of the proposed algorithms in a queuing application.

27 pages, 3 figures

Cited by in corpus (9)

• Queueing Network Controls via Deep Reinforcement Learning
• Stochastic Primal-Dual Methods and Sample Complexity of Reinforcement Learning
• Scalable Bilinear $\pi$ Learning Using State and Action Features
• Efficient Planning in Large MDPs with Weak Linear Function Approximation
• A Linearly Relaxed Approximate Linear Program for Markov Decision Processes
• Optimal Gradient-based Algorithms for Non-concave Bandit Optimization
• Large Scale Markov Decision Processes with Changing Rewards
• On Sample Complexity of Projection-Free Primal-Dual Methods for Learning Mixture Policies in Markov Decision Processes
• Parameterized MDPs and Reinforcement Learning Problems -- A Maximum Entropy Principle Based Framework