Error Propagation in Dynamic Programming: From Stochastic Control to Option Pricing

📅 2025-09-24
📈 Citations: 0
✨ Influential: 0
📄 PDF
🤖 AI Summary
This paper addresses error propagation in discrete-time stochastic optimal control under the dynamic programming (DP) framework, specifically analyzing how estimation errors accumulate and amplify during backward recursion. Method: We propose a natural decomposition of value function estimation errors, integrating kernel ridge regression in reproducing kernel Hilbert spaces with Monte Carlo simulation to rigorously characterize both per-step estimation errors and their backward propagation dynamics. Contribution/Results: We establish the first theoretical framework for error propagation analysis in DP, proving that accumulated error grows controllably with the number of backward steps. The method significantly improves accuracy and numerical stability in American option pricing—demonstrating robust convergence even in high-dimensional and non-Markovian settings. By unifying theoretical rigor with computational feasibility, our approach provides a novel paradigm for financial derivative pricing and policy optimization.

Technology Category

Reasoning under Uncertainty: Stochastic OptimizationSearch and Optimization: Mixed Discrete/Continuous SearchIntelligent Robots: State Estimation

Application Category

Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystemsGraph Algorithms and Modeling for the Web: Efficient manipulation of static and dynamic Web-related graphsResponsible Web: Human-perceived consequences of algorithmic deployment on the web
📝 Abstract
This paper investigates theoretical and methodological foundations for stochastic optimal control (SOC) in discrete time. We start formulating the control problem in a general dynamic programming framework, introducing the mathematical structure needed for a detailed convergence analysis. The associate value function is estimated through a sequence of approximations combining nonparametric regression methods and Monte Carlo subsampling. The regression step is performed within reproducing kernel Hilbert spaces (RKHSs), exploiting the classical KRR algorithm, while Monte Carlo sampling methods are introduced to estimate the continuation value. To assess the accuracy of our value function estimator, we propose a natural error decomposition and rigorously control the resulting error terms at each time step. We then analyze how this error propagates backward in time-from maturity to the initial stage-a relatively underexplored aspect of the SOC literature. Finally, we illustrate how our analysis naturally applies to a key financial application: the pricing of American options.
Problem

Research questions and friction points this paper is trying to address.

Analyzing error propagation in dynamic programming for stochastic control
Developing value function estimators using RKHS regression and Monte Carlo
Applying theoretical framework to American option pricing problems
Innovation

Methods, ideas, or system contributions that make the work stand out.

RKHS regression for value function approximation
Monte Carlo subsampling for continuation value estimation
Error propagation analysis from maturity backward
🔎 Similar Papers
No similar papers found.
💼 Related Jobs
No related jobs found.
EPFL - Swiss Finance Institute (SFI)
A
Andrea Della Vecchia
EPFL - Swiss Finance Institute (SFI), Lausanne, Switzerland
D
Damir Filipović
EPFL - Swiss Finance Institute (SFI), Lausanne, Switzerland