English
Related papers

Related papers: Fermionic optimal transport

200 papers

We study the Wasserstein natural gradient in parametric statistical models with continuous sample spaces. Our approach is to pull back the $L^2$-Wasserstein metric tensor in the probability density space to a parameter space, equipping the…

Optimization and Control · Mathematics 2024-08-20 Yifan Chen , Wuchen Li

The quantum Wasserstein distance (W-distance) is a fundamental metric for quantifying the distinguishability of quantum operations, with critical applications in quantum error correction. However, computing the W-distance remains…

Quantum Physics · Physics 2025-11-18 Changchun Feng , Xinyu Qiu , Laifa Tao , Lin Chen

We study the problem of quantifying how far an empirical distribution deviates from Gaussianity under the framework of optimal transport. By exploiting the cone geometry of the relative translation invariant quadratic Wasserstein space, we…

Machine Learning · Computer Science 2026-02-02 Binshuai Wang , Peng Wei

In this paper we deal with the analysis of the solutions of traffic flow models at multiple scales, both in the case of a single road and of road networks. We are especially interested in measuring the distance between traffic states (as…

Optimization and Control · Mathematics 2020-06-04 Emiliano Cristiani , Maria Cristina Saladino

The Bregman-Wasserstein divergence is the optimal transport cost when the underlying cost function is given by a Bregman divergence, and arises naturally in fields such as statistics and machine learning. We establish fundamental properties…

Probability · Mathematics 2025-04-14 Amanjit Singh Kainth , Cale Rankin , Ting-Kam Leonard Wong

This paper focuses on the Monge-Kantorovich formulation of the optimal transport problem and the associated $L^2$ Wasserstein distance. We use the $L^2$ Wasserstein distance in the Nearest Neighbour (NN) machine learning architecture to…

Computer Vision and Pattern Recognition · Computer Science 2019-03-20 Michael Snow , Jan Van lent

Optimal transport has recently proved to be a useful tool in various machine learning applications needing comparisons of probability measures. Among these, applications of distributionally robust optimization naturally involve Wasserstein…

Optimization and Control · Mathematics 2023-03-24 Waïss Azizian , Franck Iutzeler , Jérôme Malick

Let $(X_n)_{n=0}^\infty$ denote a Markov chain on a Polish space that has a stationary distribution $\varpi$. This article concerns upper bounds on the Wasserstein distance between the distribution of $X_n$ and $\varpi$. In particular, an…

Probability · Mathematics 2021-02-16 Qian Qin , James P. Hobert

We introduce a rigorous, physically appealing, and practical way to measure distances between exchange-only correlations of interacting many-electron systems, which works regardless of their size and inhomogeneity. We show that this…

Materials Science · Physics 2017-10-18 Simone Marocchi , Stefano Pittalis , Irene D'Amico

The strongly correlated fermions play a vital role in modern physics. For a given fermionic Hamiltonian system, the most widely used approach to explore the underlying physics is to study the wave function that incorporates Fermi-Dirac…

Strongly Correlated Electrons · Physics 2026-04-08 Jian-Gang Kong , Zhi Yuan Xie

Suppose we are given two metric spaces and a family of continuous transformations from one to the other. Given a probability distribution on each of these two spaces - namely the source and the target measures - the Wasserstein alignment…

Probability · Mathematics 2025-03-11 Soumik Pal , Bodhisattva Sen , Ting-Kam Leonard Wong

We present a noncommutative optimal transport framework for quantum channels acting on von Neumann algebras. Our central object is the Lipschitz cost measure, a transportation-inspired quantity that evaluates the minimal cost required to…

Operator Algebras · Mathematics 2025-06-05 Roy Araiza , Marius Junge , Peixue Wu

Optimal transport induces the Earth Mover's (Wasserstein) distance between probability distributions, a geometric divergence that is relevant to a wide range of problems. Over the last decade, two relaxations of optimal transport have been…

Optimization and Control · Mathematics 2023-01-18 Thibault Séjourné , Jean Feydy , François-Xavier Vialard , Alain Trouvé , Gabriel Peyré

We study the computational complexity of the optimal transport problem that evaluates the Wasserstein distance between the distributions of two K-dimensional discrete random vectors. The best known algorithms for this problem run in…

Optimization and Control · Mathematics 2022-10-17 Bahar Taşkesen , Soroosh Shafieezadeh-Abadeh , Daniel Kuhn , Karthik Natarajan

Optimal transportation distances are valuable for comparing and analyzing probability distributions, but larger-scale computational techniques for the theoretically favorable quadratic case are limited to smooth domains or regularized…

Other Computer Science · Computer Science 2016-03-23 Justin Solomon , Raif Rustamov , Leonidas Guibas , Adrian Butscher

Quantum Wasserstein divergences are modified versions of quantum Wasserstein distances defined by channels, and they are conjectured to be genuine metrics on quantum state spaces by De Palma and Trevisan. We prove triangle inequality for…

Mathematical Physics · Physics 2025-04-03 Gergely Bunth , József Pitrik , Tamás Titkos , Dániel Virosztek

We consider a discrete-time non-Hamiltonian dynamics of a quantum system consisting of a finite sample locally coupled to several bi-infinite reservoirs of fermions with a translation symmetry. In this setup, we compute the asymptotic…

Mathematical Physics · Physics 2022-09-21 Simon Andréys , Alain Joye , Renaud Raquépas

Transport properties are among the defining characteristics of many important phases in condensed matter physics. In the presence of strong correlations they are difficult to predict even for model systems like the Hubbard model. In real…

Word embeddings are high dimensional vector representations of words that capture their semantic similarity in the vector space. There exist several algorithms for learning such embeddings both for a single language as well as for several…

Computation and Language · Computer Science 2019-11-12 Georgios Balikas , Ioannis Partalas

We present new algorithms to compute the mean of a set of empirical probability measures under the optimal transport metric. This mean, known as the Wasserstein barycenter, is the measure that minimizes the sum of its Wasserstein distances…

Machine Learning · Statistics 2014-06-18 Marco Cuturi , Arnaud Doucet