Robust Approximate Bilinear Programming for Value Function Approximation

Marek Petrik and Shlomo Zilberstein. Robust Approximate Bilinear Programming for Value Function Approximation. Journal of Machine Learning Research, 12:3027-3063, 2011.

Abstract

Value function approximation methods have been successfully used in many applications, but the prevailing techniques often lack useful a priori error bounds. We propose a new approximate bilinear programming formulation of value function approximation, which employs global optimization. The formulation provides strong a priori guarantees on both robust and expected policy loss by minimizing specific norms of the Bellman residual. Solving a bilinear program optimally is NP-hard, but this worst-case complexity is unavoidable because the Bellman-residual minimization itself is NP-hard. We describe and analyze the formulation as well as a simple approximate algorithm for solving bilinear programs. The analysis shows that this algorithm offers a convergent generalization of approximate policy iteration. We also briefly analyze the behavior of bilinear programming algorithms under incomplete samples. Finally, we demonstrate that the proposed approach can consistently minimize the Bellman residual on simple benchmark problems.

Bibtex entry:

@article{PZjmlr11,
  author	= {Marek Petrik and Shlomo Zilberstein},
  title		= {Robust Approximate Bilinear Programming for Value
                   Function Approximation},
  journal	= {Journal of Machine Learning Research},
  volume	= {12},
  number	= {},
  year		= {2011},
  pages		= {3027-3063},
  url		= {http://rbr.cs.umass.edu/shlomo/papers/PZjmlr11.html}
}

shlomo@cs.umass.edu