Papers › Entropic Regularization of the Nested Distance
Entropic Regularization of the Nested Distance
Zheng Qu, Benoît Tran
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In 2012, Pflug and Pichler proved, under regularity assumptions, that the value function in Multistage Stochastic Programming (MSP) is Lipschitz continuous w.r.t. the Nested Distance, which is a distance between scenario trees (or discrete time stochastic processes with finite support). The Nested Distance is a refinement of the Wasserstein distance to account for proximity of the filtrations of discrete time stochastic processes. The computation of the Nested Distance between two scenario trees amounts to the computation of an exponential (in the horizon T) number of optimal transport problems between smaller conditional probabilities of size n, where n is less than maximal number of children of each node. Such optimal transport problems can be solved by the auction algorithm with complexity O(n³log(n)). In 2013, Cuturi introduced Sinkhorn's algorithm, an alternating projection scheme which solves an entropic regularized optimal transport problem. Sinkhorn's algorithm converges linearly and each iteration has a complexity of O(n²). In this article, we present and test numerically an entropic regularization of the Nested Distance.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections