A posteriori error estimates for fully coupled McKean-Vlasov FBSDEs with jumps

We prove a two-sided a posteriori error estimate for numerical approximations of fully coupled McKean-Vlasov forward-backward SDEs with jumps under full-tuple law dependence. The coefficients may depend on the joint law of $(X,Y,Z,U)$, and we allow infinite jump activity. We construct a computable estimator ${\mathcal{E}_π}$ for the squared full-tuple error ${\mathcal{D}_π}$ relative to the exact Euler solution. The estimator uses the boundary and cumulative residuals of any admissible grid approximation. Under monotonicity and on sufficiently fine grids, $c\,{\mathcal{E}_π} \le {\mathcal{D}_π} \le C\,{\mathcal{E}_π}$. The efficiency bound holds without monotonicity or a mesh restriction. Analogous two-sided bounds hold for the continuous-time error up to a discretisation remainder that vanishes under coefficient time regularity. Closed-form and state-nonlinear benchmarks cover full-tuple law dependence, mark-dependent jump integrands, nonzero orthogonal martingales and infinite jump activity. In our experiments, the estimator tracks the discrete error during neural training and across Picard iterations. In a mean-field inventory model, we use the estimator and a computable discretisation term to bound the excess cost of the computed control over the discrete optimum.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.17087
Primary Topic
Stochastic processes and financial applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A posteriori error estimates for fully coupled McKean-Vlasov FBSDEs with jumps

Chunrong Feng, Christian Garry
arXiv (Cornell University)
Stochastic processes and financial applications
preprint

A posteriori error estimates for fully coupled McKean-Vlasov FBSDEs with jumps

Chunrong Feng, Christian Garry
preprint en

Abstract

We prove a two-sided a posteriori error estimate for numerical approximations of fully coupled McKean-Vlasov forward-backward SDEs with jumps under full-tuple law dependence. The coefficients may depend on the joint law of $(X,Y,Z,U)$, and we allow infinite jump activity. We construct a computable estimator ${\mathcal{E}_π}$ for the squared full-tuple error ${\mathcal{D}_π}$ relative to the exact Euler solution. The estimator uses the boundary and cumulative residuals of any admissible grid approximation. Under monotonicity and on sufficiently fine grids, $c\,{\mathcal{E}_π} \le {\mathcal{D}_π} \le C\,{\mathcal{E}_π}$. The efficiency bound holds without monotonicity or a mesh restriction. Analogous two-sided bounds hold for the continuous-time error up to a discretisation remainder that vanishes under coefficient time regularity. Closed-form and state-nonlinear benchmarks cover full-tuple law dependence, mark-dependent jump integrands, nonzero orthogonal martingales and infinite jump activity. In our experiments, the estimator tracks the discrete error during neural training and across Picard iterations. In a mean-field inventory model, we use the estimator and a computable discretisation term to bound the excess cost of the computed control over the discrete optimum.

arXiv (Cornell University)
Stochastic processes and financial applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon