Optimal transport with some directed distances
From MaRDI portal
Publication:2117952
DOI10.1007/978-3-030-80209-7_89zbMATH Open1490.49034arXiv2105.05989OpenAlexW3160936086MaRDI QIDQ2117952FDOQ2117952
Publication date: 22 March 2022
Abstract: We present a toolkit of directed distances between quantile functions. By employing this, we solve some new optimal transport (OT) problems which e.g. considerably flexibilize some prominent OTs expressed through Wasserstein distances.
Full work available at URL: https://arxiv.org/abs/2105.05989
Recommendations
- Quantum optimal transport is cheaper
- Optimal entropy-transport problems and a new Hellinger-Kantorovich distance between positive measures
- Unbalanced optimal transport: dynamic and Kantorovich formulations
- Chain Rule Optimal Transport
- Computational optimal transport. With applications to data sciences
Cites Work
- Inequalities: theory of majorization and its applications
- Computational Optimal Transport: With Applications to Data Science
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Optimal Transport
- Multivariate comonotonicity
- Mass transportation problems. Vol. 1: Theory. Vol. 2: Applications
- Comparison methods for stochastic models and risks
- Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems
- Title not available (Why is that?)
- On Bregman Distances and Divergences of Probability Measures
- Goodness-of-fit statistics for discrete multivariate data
- Theory of statistical inference and information. Transl. from the Slovak by the author
- A note on generalized inverses
- Title not available (Why is that?)
- Robust and efficient estimation by minimising a density power divergence
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Statistical Inference
- Information Theory and Statistics: A Tutorial
- Inequalities for distributions with given marginals
- Inequalities for E k(X, Y) when the marginals are fixed
- Markov Processes and the H-Theorem
- Statistical decision theory. Estimation, testing, and selection.
- On asymptotic properties of information-theoretic divergences
- Solution of a statistical optimization problem by rearrangement methods
- About distances of discrete distributions satisfying the data processing theorem of information theory
- Robust Statistical Engineering by Means of Scaled Bregman Distances
- 3D insights to some divergences for robust statistics and machine learning
- Minimization with respect to divergences and applications
- Robust estimation by means of scaled Bregman power distances. I: Non-homogeneous data
- Robust estimation by means of scaled Bregman power distances. II: Extreme values
- New Model Search for Nonlinear Recursive Models, Regressions and Autoregressions
- Title not available (Why is that?)
- A new toolkit for robust distributional change detection
- Some Universal Insights on Divergences for Statistics, Machine Learning and Artificial Intelligence
- Some Decision Procedures Based on Scaled Bregman Distance Surfaces
Cited In (1)
This page was built for publication: Optimal transport with some directed distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117952)