Pith. sign in

REVIEW 1 cited by

A Machine Learning Algorithm for Finite-Horizon Stochastic Control Problems in Economics

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2411.08668 v2 pith:TTOIUXTQ submitted 2024-11-13 econ.GN math.OCq-fin.ECstat.ML

classification econ.GNmath.OCq-fin.ECstat.ML
keywords stochasticalgorithmcontrolfinite-horizonproblemslearningmachinemodel
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We propose a machine learning algorithm for solving finite-horizon stochastic control problems based on a deep neural network representation of the optimal policy functions. The algorithm has three features: (1) It can solve high-dimensional (e.g., over 100 dimensions) and finite-horizon time-inhomogeneous stochastic control problems. (2) It has a monotonicity of performance improvement in each iteration, leading to good convergence properties. (3) It does not rely on the Bellman equation. To demonstrate the efficiency of the algorithm, it is applied to solve various finite-horizon time-inhomogeneous problems including recursive utility optimization under a stochastic volatility model, a multi-sector stochastic growth, and optimal control under a dynamic stochastic integration of climate and economy model with eight-dimensional state vectors and 600 time periods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Simulation-Based Neural Policies for Portfolio Choice: Architecture, Training, and Interpretability

    math.OC 2026-08 conditional novelty 6.0 of 10

    In a controlled lifecycle benchmark, per-date backward neural policies beat single and two-regime networks on welfare and Bellman residuals, and a shape penalty fixes negative MPC violations.

Pith tools