English
Related papers

Related papers: Pseudo-Riemannian geometry embeds information geom…

200 papers

Optimal Transport (OT) has recently emerged as a powerful framework for learning minimal-displacement maps between distributions. The predominant approach involves a neural parametrization of the Monge formulation of OT, typically assuming…

Machine Learning · Computer Science 2024-07-23 Athina Sotiropoulou , David Alvarez-Melis

In this paper, we show how information geometry, the natural geometry of discrete probability distributions, can be used to derive the quantum formalism. The derivation rests upon three elementary features of quantum phenomena, namely…

Quantum Physics · Physics 2010-02-14 Philip Goyal

Exponential families and mixture families are parametric probability models that can be geometrically studied as smooth statistical manifolds with respect to any statistical divergence like the Kullback-Leibler (KL) divergence or the…

Machine Learning · Computer Science 2018-03-21 Frank Nielsen , Gaëtan Hadjeres

Inspired by the matching of supply to demand in logistical problems, the optimal transport (or Monge--Kantorovich) problem involves the matching of probability distributions defined over a geometric domain such as a surface or manifold. In…

Optimization and Control · Mathematics 2018-05-02 Justin Solomon

This paper explores the Bergman geometry of bounded domains $\Omega$ in $\mathbb{C}^n$ through the lens of information geometry by introducing a mapping $\Phi: \Omega \rightarrow \mathcal{P}(\Omega)$, where $\mathcal{P}(\Omega)$ denotes a…

Complex Variables · Mathematics 2026-04-22 Gunhee Cho , Jihun Yum

A projective geometry is an equivalence class of torsion free connections sharing the same unparametrised geodesics; this is a basic structure for understanding physical systems. Metric projective geometry is concerned with the interaction…

High Energy Physics - Theory · Physics 2016-01-20 A. R. Gover , E. Latini , A. Waldron

Optimal transport (OT) is a powerful tool for measuring the distance between two defined probability distributions. In this paper, we develop a new manifold named the coupling matrix manifold (CMM), where each point on CMM can be regarded…

Machine Learning · Computer Science 2019-11-26 Dai Shi , Junbin Gao , Xia Hong , S. T. Boris Choy , Zhiyong Wang

There has been much work in the recent past in developing the idea of quantum geometry to characterize and understand the structure of many-particle states. For mean-field states, the quantum geometry has been defined and analysed in terms…

Strongly Correlated Electrons · Physics 2019-06-03 S. R. Hassan , Ankita Chakrabarti , R. Shankar

We consider a system with a discrete configuration space. We show that the geometrical structures associated with such a system provide the tools necessary for a reconstruction of discrete quantum mechanics once dynamics is brought into the…

Mathematical Physics · Physics 2013-12-03 Marcel Reginatto , Michael J. W. Hall

We study the statistical geometry of random chords on n-dimensional spheres by deriving explicit analytical expressions for the chord length distribution and its associated structural properties. A critical threshold emerges at dimension…

Probability · Mathematics 2025-06-25 Masoud Ataei

In this paper we: 1) show how the smooth geometry of spaces of normal quantum states over W*-algebras (generalised spaces of density matrices) may be used to substantially enrich the description of quantum dynamics in the algebraic and path…

Quantum Physics · Physics 2016-06-14 Ryszard Paweł Kostecki

Wasserstein geometry and information geometry are two important structures introduced in a manifold of probability distributions. The former is defined by using the transportation cost between two distributions, so it reflects the metric…

Statistics Theory · Mathematics 2020-03-13 Shun-ichi Amari

We study Bregman divergences in probability density space embedded with the $L^2$-Wasserstein metric. Several properties and dualities of transport Bregman divergences are provided. In particular, we derive the transport Kullback-Leibler…

Information Theory · Computer Science 2025-04-08 Wuchen Li

We show that gamma distributions provide models for departures from randomness since every neighbourhood of an exponential distribution contains a neighbourhood of gamma distributions, using an information theoretic metric topology. We…

Differential Geometry · Mathematics 2007-05-23 Khadiga Arwini , C. T. J. Dodson

We study the general problem of Bayesian persuasion (optimal information design) with continuous actions and continuous state space in arbitrary dimensions. First, we show that with a finite signal space, the optimal information design is…

General Economics · Economics 2021-03-10 Semyon Malamud , Anna Cieslak , Andreas Schrimpf

This report concerns the problem of dimensionality reduction through information geometric methods on statistical manifolds. While there has been considerable work recently presented regarding dimensionality reduction for the purposes of…

Machine Learning · Statistics 2008-09-30 Kevin M. Carter , Raviv Raich , Alfred O. Hero

Optimal dimensionality reduction methods are proposed for the Bayesian inference of a Gaussian linear model with additive noise in presence of overabundant data. Three different optimal projections of the observations are proposed based on…

Statistics Theory · Mathematics 2018-02-13 Loïc Giraldi , Olivier P. Le Maître , Ibrahim Hoteit , Omar M. Knio

The optimal transport problem seeks to minimize the total transportation cost between two distributions, thus providing a measure of distance between them. In this work, we study the optimal transport of the eigenspectrum of one-dimensional…

Quantum Physics · Physics 2025-06-18 Mingtao Xu , Zongping Gong , Wei Yi

A new geometrically exact micro-structured model is constructed using a generalisation of the notion of Riemann-Cartan manifolds and fibre bundle theory of rank 3. This model is based around the concept of two different length scales: a…

Differential Geometry · Mathematics 2024-04-05 Mewen Crespo , Guy Casale , Loïc Le Marrec

Many numerical and learning algorithms rely on the solution of the Monge-Kantorovich problem and Wasserstein distances, which provide appropriate distributional metrics. While the natural approach is to treat the problem as an…

Optimization and Control · Mathematics 2025-12-11 Mohsen Sadr , Peyman Mohajerin Esfahani , Hossein Gorji