On Connections between Constrained Optimization and Reinforcement Learning

Cited by: 0|Views2

Abstract:

Dynamic Programming (DP) provides standard algorithms to solve Markov Decision Processes. However, these algorithms generally do not optimize a scalar objective function. In this paper, we draw connections between DP and (constrained) convex optimization. Specifically, we show clear links in the algorithmic structure between three DP sc...More

Code:

Data:

Full Text
Bibtex
Your rating :
0

 

Tags
Comments