Constraint Relaxation in Approximate Linear Programs

Marek Petrik and Shlomo Zilberstein. Constraint Relaxation in Approximate Linear Programs. Proceedings of the Twenty-Sixth International Conference on Machine Learning (ICML), 809-816, Montreal, Canada, 2009.

Abstract

Approximate Linear Programming (ALP) is a reinforcement learning technique with nice theoretical properties, but it often performs poorly in practice. We identify some reasons for the poor quality of ALP solutions in problems where the approximation induces virtual loops. We then introduce two methods for improving solution quality. One method rolls out selected constraints of the ALP, guided by the dual information. The second method is a relaxation of the ALP, based on external penalty methods. The latter method is applicable in domains in which rolling out constraints is impractical. Both approaches show promising empirical results for simple benchmark problems as well as for a realistic blood inventory management problem.

Bibtex entry:

@inproceedings{PZicml09,
  author	= {Marek Petrik and Shlomo Zilberstein},
  title		= {Constraint Relaxation in Approximate Linear Programs},
  booktitle     = {Proceedings of the Twenty-Sixth International Conference on
                   Machine Learning},
  year		= {2009},
  pages		= {809-816},
  address       = {Montreal, Canada},
  url		= {http://rbr.cs.umass.edu/shlomo/papers/PZicml09.html}
}

shlomo@cs.umass.edu