Optimal transport with some directed distances
From MaRDI portal
Publication:2117952
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.
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
- scientific article; zbMATH DE number 5014850 (Why is no real title available?)
- scientific article; zbMATH DE number 4072103 (Why is no real title available?)
- scientific article; zbMATH DE number 1909499 (Why is no real title available?)
- scientific article; zbMATH DE number 3322635 (Why is no real title available?)
- scientific article; zbMATH DE number 2221907 (Why is no real title available?)
- scientific article; zbMATH DE number 3200971 (Why is no real title available?)
- 3D insights to some divergences for robust statistics and machine learning
- A new toolkit for robust distributional change detection
- A note on generalized inverses
- About distances of discrete distributions satisfying the data processing theorem of information theory
- Comparison methods for stochastic models and risks
- Computational optimal transport. With applications to data sciences
- Goodness-of-fit statistics for discrete multivariate data
- Inequalities for E k(X, Y) when the marginals are fixed
- Inequalities for distributions with given marginals
- Inequalities: theory of majorization and its applications
- Information Theory and Statistics: A Tutorial
- Markov Processes and the H-Theorem
- Mass transportation problems. Vol. 1: Theory. Vol. 2: Applications
- Minimization with respect to divergences and applications
- Multivariate comonotonicity
- New model search for nonlinear recursive models, regressions and autoregressions
- On Bregman Distances and Divergences of Probability Measures
- On asymptotic properties of information-theoretic divergences
- Optimal Transport
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Robust Statistical Engineering by Means of Scaled Bregman Distances
- Robust and efficient estimation by minimising a density power divergence
- 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
- Solution of a statistical optimization problem by rearrangement methods
- Some decision procedures based on scaled Bregman distance surfaces
- Some universal insights on divergences for statistics, machine learning and artificial intelligence
- Statistical Inference
- Statistical decision theory. Estimation, testing, and selection.
- Theory of statistical inference and information. Transl. from the Slovak by the author
- Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems
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)