Skip to content
conftrace_
2011 NeurIPS NeurIPS 2011

Convergent Fitted Value Iteration with Linear Function Approximation

Fitted value iteration (FVI) with ordinary least squares regression is known to diverge. We present a new method, "Expansion-Constrained Ordinary Least Squares" (ECOLS), that produces a linear approximation but also guarantees convergence when used with FVI. To ensure convergence, we constrain the least squares regression operator to be a non-expansion in the infinity-norm. We show that the space of function approximators that satisfy this constraint is more rich than the space of "averagers," we prove a minimax property of the ECOLS residual error, and we give an efficient algorithm for computing the coefficients of ECOLS based on constraint generation. We illustrate the algorithmic convergence of FVI with ECOLS in a suite of experiments, and discuss its properties.

🌉 Interdisciplinary Bridge - Artificial Intelligence and Reinforcement Learning
📈 Trend Setter - Reinforcement Learning
🧭 Keyword Pioneer - convergence guarantee
🐣 Hot Topic Early Bird - convergence guarantee

More from NeurIPS 2011

All NeurIPS 2011 papers →