# An Integrated Transportation Distance Between Kernels and Approximate Dynamic Risk Evaluation in Markov Systems

arXiv: https://arxiv.org/abs/2311.06645 · HTML: https://mlsanity.com/paper/2311.06645/

## Key facts

- Cited by 9 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 11 Nov 2023.

## Built on by (most cited first, 9 of 9)

- [Spec-LLaVA: Accelerating Vision-Language Models with Dynamic Tree-Based Speculative Decoding](https://mlsanity.com/paper/2509.11961/) (2025)
- [How Early Is Early Enough? Design-Dependent Observation-Window Sufficiency in Subscription Churn Prediction](https://mlsanity.com/paper/2607.00473/) (2026)
- [Journey into Automation: Image-Derived Pavement Texture Extraction and Evaluation](https://mlsanity.com/paper/2501.02414/) (2025)
- [Comprehensive Overview of Artificial Intelligence Applications in Modern Industries](https://mlsanity.com/paper/2409.13059/) (2024)
- [Fast Dual Subgradient Optimization of the Integrated Transportation Distance Between Stochastic Kernels](https://mlsanity.com/paper/2312.01432/) (2023)
- [Leveraging Optimal Transport for Distributed Two-Sample Testing: An Integrated Transportation Distance-based Framework](https://mlsanity.com/paper/2506.16047/) (2025)
- [Federated Calculation of the Free-Support Transportation Barycenter by Single-Loop Dual Decomposition](https://mlsanity.com/paper/2507.19627/) (2025)
- [Measuring Time-Series Dataset Similarity using Wasserstein Distance](https://mlsanity.com/paper/2507.22189/) (2025)
- [TrafficKAN-GCN: Graph Convolutional-based Kolmogorov-Arnold Network for Traffic Flow Optimization](https://mlsanity.com/paper/2503.03276/) (2025)

## Abstract (arXiv)

We introduce a distance between kernels based on the Wasserstein distances between their values, study its properties, and prove that it is a metric on an appropriately defined space of kernels. We also relate it to various modes of convergence in the space of kernels. Then we consider the problem of approximating solutions to forward--backward systems, where the forward part is a Markov system described by a sequence of kernels, and the backward part calculates the values of a risk measure by operators that may be nonlinear with respect to the system's kernels. We propose to recursively approximate the forward system with the use of the integrated transportation distance between kernels and we estimate the error of the risk evaluation by the errors of individual kernel approximations. We illustrate the results on stopping problems and several well-known risk measures. Then we develop a particle-based numerical procedure, in which the approximate kernels have finite support sets. Finally, we illustrate the efficacy of the approach on the financial problem of pricing an American basket option.