Computational methods for adapted optimal transport
From MaRDI portal
Publication:6126117
DOI10.1214/23-aap1975arXiv2203.05005MaRDI QIDQ6126117
Gudmund Pammer, Stephan Eckstein
Publication date: 9 April 2024
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.05005
algorithmstabilityregularizationentropic regularizationcausal optimal transportSinkhorn's algorithmadapted optimal transport
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- From the Schrödinger problem to the Monge-Kantorovich problem
- Adapted Wasserstein distances and stability in mathematical finance
- Weighted Csiszár-Kullback-Pinsker inequalities and applications to transportation inequalities
- Concentration inequalities and model selection. Ecole d'Eté de Probabilités de Saint-Flour XXXIII -- 2003.
- I-divergence geometry of probability distributions and minimization problems
- Convergence of the iterative proportional fitting procedure
- Estimating processes in adapted Wasserstein distance
- Stability of martingale optimal transport and weak optimal transport
- Instability of martingale optimal transport in dimension \(\mathrm{d}\ge 2\)
- The nested Sinkhorn divergence to learn the nested distance
- Smoothing operators in multi-marginal optimal transport
- All adapted topologies are equal
- Computational methods for martingale optimal transport problems
- A Distance For Multistage Stochastic Optimization Models
- Version-Independence and Nested Distributions in Multistage Stochastic Optimization
- Foundations of Modern Probability
- Causal Transport in Discrete Time and Applications
- Causal transport plans and their Monge–Kantorovich problems
- Cournot--Nash Equilibrium and Optimal Transport in a Dynamic Setting
- Quantitative Stability of Regularized Optimal Transport and Convergence of Sinkhorn's Algorithm
- On the Linear Convergence of the Multimarginal Sinkhorn Algorithm
- A generalization of a problem of Steinhaus
- Convergence of Entropic Schemes for Optimal Transport and Gradient Flows
- Robust risk aggregation with neural networks
- Optimal Transport
- Sensitivity of Multiperiod Optimization Problems with Respect to the Adapted Wasserstein Distance
- Dynamic Cournot-Nash equilibrium: the non-potential case
This page was built for publication: Computational methods for adapted optimal transport