UMAP connects to Information Geometry principles.
problem None explicitly stated; focuses on connections.
method None explicitly stated; focuses on connections.
result UMAP has a natural geometric interpretation.
Symplectic and Poisson structures proved for information geometry's Frobenius manifold.
problem Connecting disconnected theories in information geometry.
method Proving symplectic and Poisson structures on the Frobenius manifold.
result Established a bridge between Vinberg, Souriau, and Koszul's theories.
Information geometry offers new tools for statistical analysis.
problem Statistical analysis of probability distributions.
method Geometric perspective on statistical manifolds.
result New applications in radar sensing, signal processing, etc.
Develops information geometry for Lévy processes in finance.
problem Understanding the statistical properties of Lévy processes for financial modeling.
method Deriving α-divergences from Lévy triplets, identifying Fisher information matrix and α-connection. result Identifies statistical implications and differential-geometric structures of Lévy processes.
Survey of linking information geometry and optimal transport.
problem Connecting two geometric frameworks for probability measures.
method Exploration of interactions and links between information geometry and optimal transport.
result Outstanding questions for both disciplines.
The paper explores geometry of probability measures and barycenter maps.
problem Understanding the space of probability measures and their barycenter.
method Information geometry, Fisher metric, dualistic structures, divergences, geodesics.
result Recent developments in the geometry of probability measures and barycenter.
Bi-forms extend contrast functions to handle torsion in information geometry.
problem Insufficient contrast-based approaches for geometric structures with torsion.
method Introducing contrast bi-forms, a generalization of contrast functions.
result Bi-forms provide a unified framework for statistical potentials.
In this survey, we describe the fundamental differential-geometric structures of information manifolds, state the fundamental theorem of information geometry, and illustrate some use cases of these information manifolds in information sciences. The exposition is self-contained by concisely introducing the necessary con…
We review basic notions in the field of information geometry such as Fisher metric on statistical manifold, α-connection and corresponding curvature following Amari's work . We show application of information geometry to asymptotic statistical inference.
Study information geometry of warped product spaces, finding special connections.
problem Understanding information geometry in warped product spaces.
method Examined warped products with dually flat connections, characterized connections on base space.
result Characterized connections on base space R>0 as α-connections with α=±1. The paper connects Bergman geometry with information geometry.
problem Exploring the Bergman geometry of complex domains.
method Introducing a mapping Φ and using Fisher information metrics.
result Established a new statistical curvature formula for the Bergman metric.
Warped product affects divergences in information geometry.
problem Warped product's impact on divergences in information geometry.
method Study of warped product on information geometry.
result Warped product does not preserve canonical divergences.
Cone structures in quantum field theory linked to information geometry.
problem Understanding geometric structures in quantum field theory.
method Analyzing invariant cones under modular automorphism groups and their relation to Wishart laws.
result Explicit connection between CAH cones and Wishart laws.
Study compares geometric approaches for shape and deformation statistics.
problem Characterizing statistical models of shapes and deformations.
method Information geometry and Wasserstein geometry.
result Wasserstein estimator is robust against waveform perturbation.
The paper uses geometric methods to classify medical data histograms.
problem Classifying medical data histograms for disease diagnosis.
method Information geometry of beta distributions for comparing and classifying histograms.
result Geometric tools, particularly negatively curved Fisher information, enable unique mean calculation and K-means classification.
The paper explores how AI systems use information geometry to encode semantic structure.
problem How AI systems encode semantic structure into geometric representation spaces.
method Focuses on softmax distributions and develops dual steering method for robust concept manipulation.
result Dual steering optimally modifies target concepts while minimizing off-target changes.
Researchers study the geometric properties of a specific type of stable processes.
problem Understanding the information geometry of tempered stable processes.
method Derivation of α-divergence, Fisher information matrices, and α-connections.
result Obtained Fisher information matrices and α-connections for statistical manifolds.
Dropout technique is analyzed using information geometry.
problem Understanding the regularization performance of dropout in neural networks.
method Unified analysis from information geometry viewpoint.
result Dropout flattens the model manifold and its performance depends on curvature.
A family of probability distributions parametrized by an open domain Λ in Rn defines the Fisher information matrix on this domain which is positive semi-definite. In information geometry the standard assumption has been that the Fisher information matrix tensor is positive definite defining in this way a Riemannia…
We review the information geometry of linear systems and its application to Bayesian inference, and the simplification available in the Kähler manifold case. We find conditions for the information geometry of linear systems to be Kähler, and the relation of the Kähler potential to information geometric quantities such …
VB uses natural gradients in information geometry.
problem Estimating or computing natural gradients in VB.
method Natural-gradient descent algorithm and Bayesian Learning Rule.
result Simplification of Bayes' rule and generalization of quadratic surrogates.
This paper proposes a new geometric framework for asset pricing.
problem The asymmetry between risk-neutral and physical measures in asset pricing.
method Information geometry, focusing on the relativity of probabilistic reference frames.
result Unified explanation for price fluctuations, event-driven behavior, and risk premia.
We prove the correspondence between the information geometry of a signal filter and a Kähler manifold. The information geometry of a minimum-phase linear system with a finite complex cepstrum norm is a Kähler manifold. The square of the complex cepstrum norm of the signal filter corresponds to the Kähler potential. The…
Proposes a new phylogenetic tree space with biologically principled geometry.
problem Developing a space for statistical analysis of phylogenies with biologically informed assumptions.
method Introduces wald space, a new phylogenetic tree space, and two related geometries based on Fisher information and Gaussian processes.
result Geodesics in wald space are similar to those in the Fisher information geometry, but the two geometries are distinct.
Optimal transport and information geometry both study geometric structures on spaces of probability distributions. Optimal transport characterizes the cost-minimizing movement from one distribution to another, while information geometry originates from coordinate-invariant properties of statistical inference. Their con…
Cosine schedule is optimal for discrete diffusion models.
problem Choosing the best discretization schedule for diffusion models.
method Optimized using Fisher-Rao geometry.
result Cosine schedule is Fisher-Rao optimal.
Geometric analysis on diffeomorphism groups for fluid dynamics and information geometry.
problem Geometric analysis of fluid flows and optimal mass transport.
method Review of metrics and topology on diffeomorphism groups.
result Introduction of new metrics and topology for diffeomorphism groups.
We formulate and prove an axiomatic characterization of conditional information geometry, for both the normalized and the nonnormalized cases. This characterization extends the axiomatic derivation of the Fisher geometry by Cencov and Campbell to the cone of positive conditional models, and as a special case to the man…
The paper explores how information geometry impacts classical CR inequalities.
problem Deriving and generalizing CR inequalities using information geometry.
method Examining Eguchi's theory and applying Amari-Nagoaka's theory to KL-divergence, and then extending to other divergences.
result Generalized CR inequalities derived from various divergences.
This paper solves the intractability barrier in non-parametric information geometry by introducing a novel framework.
problem The intractability barrier in non-parametric information geometry due to the Fisher-Rao metric being a functional.
method Introducing an Orthogonal Decomposition of the Tangent Space and deriving the Covariate Fisher Information Matrix (cFIM).
result Established a rigorous foundation for the G-entropy and provided fundamental limits of variance for semi-parametric estimators.
Researchers use information geometry to analyze and improve DRWs for node classification.
problem Lack of theoretical foundations for Discriminative Random Walks (DRWs).
method Revisit DRWs through information geometry, treating hitting-time laws as a statistical manifold. Derived closed-form expressions and introduced sensitivity scores.
result Introduced a sensitivity score that bounds maximal first-order change in DRW betweenness under unit Fisher perturbations.
The Fisher information metric is an important foundation of information geometry, wherein it allows us to approximate the local geometry of a probability distribution. Recurrent neural networks such as the Sequence-to-Sequence (Seq2Seq) networks that have lately been used to yield state-of-the-art performance on speech…
Introduces a new geometric framework for probability distributions.
problem Developing a geometric framework for probability distributions.
method Introduces ℓp-information geometry and defines the ℓ2-probability simplex via the q-root transform. result Defines a noncanonical differentiable structure and q-root map as an isometry. Novel geometry-informed irreversible perturbation accelerates Langevin dynamics convergence.
problem Accelerating convergence of Langevin dynamics for Bayesian computation.
method Geometry-informed irreversible perturbation of Riemannian manifold Langevin dynamics.
result Improves estimation performance over irreversible perturbations that ignore geometry.
Proper holomorphic isometries between Bergman domains are biholomorphisms.
problem Characterizing isometries between Bergman domains.
method New method from Information Geometry.
result Proper holomorphic local isometries are biholomorphisms.
GeoIB uses information geometry to control compression in deep learning models.
problem The indirect and biased nature of traditional IB implementations in deep learning.
method GeoIB uses Fisher-Rao and Jacobian-Frobenius terms to control information compression directly.
result GeoIB achieves better trade-off between accuracy and compression than traditional IB methods.
This paper solves the normalizability crisis in sequential inference by introducing bounded information geometry.
problem Structural failure in standard sequential inference architectures when dealing with extreme outliers.
method Non-parametric field actions and bounded information geometry to truncate infinite tails of spatial distributions.
result Empirical benchmarks across three domains show robust estimation without infinite-tailed distributional assumptions.
The article reviews how gradient flow systems on hypergraphs connect to information geometry and nonequilibrium physics.
problem Understanding the geometry of perturbed gradient flow systems on hypergraphs.
method Formulating modern nonequilibrium principles within the framework of perturbed gradient flow systems on hypergraphs.
result New concepts like moduli spaces and thermodynamical area are introduced to understand speed limits.
This paper autoformalizes Euclidean geometry using LLMs and theorem provers.
problem Challenges in formalizing Euclidean geometry due to reliance on diagrams.
method Combines neuro-symbolic framework, SMT solvers, and LLMs to fill in diagrammatic gaps.
result Demonstrates the capability and limitations of LLMs on autoformalizing geometry problems.
Novel approach uses quasi-conformal geometry for OSA classification from cephalometry.
problem Classifying obstructive sleep apnea (OSA) based on craniofacial profiles.
method Quasi-conformal geometry for local deformation analysis of 15 landmark points in lateral cephalograms.
result Proposed model achieves 92.5% testing accuracy.
A function is exponentially concave if its exponential is concave. We consider exponentially concave functions on the unit simplex. In a previous paper we showed that gradient maps of exponentially concave functions provide solutions to a Monge-Kantorovich optimal transport problem and give a better gradient approximat…
The space of probability densities is an infinite-dimensional Riemannian manifold, with Riemannian metrics in two flavors: Wasserstein and Fisher--Rao. The former is pivotal in optimal mass transport (OMT), whereas the latter occurs in information geometry---the differential geometric approach to statistics. The Rieman…
The Yukawa term in statistical mechanics quantifies information generation.
problem Understanding information generation in statistical mechanics.
method Defining a statistical product and Yukawa term to quantify information generation.
result The Yukawa term diverges in the quantum case, indicating Bose-Einstein condensation.
This paper proposes a geometry-aware active learning framework for spatiotemporal dynamic systems.
problem Challenges in modeling complex dynamic systems with 3D geometries and time evolution.
method Geometry-aware spatiotemporal Gaussian Process (G-ST-GP) and adaptive active learning strategy.
result The proposed framework outperforms traditional methods in predicting high-dimensional dynamic behaviors.
In a graph convolutional network, we assume that the graph G is generated wrt some observation noise. During learning, we make small random perturbations ΔG of the graph and try to improve generalization. Based on quantum information geometry, ΔG can be characterized by the eigendecomposition of the graph Laplaci…
We use the information metric to investigate the moduli space of a U(1) instanton on (anti)self-dual manifolds, finding an AdS geometry similar to that for the moduli space of a Yang-Mills instanton on flat space. We discuss our results from the perspective of gauge/gravity duality.
New method improves counterfactual distribution learning for high-dimensional outcomes.
problem Counterfactual distribution learning for high-dimensional outcomes with concentrated structure.
method Geometry-adaptive diffusion-guided smoothing estimators combining causal nuisance adjustment and local outcome geometry.
result Geometry-adaptive methods show steeper error decay in semi-synthetic experiments.
The Fisher-Rao geometry is applied to elliptical distributions for optimization and classification.
problem Optimizing and classifying covariance matrices using geometric tools.
method Riemannian optimization and intrinsic Cramér-Rao bounds.
result Geometric tools enhance covariance matrix estimation and classification.