Approximating Itô Processes in Adapted Wasserstein Distance with Finite Support Laws

Motivated by finite-scenario surrogates in stopping and control problems, we study the approximation of Itô diffusion laws by laws supported on $M$ paths in an adapted Wasserstein distance, which we term adapted functional quantization. Under the strict adapted Wasserstein distance, no finite-support approximation can achieve vanishing error, while even under its relaxed counterpart, naive empirical measures still fail to converge. To resolve this, we develop a recursive conditional sampling algorithm and derive constructive upper bounds on the adapted quantization error. In one dimension, this yields the Brownian rate $(\log M)^{-1/2}$ for every diffusion with continuous coefficients of linear growth and pathwise uniqueness. In several dimensions, a quantitative Osgood stability condition with exponent $β$ yields the rate $(\log M)^{-η_p}$, where $η_p=\min\{1/2,β/(β+4p-2)\}$. Without the Osgood condition, we construct a two-dimensional diffusion with smooth bounded coefficients whose adapted quantization error decays more slowly than $(\log M)^{-γ}$ for any $γ>0$.

Authors

Publication Details

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

Approximating Itô Processes in Adapted Wasserstein Distance with Finite Support Laws

Xihao He, Fengyi Yuan
arXiv (Cornell University)
Stochastic processes and financial applications
preprint

Approximating Itô Processes in Adapted Wasserstein Distance with Finite Support Laws

Xihao He, Fengyi Yuan
preprint en

Abstract

Motivated by finite-scenario surrogates in stopping and control problems, we study the approximation of Itô diffusion laws by laws supported on $M$ paths in an adapted Wasserstein distance, which we term adapted functional quantization. Under the strict adapted Wasserstein distance, no finite-support approximation can achieve vanishing error, while even under its relaxed counterpart, naive empirical measures still fail to converge. To resolve this, we develop a recursive conditional sampling algorithm and derive constructive upper bounds on the adapted quantization error. In one dimension, this yields the Brownian rate $(\log M)^{-1/2}$ for every diffusion with continuous coefficients of linear growth and pathwise uniqueness. In several dimensions, a quantitative Osgood stability condition with exponent $β$ yields the rate $(\log M)^{-η_p}$, where $η_p=\min\{1/2,β/(β+4p-2)\}$. Without the Osgood condition, we construct a two-dimensional diffusion with smooth bounded coefficients whose adapted quantization error decays more slowly than $(\log M)^{-γ}$ for any $γ>0$.

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