Value Function Iteration Without the Curse of Dimensionality
Richard Dennis
CAMA Working Papers from Centre for Applied Macroeconomic Analysis, Crawford School of Public Policy, The Australian National University
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)
JEL-codes: C61 C63 (search for similar items in EconPapers)
Pages: 40 pages
Date: 2026-02
References: Add references at CitEc
Citations:
Downloads: (external link)
https://crawford.anu.edu.au/sites/default/files/2026-02/12_2026_Dennis.pdf (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:een:camaaa:2026-12
Access Statistics for this paper
More papers in CAMA Working Papers from Centre for Applied Macroeconomic Analysis, Crawford School of Public Policy, The Australian National University Contact information at EDIRC.
Bibliographic data for series maintained by Cama Admin ().