Xianhua Peng, Wu Guo, Songyan Wang, Jianfei Zhu
arXiv 10 Jul 2026 · Finance — Computational
arXiv:2607.09461 · PDF · DOI · OpenAlex · Extracted main text
This paper proposes the certainty-equivalent first-order learning (CEFOL) algorithm, a deep learning algorithm for solving discrete-time dynamic programming problems with recursive utility. Dynamic programming with recursive utility is challenging because nonlinear certainty equivalent appears in the Bellman equation and the first-order optimality conditions but is difficult to evaluate. By introducing a separate neural network to represent the certainty equivalent, CEFOL enables the exploitation of the Bellman and model-specific first-order optimality conditions. In addition to certainty equivalent, CEFOL also uses neural networks to learn the value functions, policy functions, and Lagrange multipliers by using model-specific first-order conditions to construct residuals for minimization. By using first-order and KKT residuals to learn the policy, CEFOL directly accommodates general equality and inequality constraints on the controls, including occasionally binding constraints, without requiring penalty functions or problem-specific reformulations. We apply the algorithm to risk-sensitive and Epstein--Zin consumption-saving problems, a small-noise robust-control problem, and a DSGE model with recursive preferences and stochastic volatility. Across these applications, out-of-sample Bellman diagnostics and model-specific optimality residuals, including Euler or first-order residuals where applicable, are generally of order 1.0e-4 to 1.0e-3 over the relevant state regions, with larger values mainly near binding constraints, and the learned value and policy functions closely match VFI benchmarks when available. The CEFOL algorithm also works for dynamic programming problems with expected utility, as expected utility is a special case of recursive utility.
appendix boundary found by none_found · 100% of the source is main text. Read the extracted text to check this.
The works this paper leans on most, across its whole bibliography — not restricted to papers in our corpus. Ranked by composite intensity, which combines how often a work is mentioned, how many sections mention it, and how much of that falls in the main text rather than the appendix.
| Reference | Intensity | Mentions | Sections | Main text | |
|---|---|---|---|---|---|
| 1 | Maliar, Maliar \ Winant (2021) Deep learning for solving dynamic economic models., Journal of Monetary Economics 122: 76–101 | 1.000 | 6 | 3 | 100% |
| 2 | Epstein \ Zin (1989) Substitution, risk aversion, and the temporal behavior of consumption and asset returns: a theoretical framework, Econometrica 5… | 0.928 | 4 | 3 | 100% |
| 3 | Hansen \ Sargent (2013) Recursive Models of Dynamic Linear Economies, Princeton University Press | 0.737 | 3 | 2 | 100% |
| 4 | Caldara, Fernandez-Villaverde, Rubio-Ramirez \ Yao (2012) Computing dsge models with recursive preferences and stochastic volatility, Review of Economic Dynamics 15(2): 188–206 | 0.737 | 3 | 2 | 100% |
| 5 | Friedl, Kübler, Scheidegger \ Usui (2023) Deep uncertainty quantification: with an application to integrated assessment models, Technical report, Working Paper University… | 0.693 | 6 | 1 | 100% |
| 6 | Backus, Routledge \ Zin (2016) Recursive Preferences, Palgrave Macmillan UK, London | 0.644 | 2 | 2 | 100% |
| 7 | Weil (1990) Nonexpected utility in macroeconomics, The Quarterly Journal of Economics 105(1): 29–42 | 0.644 | 2 | 2 | 100% |
| 8 | Andreasen (2012) On the effects of rare disasters and uncertainty shocks for risk premia in non-linear dsge models, Review of Economic Dynamics 1… | 0.644 | 2 | 2 | 100% |
| 9 | Hansen \ Sargent (1995) Discounted linear exponential quadratic gaussian control, IEEE Transactions on Automatic control 40(5): 968–971 | 0.644 | 2 | 2 | 100% |
| 10 | Hansen \ Sargent (2008) Robustness, Princeton university press | 0.644 | 2 | 2 | 100% |
Showing the top 10 of 70 scored citations.