We propose a simple risk-adjusted linear approximation to solve a large class of dynamic models with time-varying and non-Gaussian risk. Our approach generalizes lognormal affine approximations commonly used in the macro-finance literature and can be seen as a first-order perturbation around the...

We propose a simple risk-adjusted linear approximation to solve a large class of dynamic models with time-varying and non-Gaussian risk. Our approach generalizes lognormal affine approximations commonly used in the macro-finance literature and can be seen as a first-order perturbation around the...

We construct the first algorithm for the perfect foresight solution of otherwise linear models with occasionally binding constraints, with fixed terminal conditions, that is guaranteed to return a solution in finite time, if one exists. We also provide a proof of the inescapability of the "curse...

Using big financial data for the price dynamics of U.S. equities, we investigate the impact that market microstructure noise has on modeling volatility of the returns. Based on wavelet transforms (DWT and MODWT) for decomposing the systematic pattern and noise, we propose a new wavelet-based...

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...

This paper introduces the MCTS algorithm to the financial world and focuses on solving significant multi-period financial planning models by combining a Monte Carlo Tree Search algorithm with a deep neural network. The MCTS provides an advanced start for the neural network so that the combined...

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...

This paper proposes a novel method of global optimization based on host-parasite co-evolution. It also develops a Fortran-77 code for the algorithm. The algorithm has been tested on 100 benchmark functions (of which the results of 32 relatively harder problems have been reported). In its search...