NANAPRCPJun 23, 2016

Pathwise Iteration for Backward SDEs

arXiv:1605.07500h-index: 23
Originality Highly original
AI Analysis

This work provides a new algorithmic framework for solving BSDEs, which are important in quantitative finance and stochastic control, offering a way to obtain certified bounds on the solution.

The paper introduces a novel numerical method for solving backward stochastic differential equations (BSDEs) that computes and iteratively improves upper and lower bounds on the solution. The method is demonstrated in a high-dimensional financial application, showing improved accuracy over existing approaches.

We introduce a novel numerical approach for a class of stochastic dynamic programs which arise as discretizations of backward stochastic differential equations or semi-linear partial differential equations. Solving such dynamic programs numerically requires the approximation of nested conditional expectations, i.e., iterated integrals of previous approximations. Our approach allows us to compute and iteratively improve upper and lower bounds on the true solution starting from an arbitrary and possibly crude input approximation. We demonstrate the benefits of our approach in a high dimensional financial application.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes