Approximate Dynamic Programming By Minimizing Distributionally Robust Bounds

@article{Petrik2012ApproximateDP,
  title={Approximate Dynamic Programming By Minimizing Distributionally Robust Bounds},
  author={Marek Petrik},
  journal={CoRR},
  year={2012},
  volume={abs/1205.1782}
}

• Marek Petrik
• Published 2012 in ICML

Approximate dynamic programming is a popular method for solving large Markov decision processes. This paper describes a new class of approximate dynamic programming (ADP) methods— distributionally robust ADP—that address the curse of dimensionality by minimizing a pessimistic bound on the policy loss. This approach turns ADP into an optimization problem, for which we derive new mathematical program formulations and analyze its properties. DRADP improves on the theoretical guarantees of existing… CONTINUE READING

View on ArXiv

Add to Library

Create Alert

Cite