 Value Function Iteration without the Curse of DimensionalityWorking Papers from Business School - Economics, University of Glasgow Abstract: This paper presents a novel approach to solving dynamic programming problems using value function iteration based on the tensor train decomposition that is not subject to the curse of dimensionality. The tensor train decomposition approximates high-dimensional functions by expressing them as a series of interconnected cores, producing an approximation that separates by variables. This approach is well-suited for approximating and integrating a high-dimensional function such as a value function. I apply the method to a range of models and compare its performance against policy iteration and established sparse-grid techniques involving Smolyak and hyperbolic cross polynomials. For models with as few as four state variables, the tensor train method is shown to be faster and comparably accurate to leading sparse-grid alternatives. This paper introduces the first application of tensor trains to solve dynamic optimization problems in Economics, offering a powerful approach to solve high-dimensional macroeconomic models. Keywords: Value function iteration; tensor train decomposition; curse of dimensionality. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:gla:glaewp:2026_04 Access Statistics for this paper More papers in Working Papers from Business School - Economics, University of Glasgow Contact information at EDIRC. |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.