Pith. sign in

REVIEW 1 major objections 4 minor 2 cited by

The Wasserstein Space of Stochastic Processes in Continuous Time

T0 review · 1 major / 4 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read The paper establishes one canonical adapted weak topology for continuous-time stochastic processes, metrized by a relaxed adapted Wasserstein distance, and shows its completion is the space of all filtered processes modulo Hoover–Keisler…

desk verdict Important continuous-time unification, but the density proof behind the completion theorem has a real gap. read the letter →

arxiv 2501.14135 v1 pith:T3UAU3QL submitted 2025-01-23 math.PR math.OC

Daniel Bartl , Mathias Beiglböck , Gudmund Pammer , Stefan Schrott , Xin Zhang This is my paper · ORCID
classification math.PRmath.OC MSC 60B1060G0760G4060G4460F1749Q22
keywords adaptedweaktopologyWassersteindistancecausaltransportHoover–KeislerequivalenceoptimalstoppingDonsker'stheoremfilteredstochasticprocessescompletionof
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

On the space of laws of continuous-time processes with natural filtrations, the paper aims to establish that there is one canonical adapted weak topology, not several rival ones. It proves that the Aldous MZ topology, the Hoover–Keisler topology, Hellwig's information topology, and the optimal-stopping topology all coincide, and that this common topology is metrized by a relaxed adapted Wasserstein distance $\mathcal{AW}_p$. A second theorem identifies the completion of the incomplete space of naturally filtered processes: it is exactly the space $(\mathrm{FP}_p,\mathcal{AW}_p)$ of all filtered processes modulo Hoover–Keisler equivalence, which is Polish, has martingales as a closed subset, and supports Donsker-type and Euler-scheme approximations. The upshot for a general reader is a single language in which "the process and its flow of information converge" has one precise meaning, with optimal stopping values continuous whenever the limit has continuous paths.

What carries the argument

The load-bearing object is the relaxed adapted Wasserstein distance $\mathcal{AW}_p$, defined on filtered processes by infimizing $\mathbb{E}_\pi[d_{\mathcal{X}}^p(X,Y)]^{1/p}+\varepsilon$ over $\varepsilon$-bicausal couplings: couplings whose conditional-independence structure is causal in both directions up to a time shift of $\varepsilon$. The $\varepsilon$ relaxation is what turns the too-strong strict adapted Wasserstein distance into a genuine weak topology. The second pillar is the canonical Hoover–Keisler representative from the representation theory of filtered processes: every equivalence class has a canonical filtered process on a standard Borel space whose path map is continuous on its support, which yields compactness of $\varepsilon$-bicausal couplings, well-definedness of $\mathcal{AW}_p$ on equivalence classes, and ultimately completeness. Discretization arguments import the discrete-time adapted Wasserstein theory to bridge between continuous-time processes and finite-grid approximations.

What would settle it

Compute $\mathcal{AW}_1$ between the scaled random walk $B_n$ and Brownian motion $B$: the paper predicts a bound of order $\log(n)/n^{1/3}$ tending to zero, so any positive lower bound along a subsequence, or any pair of naturally filtered continuous processes converging in all four listed topologies but not in $\mathcal{AW}_p$, would falsify the main equivalence theorems.

Watch

Extended reading notes

Core claim

The central claim is Theorem 1.1 and Theorem 1.5: on continuous-time processes with natural filtrations, Aldous MZ, Hoover–Keisler, Hellwig, and optimal-stopping convergence agree with convergence in $\mathcal{AW}_p$; and $(\mathrm{FP}_p,\mathcal{AW}_p)$, the quotient of all filtered processes by $\mathcal{AW}_p$-equivalence, is the completion of the naturally filtered processes. The metric identifies exactly the Hoover–Keisler equivalence classes, so $\mathcal{AW}_p(X,Y)=0$ means the two processes carry the same probabilistic information in the strongest iterated-prediction sense. The paper also proves that the completed space is Polish, that martingales form a closed subset, and that scaled random walks and Euler schemes converge in $\mathcal{AW}_p$ to Brownian motion and SDE solutions.

Load-bearing premise

The proof assumes as given the Hoover–Keisler classification result that every stochastic process has a canonical representative on a standard Borel space whose path map is continuous on its support, and if that result failed the metric-completeness argument would collapse.

Editorial extensions

If this is right

  • All of the main convergence notions—Aldous MZ, Hoover–Keisler, Hellwig, and optimal stopping—define the same topology on continuous naturally filtered processes, so a convergence result proved in one framework transfers immediately to the others.
  • The completion of naturally filtered processes is exactly the space of all filtered processes modulo Hoover–Keisler equivalence, equipped with the complete Polish metric $\mathcal{AW}_p$; every sequence of natural-filtration models therefore has a limit in this larger space.
  • $\mathcal{AW}_p$-equivalence coincides with Hoover–Keisler equivalence, so functionals such as optimal stopping values are constant on equivalence classes and continuous along $\mathcal{AW}_p$-convergent sequences whenever the limit has continuous paths.
  • Martingales form a closed subset of $(\mathrm{FP}_p,\mathcal{AW}_p)$, hence limits of martingale approximations—random walks, Euler schemes, empirical processes—are automatically martingales in the limit.
  • Donsker's theorem and Euler approximations hold in the adapted weak sense with quantitative rates, such as $\mathcal{AW}_1(B,B_n)=O(\log n/n^{1/3})$ and $\mathcal{AW}_1(X,X^n)=O(\sqrt{\log n/n})$, making the discretization error in optimal stopping problems controllable.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Editorial extension: because $\mathcal{AW}_p$-convergence implies continuity of optimal stopping values for continuous limits, the Donsker and Euler results provide a ready-made stability guarantee for numerical schemes in robust finance, although the paper does not draw that financial conclusion.
  • Editorial extension: the completion theorem suggests that in model uncertainty, the closure of a class of models should be taken not by enriching path spaces but by allowing arbitrary filtrations while penalizing information gaps only up to $\varepsilon$ time shifts; one could test this interpretation by constructing insider-information models whose $\mathcal{AW}_p$-limits differ from their weak l
  • Editorial extension: Remark 3.4 notes alternative penalties such as $\sqrt{\varepsilon}$ for continuous martingales; one could check whether those penalties define the same topology with different quantitative rates, which would give a family of adapted metrics tailored to different classes of processes.
  • Editorial extension: since optimal-stopping continuity fails for discontinuous limits (Example D.1), a natural open problem is to characterize the largest class of payoff functions or limiting processes that restore continuity; the paper explicitly defers this question.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

1 major / 4 minor

Summary. The paper develops a continuous-time adapted Wasserstein distance AW_p on filtered processes, defined through relaxed (ε-)bicausal couplings, and claims that it metrizes a canonical adapted weak topology. The main theorems state that on naturally filtered continuous processes the Aldous MZ, Hoover–Keisler, Hellwig, and optimal stopping topologies coincide with the AW_p topology (Theorem 1.1); that the space FP_p of filtered processes modulo Hoover–Keisler equivalence is the AW_p-completion of the space of naturally filtered processes (Theorem 1.5); that AW_p is a complete metric inducing the Hoover–Keisler topology (Theorem 3.13); and that martingales are closed, optimal stopping values are continuous, Prohorov-type compactness holds, and Donsker and Euler approximation results extend to AW_p. The proofs rely substantially on the canonical representation theory of Beiglböck–Pammer–Schrott–Zhang and on discrete-time results of Bartl–Beiglböck–Pammer.

Significance. If the results are correct, the paper provides a unified and complete metric framework for adapted weak convergence of continuous-time stochastic processes, with zero-distance classes equal to Hoover–Keisler equivalence classes. This would be a substantial contribution to adapted transport theory, mathematical finance, and the theory of weak convergence of stochastic processes. The paper is also commendably explicit about where it relies on prior work: the canonical representation from [27] and the discrete-time density and metrization results from [18] are clearly cited, and the technically involved invariance of AW_p under canonical representatives is relegated to Appendix A. The distinction between the relaxed distance AW_p and the strict adapted Wasserstein distance is carefully discussed, including the failure of the strict version to satisfy Donsker-type approximation and separability. However, the density of naturally filtered processes, which is the load-bearing step for the completion theorem, is not established by the argument given in Proposition 5.6.

major comments (1)
  1. [Section 5, Proposition 5.6] The proof that the constructed continuous-time process Y is naturally filtered contains a false inequality. The text fixes i with ⌈s⌉_T = t_i and asserts 'As t > t_i' before the measurability argument; this is not true when s and t lie in the same grid interval. For example, with T = {1/2, 1}, s = 0.4, and t = 0.45, one has ⌈s⌉_T = 1/2 but t < 1/2. In that case F^Y_s = F^Z_{1/2} contains Z_{1/2}, while the piecewise constant path ι_T(Z) restricted to [0, t] does not determine Z_{1/2}; for D([0,1]; R^d), the definition of ι_T even sets Y_{t_i} = Z_{t_{i-1}} for t_i < 1. Taking Z_{1/2} = ±1 as a fair coin flip and Z_1 = Z_{1/2}, the prediction process pp_s(Y) is the Dirac measure at that coin flip, whereas the natural filtration of the same path law has trivial conditional information at s. Hence Y fails Lemma 5.2(ii), and Proposition 5.6 does not establish that NFP_p is dense in FP_p. Since Theorem 1.5, the completion statement, relies on this density, its proof is incomplete as written. A repair may exist—for instance by choosing F^Y_t = F^Z_{t_{i-1}} on each grid cell or by encoding grid values in the path—but the argument given in the manuscript is not valid.
minor comments (4)
  1. [Section 3.3] There is a typo: 'Proportion 3.19' should read 'Proposition 3.19'.
  2. [Section 5, Proposition 5.5] The proof of Proposition 5.5 is only a sketch, and its Gδ characterization of NFP is deferred to a cited remark in [27]. If this Polishness statement is part of the advertised results, the proof should either be completed in the text or explicitly marked as a consequence of [27].
  3. [Section 5, Proposition 5.6] The definition of ι_T for D([0,1]; R^d) makes Y left-continuous at grid points, while the filtration uses ⌈t⌉_T. A short remark explaining this choice and its consequences for the measurability of prediction processes would help prevent the kind of confusion that arises in the proof.
  4. [Section 3.1] In the proof of Proposition 3.10, the statement that e_T is not continuous for D([0,1]; R^d) is acknowledged, but the approximation argument still uses convergence of d_X(f, ι_T(e_T(f))) for every f; it would be useful to spell out why this convergence is uniform enough for the dominated convergence step in the D case.

Circularity Check

0 steps flagged · score 1.0 of 10

No construction-level circularity: the AW/HK equivalence and the completion theorem are not assumed as inputs, and the same-group citations [18,27] are prior theorems with independent content, though the density proof in Prop 5.6 has a likely gap that is a correctness issue rather than circularity.

full rationale

The paper's main claims are derived rather than assumed. AW_p is defined via eps-bicausal couplings, while the Hoover-Keisler topology is defined via iterated prediction processes; Theorem 3.13 proves their equivalence using the canonical representative theorem from [27] and the discrete-time adapted-Wasserstein results from [18]. These are prior published/archival theorems by overlapping authors, but their statements do not include the present continuous-time target results, so citing them is a legitimate dependency rather than a circular reduction. The completion theorem is built from Proposition 3.10 and Proposition 5.6, which reduce to the discrete-time theorem [18, Theorem 5.4]; the extension to continuous time is a nontrivial construction, not a restatement of the conclusion. No fitted parameter is renamed as a prediction, and no definition smuggles in the target equivalence. The skeptical note about Proposition 5.6 is a serious correctness concern: the sentence 'As t > ti' is false when s and t lie in the same grid cell, so the constructed Y may not be naturally filtered under the given argument. But an unsupported or erroneous proof step is a correctness gap, not circularity, because the density claim is not being assumed as an input to itself. Accordingly, the circularity score is low: 1 rather than 0 only because the central argument is heavily load-bearing on same-group prior work and the proof of one load-bearing lemma appears incomplete as written.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

There are no fitted constants or newly postulated objects. The paper relies on standard probabilistic assumptions, Lusin-space/topological machinery, and two prior theorems by the same group, [18] and [27]. These are external results, not free parameters of the present paper; any hidden failure there would propagate to the central claims.

assumptions (6)
  • domain assumption Filtrations satisfy the usual conditions, right-continuous and complete, and processes are adapted càdlàg.
    Definition 1.4 and Section 2.1; the entire theory is built for such filtered processes.
  • domain assumption The path space X is D([0,1];R^d) or C([0,1];R^d) with a complete metric d_X compatible with J1 or uniform topology, satisfying d_X(f,0) ≤ C‖f‖∞.
    Definition 3.3 and Remark 3.4; used to define AW_p and to control discretization costs.
  • standard math Iterated prediction processes are well-defined càdlàg processes with values in Lusin spaces under the Meyer-Zheng topology.
    Section 2.2 and Remark 2.1; the Prohorov-type compactness of Proposition 2.4 uses this machinery.
  • standard math The discrete-time space (FP_p, AW_p) is complete and naturally filtered discrete-time processes are dense, as established in [18, Theorem 5.4].
    Used in Propositions 3.10 and 5.6 to approximate continuous-time processes by finite-state or naturally filtered processes.
  • standard math Canonical representatives of Hoover-Keisler classes exist on M∞ with continuous path map on the support.
    Definition 2.7, Remark 2.9, Lemma 2.8, from [27]; used in Proposition 3.5 and Proposition 3.11.
  • domain assumption For the optimal stopping equivalence, the limit process X has PX-a.s. continuous paths and cost functions satisfy Assumption 4.2.
    Theorem 1.1(vii) and Proposition 4.3; Example D.1 shows the equivalence is false without path continuity.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The Wasserstein Space of Stochastic Processes in Continuous Time." pith.science (2026). https://pith.science/paper/T3UAU3QL

@misc{pith2026250114135,
  author       = {Pith},
  title        = {Pith review of: The Wasserstein Space of Stochastic Processes in Continuous Time},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/T3UAU3QL}},
  note         = {Machine review of arXiv:2501.14135}
}
abstract

Researchers from different areas have independently defined extensions of the usual weak convergence of laws of stochastic processes with the goal of adequately accounting for the flow of information. Natural approaches are convergence of the Aldous--Knight prediction process, Hellwig's information topology, convergence in adapted distribution in the sense of Hoover--Keisler and the weak topology induced by optimal stopping problems. The first main contribution of this article is that on continuous processes with natural filtrations there exists a canonical adapted weak topology which can be defined by all of these approaches; moreover, the adapted weak topology is metrized by a suitable adapted Wasserstein distance $\mathcal{AW}$. While the set of processes with natural filtrations is not complete, we establish that its completion consists precisely of the space ${\rm FP}$ of stochastic processes with general filtrations. We also show that $({\rm FP}, \mathcal{AW})$ exhibits several desirable properties. Specifically, it is Polish, martingales form a closed subset and approximation results such as Donsker's theorem extend to $\mathcal{AW}$.

Figures

Figures reproduced from arXiv: 2501.14135 by the authors.

Figure 1
Figure 1. P on the left and P ε on the right. It is evident that P and P ε in [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Adapted Wasserstein Barycenters of Gaussian Processes

    math.PR 2026-04 unverdicted novelty 7.0 of 10

    Adapted Wasserstein barycenters of Gaussian processes decompose into independent classical Bures–Wasserstein problems, but the claimed uniqueness fails for degenerate Gaussian inputs.

  2. A transfer principle for computing the adapted Wasserstein distance between stochastic processes

    math.PR 2025-05 reject novelty 6.0 of 10

    The adapted 2-Wasserstein distance between fractional Brownian motions equals the Hilbert-Schmidt distance between their Molchan-Golosov kernels, attained by the synchronous coupling.

Reference graph

Works this paper leans on

73 extracted references · 63 canonical work pages · cited by 2 Pith papers

  1. [18]

    Bartl, M

    D. Bartl, M. Beiglböck, and G. Pammer. The Wasserstein s pace of stochastic processes. J. Eur. Math. Soc. ,

    work page

  2. [27]

    Beiglböck, G

    M. Beiglböck, G. Pammer, S. Schrott, and X. Zhang. Repre senting general stochastic processes as martingale laws. ArXiv e-prints , 2023

    work page 2023

  3. [1]

    Acciaio, J

    B. Acciaio, J. Backhoff-Veraguas, and A. Zalashko. Causa l optimal transport and its links to enlargement of filtrations and continuous-time stochastic optimization. Stoch. Proc. Appl. , 130(5):2918–2953, 2020

    work page 2020

  4. [2]

    Acciaio, M

    B. Acciaio, M. Beiglböck, and G. Pammer. W eak transport f or non-convex costs and model-independence in a fixed-income market. Math. Finance , 31(4):1423–1453, 2021

    work page 2021

  5. [3]

    Convergence of Adapted Empirical Measures on $\mathbb{R}^{d}$

    B. Acciaio and S. Hou. Convergence of adapted empirical m easures. arXiv preprint arXiv:2211.10162 , 2022

    work page Pith review arXiv 2022

  6. [4]

    Acciaio, S

    B. Acciaio, S. Hou, and G. Pammer. Entropic adapted W asse rstein distance on Gaussians. arXiv preprint arXiv:2412.18794, 2024

    arXiv 2024

  7. [5]

    Acciaio, A

    B. Acciaio, A. Kratsios, and G. Pammer. Designing univer sal causal deep learning models: The geometric (hyper) transformer. Mathematical Finance, 2023

    work page 2023

  8. [6]

    Multicausal transport: barycenters and dynamic matching

    B. Acciaio, D. Kršek, and G. Pammer. Multicausal transpo rt: barycenters and dynamic matching. arXiv preprint arXiv:2401.12748, 2024

    work page Pith review arXiv 2024

Show all 73 references
  1. [7]

    Acciaio, M

    B. Acciaio, M. Munn, L. W enliang, and T. Xu. Cot-gan: Gene rating sequential data via causal optimal transport. In Advances in Neural Information Processing Systems , volume 33, pages 8798–8809, 2020

    2020

  2. [8]

    Akbari, L

    S. Akbari, L. Ganassali, and N. Kiyavash. Learning causa l graphs via monotone triangular transport maps. arXiv:2305.18210, 2023

    2023 arXiv

  3. [9]

    D. J. Aldous. W eak convergence and general theory of proc esses. Unpublished monograph: Department of Statistics, University of California, Berkeley, 1981

    1981

  4. [10]

    Ambrosio, N

    L. Ambrosio, N. Gigli, and G. Savaré. Gradient Flows in Metric Spaces and in the Space of Probabili ty Measures. Lectures in Mathematics ETH Zürich. Birkhäuser Verlag, Bas el, second edition, 2008. 44 D. BARTL, M. BEIGLBÖCK, G. PAMMER, S. SCHROTT, X. ZHANG

    2008

  5. [11]

    Backhoff-Veraguas, D

    J. Backhoff-Veraguas, D. Bartl, M. Beiglböck, and M. Ede r. Adapted Wasserstein distances and stability in mathematical finance. Finance Stoch., 24(3):601–632, 2020

    2020

  6. [12]

    Backhoff-Veraguas, D

    J. Backhoff-Veraguas, D. Bartl, M. Beiglböck, and M. Ede r. All adapted topologies are equal. Probab. Theory Relat. Fields , 178(3-4):1125–1172, 2020

    2020

  7. [13]

    Backhoff-Veraguas, D

    J. Backhoff-Veraguas, D. Bartl, M. Beiglböck, and J. Wie sel. Estimating processes in adapted Wasserstein distance. Ann. Appl. Probab. , 32(1):529–550, 2022

    2022

  8. [14]

    Backhoff-Veraguas, M

    J. Backhoff-Veraguas, M. Beiglböck, M. Huesmann, and S. Källblad. Martingale Benamou-Brenier: A proba- bilistic perspective. Ann. Probab., 48(5):2258–2289, 2020

    2020

  9. [15]

    Backhoff-Veraguas, M

    J. Backhoff-Veraguas, M. Beiglböck, Y. Lin, and A. Zalas hko. Causal transport in discrete time and applications. SIAM J. Optim. , 27(4):2528–2562, 2017

    2017

  10. [16]

    Backhoff-Veraguas, S

    J. Backhoff-Veraguas, S. Källblad, and B. A. Robinson. A dapted Wasserstein distance between the laws of SDEs. arXiv:2209.03243, 2024

    2024

  11. [17]

    Backhoff-Veraguas, G

    J. Backhoff-Veraguas, G. Loeper, and J. Obloj. Geometri c martingale benamou-brenier transport and geometric bass martingales. arXiv preprint , 2024

    2024

  12. [19]

    Bartl and J

    D. Bartl and J. Wiesel. Sensitivity of multiperiod opti mization problems with respect to the adapted wasserstein distance. SIAM J. Financ. Math. , 14(2):704–720, 2023

    2023

  13. [20]

    J. R. Baxter and R. V. Chacon. Compactness of stopping ti mes. Z. Wahrscheinlichkeitstheorie und Verw. Gebiete, 40(3):169–181, 1977

    1977

  14. [21]

    Bayraktar, L

    E. Bayraktar, L. Dolinskyi, and Y. Dolinsky. Extended w eak convergence and utility maximisation with propor- tional transaction costs. Finance Stoch., 24(4):1013–1034, 2020

    2020

  15. [22]

    Bayraktar and B

    E. Bayraktar and B. Han. Fitted value iteration methods for bicausal optimal transport. arXiv:2306.12658, 2023

    2023

  16. [23]

    Beiglböck, B

    M. Beiglböck, B. Jourdain, W. Margheriti, and G. Pammer . Approximation of martingale couplings on the line in the adapted weak topology. Probab. Theory Related Fields , 183(1-2):359–413, 2022

    2022

  17. [24]

    Beiglböck, B

    M. Beiglböck, B. Jourdain, W. Margheriti, and G. Pammer . Monotonicity and stability of the weak martingale optimal transport problem. Annals of Applied Probability, to appear , 2024

    2024

  18. [25]

    Beiglböck, G

    M. Beiglböck, G. Pammer, and A. Posch. The Knothe–Rosen blatt distance and its induced topology. arXiv:2312.16515, 2023

    2023 arXiv

  19. [26]

    Beiglböck, G

    M. Beiglböck, G. Pammer, and L. Riess. Change of numerai re for weak martingale transport. arXiv e-prints , 2024

    2024

  20. [28]

    Billingsley

    P. Billingsley. Convergence of Probability Measures . Wiley Series in Probability and Statistics: Probability a nd Statistics. John Wiley & Sons Inc., New York, second edition , 1999

    1999

  21. [29]

    Bion-Nadal and D

    J. Bion-Nadal and D. Talay. On a Wasserstein-type dista nce between solutions to stochastic differential equa- tions. Ann. Appl. Probab. , 29(3):1609–1639, 2019

    2019

  22. [30]

    Blanchet, M

    J. Blanchet, M. Larsson, J. Park, and J. Wiesel. Boundin g adapted wasserstein metrics. 2024

    2024

  23. [31]

    Blanchet, J

    J. Blanchet, J. Wiesel, E. Zhang, and Z. Zhang. Empirica l martingale projections via the adapted wasserstein distance. 2024

    2024

  24. [32]

    V. I. Bogachev. Measure theory, volume 2. Springer Science and Business Media, 2007

    2007

  25. [33]

    Bonnier, C

    P. Bonnier, C. Liu, and H. Oberhauser. Adapted topologi es and higher rank signatures. Ann. Appl. Probab. , 33(3):2136–2175, 2023

    2023

  26. [34]

    Cont and F

    R. Cont and F. R. Lim. Causal transport on path space. 202 4

  27. [35]

    Dolinsky

    Y. Dolinsky. Hedging of game options under model uncert ainty in discrete time. Electron. Commun. Probab. , 19:no. 19, 11, 2014

    2014

  28. [36]

    Eckstein and G

    S. Eckstein and G. Pammer. Computational methods for ad apted optimal transport. Ann. Appl. Probab. , 34(1A):675 – 713, 2024

    2024

  29. [37]

    M. Eder. Compactness in adapted weak topologies. arXiv:1905.00856, 2019

    1905 arXiv

  30. [38]

    H. Föllmer. Optimal couplings on Wiener space and an ext ension of Talagrand’s transport inequality. In Sto- chastic analysis, filtering, and stochastic optimization , pages 147–175. Springer, Cham, [2022] ©2022

    2022

  31. [39]

    Glanzer, G

    M. Glanzer, G. C. Pflug, and A. Pichler. Incorporating st atistical model error into the calculation of acceptabilit y prices of contingent claims. Math. Program., 174(1-2, Ser. B):499–524, 2019. THE W ASSERSTEIN SPACE OF STOCHASTIC PROCESSES IN CONTINUOU S TIME 45

    2019

  32. [40]

    Gunasingam and T.-K

    M. Gunasingam and T.-K. L. W ong. Adapted optimal transp ort between Gaussian processes in discrete time. arXiv:2404.06625, 2024

    2024 arXiv

  33. [41]

    M. F. Hellwig. Sequential decisions under uncertainty and the maximum theorem. J. Math. Econom. , 25(4):443– 464, 1996

    1996

  34. [42]

    D. Hoover. Convergence in distribution and Skorokhod c onvergence for the general theory of processes. Probab. Theory Relat. Fields , 89(3):239–259, 1991

    1991

  35. [43]

    D. N. Hoover and H. J. Keisler. Adapted probability dist ributions. Transactions of the American Mathematical Society, 286(1):159–201, 1984

    1984

  36. [44]

    Y. Jiang. Duality of causal distributionally robust op timization: The discrete-time case. (arXiv:2401.16556), Jan. 2024

    2024

  37. [45]

    Jiang and J

    Y. Jiang and J. Obłój. Sensitivity of causal distributi onally robust optimization. (arXiv:2408.17109), Aug. 202 4

    arXiv

  38. [46]

    Jourdain and G

    B. Jourdain and G. Pammer. An extension of martingale tr ansport and stability in robust finance. 2023

    2023

  39. [47]

    Kallenberg

    O. Kallenberg. Foundations of modern probability. Probability and its Applications (New York). Springer-Ve rlag, New York, 1997

    1997

  40. [48]

    Karandikar

    R. Karandikar. On almost sure convergence results in st ochastic calculus. In In memoriam Paul-André Meyer: Séminaire de Probabilités XXXIX , volume 1874 of Lecture Notes in Math. , pages 137–147. Springer, Berlin, 2006

    2006

  41. [49]

    Karatzas and S

    I. Karatzas and S. E. Shreve. Brownian Motion and Stochastic Calculus , volume 113 of Graduate Texts in Mathematics. Springer-Verlag, New York, second edition, 1991

    1991

  42. [50]

    A. S. Kechris. Classical descriptive set theory , volume 156 of Graduate Texts in Mathematics . Springer-Verlag, New York, 1995

    1995

  43. [51]

    K. B. Kirui, G. C. Pflug, and A. Pichler. New algorithms an d fast implementations to approximate stochastic processes. arXiv:2012.01185, 2020

    2012 arXiv

  44. [52]

    P. E. Kloeden and E. Platen. Numerical Solution of Stochastic Differential Equations . Springer Berlin Heidel- berg, Berlin, Heidelberg, 1992

    1992

  45. [53]

    F. B. Knight. On prediction processes. In Probability (Proc. Sympos. Pure Math., Vol. XXXI, Univ. Ill inois, Urbana, Ill., 1976) , volume Vol. XXXI of Proc. Sympos. Pure Math., pages 79–85. Amer. Math. Soc., Providence, RI, 1977

    1976

  46. [54]

    Komlós, P

    J. Komlós, P. Major, and G. Tusnády. An approximation of partial sums of independent R V’s, and the sample DF. II. Zeitschrift für Wahrscheinlichkeitstheorie und verwandt e Gebiete , 34:33–58, 1976

    1976

  47. [55]

    Kršek and G

    D. Kršek and G. Pammer. General duality and dual attainm ent for adapted transport. 2024

    2024

  48. [56]

    Lassalle

    R. Lassalle. Causal transference plans and their Monge –Kantorovich problems. Stoch. Anal. Appl. , 36(3):452– 484, 2018

    2018

  49. [57]

    P. A. Meyer and W. A. Zheng. Tightness criteria for laws o f semimartingales. Annales de l’I.H.P. Probabilités et statistiques , 20(4):353–372, 1984

    1984

  50. [58]

    Mirmominov and J

    R. Mirmominov and J. Wiesel. A dynamic programming prin ciple for multiperiod control problems with bicausal constraints. 2024

    2024

  51. [59]

    Nielsen and K

    F. Nielsen and K. Sun. Chain Rule Optimal Transport , pages 191–217. Springer International Publishing, Cham, 2021

    2021

  52. [60]

    G. Pammer. A note on the adapted weak topology in discret e time. Electron. Commun. Probab., 29:1 – 13, 2024

    2024

  53. [61]

    G. C. Pflug. Version-independence and nested distribut ions in multistage stochastic optimization. SIAM Journal on Optimization , 20(3):1406–1420, 2009

    2009

  54. [62]

    G. C. Pflug and A. Pichler. A distance for multistage stoc hastic optimization models. SIAM J. Optim. , 22(1):1– 23, 2012

    2012

  55. [63]

    G. C. Pflug and A. Pichler. Multistage Stochastic Optimization . Springer Series in Operations Research and Financial Engineering. Springer, Cham, 2014

    2014

  56. [64]

    G. C. Pflug and A. Pichler. From empirical observations t o tree models for stochastic optimization: convergence properties. SIAM J. Optim. , 26(3):1715–1740, 2016

    2016

  57. [65]

    Pichler and M

    A. Pichler and M. W einhardt. The nested Sinkhorn diverg ence to learn the nested distance. Comput. Manag. Sci. , pages 1–25, 2021

    2021

  58. [66]

    B. A. Robinson and M. Szölgyenyi. Bicausal optimal tran sport for SDEs with irregular coefficients. arXiv:2403.09941, 2024

    2024 arXiv

  59. [67]

    Sauldubois and N

    N. Sauldubois and N. Touzi. First order martingale mode l risk and semi-static hedging. 2024

    2024

  60. [68]

    M. Sion. On general minimax theorems. 1958. 46 D. BARTL, M. BEIGLBÖCK, G. PAMMER, S. SCHROTT, X. ZHANG

    1958

  61. [69]

    C. Villani. Optimal Transport, Old and New , volume 338 of Grundlehren der mathematischen Wissenschaften . Springer, 2009

    2009

  62. [70]

    W. Whitt. Stochastic-process limits: an introduction to stochastic-process limits and their application to queu es. Space, 500:391–426, 2002

    2002

  63. [71]

    J. Wiesel. Continuity of the martingale optimal transp ort problem on the real line. Ann. Appl. Probab., to appear, 2023

    2023

  64. [72]

    Xu and B

    T. Xu and B. Acciaio. Conditional COT-GAN for video pred iction with kernel smoothing. In NeurIPS 2022 Workshop on Robustness in Sequence Modeling , 2022

    2022

  65. [2024]

    arXiv:2104.14245

    To appear. arXiv:2104.14245

    arXiv

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.