Narrow Search
Last searches

Results for *

Displaying results 1 to 3 of 3.

  1. Exploiting symmetry in high-dimensional dynamic programming
    Published: June 2021
    Publisher:  CESifo, Center for Economic Studies & Ifo Institute, Munich, Germany

    We propose a new method for solving high-dimensional dynamic programming problems and recursive competitive equilibria with a large (but finite) number of heterogeneous agents using deep learning. The "curse of dimensionality" is avoided due to four... more

    Access:
    Verlag (kostenfrei)
    Verlag (kostenfrei)
    Resolving-System (kostenfrei)
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    DS 63
    No inter-library loan

     

    We propose a new method for solving high-dimensional dynamic programming problems and recursive competitive equilibria with a large (but finite) number of heterogeneous agents using deep learning. The "curse of dimensionality" is avoided due to four complementary techniques: (1) exploiting symmetry in the approximate law of motion and the value function; (2) constructing a concentration of measure to calculate high-dimensional expectations using a single Monte Carlo draw from the distribution of idiosyncratic shocks; (3) sampling methods to ensure the model fits along manifolds of interest; and (4) selecting the most generalizable over-parameterized deep learning approximation without calculating the stationary distribution or applying a transversality condition. As an application, we solve a global solution of a multi-firm version of the classic Lucas and Prescott (1971) model of "investment under uncertainty." First, we compare the solution against a linear-quadratic Gaussian version for validation and benchmarking. Next, we solve nonlinear versions with aggregate shocks. Finally, we describe how our approach applies to a large class of models in economics.

     

    Export to reference management software   RIS file
      BibTeX file
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Other identifier:
    hdl: 10419/236703
    Series: CESifo working paper ; no. 9161 (2021)
    Subjects: dynamic programming; deep learning; breaking the curse of dimensionality
    Scope: 1 Online-Ressource (circa 50 Seiten), Illustrationen
  2. Exploiting symmetry in high-dimensional dynamic programming
    Published: 23 June 2021
    Publisher:  Centre for Economic Policy Research, London

    Access:
    Verlag (lizenzpflichtig)
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    LZ 161
    No inter-library loan
    Universitätsbibliothek Mannheim
    No inter-library loan
    Export to reference management software   RIS file
      BibTeX file
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Series: Array ; DP16285
    Subjects: Machine Learning; Dynamic programming
    Scope: 1 Online-Ressource (circa 51 Seiten), Illustrationen
  3. Exploiting Symmetry in High-Dimensional Dynamic Programming
    Published: 2021
    Publisher:  National Bureau of Economic Research, Cambridge, Mass

    We propose a new method for solving high-dimensional dynamic programming problems and recursive competitive equilibria with a large (but finite) number of heterogeneous agents using deep learning. The "curse of dimensionality" is avoided due to four... more

    Access:
    Verlag (kostenfrei)
    Resolving-System (kostenfrei)
    Sächsische Landesbibliothek - Staats- und Universitätsbibliothek Dresden
    No inter-library loan
    Universitätsbibliothek Freiburg
    No inter-library loan
    Helmut-Schmidt-Universität, Universität der Bundeswehr Hamburg, Universitätsbibliothek
    No inter-library loan
    Staats- und Universitätsbibliothek Hamburg Carl von Ossietzky
    No inter-library loan
    Technische Informationsbibliothek (TIB) / Leibniz-Informationszentrum Technik und Naturwissenschaften und Universitätsbibliothek
    No inter-library loan
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    No inter-library loan

     

    We propose a new method for solving high-dimensional dynamic programming problems and recursive competitive equilibria with a large (but finite) number of heterogeneous agents using deep learning. The "curse of dimensionality" is avoided due to four complementary techniques: (1) exploiting symmetry in the approximate law of motion and the value function; (2) constructing a concentration of measure to calculate high-dimensional expectations using a single Monte Carlo draw from the distribution of idiosyncratic shocks; (3) sampling methods to ensure the model fits along manifolds of interest; and (4) selecting the most generalizable over-parameterized deep learning approximation without calculating the stationary distribution or applying a transversality condition. As an application, we solve a global solution of a multi-firm version of the classic Lucas and Prescott (1971) model of "investment under uncertainty." First, we compare the solution against a linear-quadratic Gaussian version for validation and benchmarking. Next, we solve nonlinear versions with aggregate shocks. Finally, we describe how our approach applies to a large class of models in economics

     

    Export to reference management software   RIS file
      BibTeX file
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Other identifier:
    Series: NBER working paper series ; no. w28981
    Subjects: Dynamische Optimierung; Monte-Carlo-Simulation; Theorie
    Scope: 1 Online-Ressource, illustrations (black and white)
    Notes:

    Hardcopy version available to institutional subscribers