The Linear Programming Approach to Approximate Dynamic Programming
TLDR
In this article, an efficient method based on linear programming for approximating solutions to large-scale stochastic control problems is proposed. But the approach is not suitable for large scale queueing networks.Abstract:
The curse of dimensionality gives rise to prohibitive computational requirements that render infeasible the exact solution of large-scale stochastic control problems. We study an efficient method based on linear programming for approximating solutions to such problems. The approach "fits" a linear combination of pre-selected basis functions to the dynamic programming cost-to-go function. We develop error bounds that offer performance guarantees and also guide the selection of both basis functions and "state-relevance weights" that influence quality of the approximation. Experimental results in the domain of queueing network control provide empirical support for the methodology.read more
Citations
More filters
Proceedings Article
TD(0) Leads to Better Policies than Approximate Value Iteration
TL;DR: This work considers approximate value iteration with a parameterized approximator in which the state space is partitioned and the optimal cost-to-go function over each partition is approximated by a constant.
Posted Content
Decomposition of large-scale stochastic optimal control problems
TL;DR: An Uzawa-based heuristic that is adapted to certain type of stochastic optimal control problems that can be divided into smallscale subsystems linked through a static almost sure coupling constraint at each time step is presented.
Journal ArticleDOI
Accelerated Point-Wise Maximum Approach to Approximate Dynamic Programming
TL;DR: In this article , an approximate dynamic programming (ADP) approach is proposed to compute lower bounds on the optimal value function for a discrete time, continuous space, and infinite horizon setting.
Proceedings ArticleDOI
Beyond Cumulative Returns via Reinforcement Learning over State-Action Occupancy Measures
TL;DR: In this article, the authors propose a new definition of risk, which they call caution, as a penalty function added to the dual objective of the linear programming (LP) formulation of reinforcement learning.
Journal ArticleDOI
Approximating Markov Chain Approach to Optimal Feedback Control of a Flexible Needle
TL;DR: This work presents a computationally efficient approach for the intra-operative update of the feedback control policy for the steerable needle in the presence of the motion uncertainty and compares the performance of the LP-based policy with the results obtained through more computationally demanding algorithm, iterative policy space approximation.
References
More filters
Book
Reinforcement Learning: An Introduction
TL;DR: This book provides a clear and simple account of the key ideas and algorithms of reinforcement learning, which ranges from the history of the field's intellectual foundations to the most recent developments and applications.
Book
Neural networks for pattern recognition
TL;DR: This is the first comprehensive treatment of feed-forward neural networks from the perspective of statistical pattern recognition, and is designed as a text, with over 100 exercises, to benefit anyone involved in the fields of neural computation and pattern recognition.
Book
Dynamic Programming and Optimal Control
TL;DR: The leading and most up-to-date textbook on the far-ranging algorithmic methododogy of Dynamic Programming, which can be used for optimal control, Markovian decision problems, planning and sequential decision making under uncertainty, and discrete/combinatorial optimization.
Journal ArticleDOI
Learning to Predict by the Methods of Temporal Differences
TL;DR: This article introduces a class of incremental learning procedures specialized for prediction – that is, for using past experience with an incompletely known system to predict its future behavior – and proves their convergence and optimality for special cases and relation to supervised-learning methods.
Book
Neuro-dynamic programming
TL;DR: This is the first textbook that fully explains the neuro-dynamic programming/reinforcement learning methodology, which is a recent breakthrough in the practical application of neural networks and dynamic programming to complex problems of planning, optimal decision making, and intelligent control.