Computational methods for adapted optimal transport
From MaRDI portal
Abstract: Adapted optimal transport (AOT) problems are optimal transport problems for distributions of a time series where couplings are constrained to have a temporal causal structure. In this paper, we develop computational tools for solving AOT problems numerically. First, we show that AOT problems are stable with respect to perturbations in the marginals and thus arbitrary AOT problems can be approximated by sequences of linear programs. We further study entropic methods to solve AOT problems. We show that any entropically regularized AOT problem converges to the corresponding unregularized problem if the regularization parameter goes to zero. The proof is based on a novel method - even in the non-adapted case - to easily obtain smooth approximations of a given coupling with fixed marginals. Finally, we show tractability of the adapted version of Sinkhorn's algorithm. We give explicit solutions for the occurring projections and prove that the procedure converges to the optimizer of the entropic AOT problem.
Recommendations
Cites work
- A distance for multistage stochastic optimization models
- A generalization of a problem of Steinhaus
- Adapted Wasserstein distances and stability in mathematical finance
- All adapted topologies are equal
- Causal transport in discrete time and applications
- Causal transport plans and their Monge-Kantorovich problems
- Computational methods for martingale optimal transport problems
- Concentration inequalities and model selection. Ecole d'Eté de Probabilités de Saint-Flour XXXIII -- 2003.
- Convergence of entropic schemes for optimal transport and gradient flows
- Convergence of the iterative proportional fitting procedure
- Cournot-Nash equilibrium and optimal transport in a dynamic setting
- Dynamic Cournot-Nash equilibrium: the non-potential case
- Estimating processes in adapted Wasserstein distance
- Foundations of Modern Probability
- From the Schrödinger problem to the Monge-Kantorovich problem
- scientific article; zbMATH DE number 3951715 (Why is no real title available?)
- scientific article; zbMATH DE number 1324223 (Why is no real title available?)
- scientific article; zbMATH DE number 722611 (Why is no real title available?)
- scientific article; zbMATH DE number 1153603 (Why is no real title available?)
- scientific article; zbMATH DE number 7370595 (Why is no real title available?)
- I-divergence geometry of probability distributions and minimization problems
- Instability of martingale optimal transport in dimension \(\mathrm{d}\ge 2\)
- On the linear convergence of the multimarginal Sinkhorn algorithm
- Optimal Transport
- Quantitative stability of regularized optimal transport and convergence of Sinkhorn's algorithm
- Robust risk aggregation with neural networks
- Sensitivity of Multiperiod Optimization Problems with Respect to the Adapted Wasserstein Distance
- Smoothing operators in multi-marginal optimal transport
- Stability of martingale optimal transport and weak optimal transport
- The nested Sinkhorn divergence to learn the nested distance
- Version-independence and nested distributions in multistage stochastic optimization
- Weighted Csiszár-Kullback-Pinsker inequalities and applications to transportation inequalities
Cited in
(17)- Moment-SoS methods for optimal transport problems
- Estimation of stationary optimal transport plans
- The Wasserstein space of stochastic processes
- On a T₁ transport inequality for the adapted Wasserstein distance
- Multicausal transport: barycenters and dynamic matching
- An ordinary differential equation for entropic optimal transport and its linearly constrained variants
- Convergence of adapted smoothed empirical measures
- Entropic adapted Wasserstein distance on Gaussians
- Adapted Wasserstein distance between the laws of SDEs
- Fitted value iteration methods for bicausal optimal transport
- Quantitative fundamental theorem of asset pricing
- Adapted optimal transport between Gaussian processes in discrete time
- The McCormick martingale optimal transport
- Exponential convergence of general iterative proportional fitting procedures
- Duality of causal distributionally robust optimization
- A probabilistic view on the adapted Wasserstein distance
- Bicausal optimal transport for SDEs with irregular coefficients
This page was built for publication: Computational methods for adapted optimal transport
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6126117)
