New geometric structures defined on SPD matrices for better understanding.
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
Introduces new info-geometric structure for dynamics on graphs and hypergraphs.
Unified geometric framework for quantum states using dual number algebras.
On the probability simplex, we can consider the standard information geometric structure with the e- and m-affine connections mutually dual with respect to the Fisher metric. The geometry naturally defines submanifolds simultaneously autoparallel for the both affine connections, which we call {\em doubly autoparallel s…
A new method for faster optimization on statistical manifolds.
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…
This research smooths out fluid equations to avoid sudden shocks.
This paper analyzes Barlow Twins' representation efficiency using information-geometric methods.
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 …
Information Geometric Causal Inference (IGCI) is a new approach to distinguish between cause and effect for two variables. It is based on an independence assumption between input distribution and causal mechanism that can be phrased in terms of orthogonality in information space. We describe two intuitive reinterpretat…
Paper finds local normal forms for wavefronts in flat coordinates.
We examine the Banados-Teitelboim-Zanelli (BTZ) black hole in terms of the information geometry and consider what kind of quantum information produces the black hole metric in close connection with the anti-de Sitter space/conformal field theory (AdS/CFT) correspondence. We find a Hessian potential that exactly produce…
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 learning tasks such as classification, clustering, and visualization, these method…
Formulates mechanics for probability distributions on statistical manifold.
We study the geometry of probability distributions with respect to a generalized family of Csiszár -divergences. A member of this family is the relative -entropy which is also a Rényi analog of relative entropy in information theory and known as logarithmic or projective power divergence in statistics. We apply E…
FRESH combines patient-level and aggregate-level data for better clinical decision making.
The paper explores quantum statistical manifolds and their autoparallelity, providing estimation-theoretical characterizations.
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…
A family of replicator-like dynamics, called the escort replicator equation, is constructed using information-geometric concepts and generalized information entropies and diverenges from statistical thermodynamics. Lyapunov functions and escort generalizations of basic concepts and constructions in evolutionary game th…
This letter introduces an abstract learning problem called the "set embedding": The objective is to map sets into probability distributions so as to lose less information. We relate set union and intersection operations with corresponding interpolations of probability distributions. We also demonstrate a preliminary so…
Upper bound on CRN reaction rates derived using information geometry.
A novel method compares 3D point clouds using information geometry.
Adaptive sampling improves graph diffusion models by maintaining uniform information speed.
Information-Geometric Optimization (IGO) is a unified framework of stochastic algorithms for optimization problems. Given a family of probability distributions, IGO turns the original optimization problem into a new maximization problem on the parameter space of the probability distributions. IGO updates the parameter …
This report provides an in-depth overview over the implications and novelty Generalized Variational Inference (GVI) (Knoblauch et al., 2019) brings to Deep Gaussian Processes (DGPs) (Damianou & Lawrence, 2013). Specifically, robustness to model misspecification as well as principled alternatives for uncertainty quantif…
New divergence measures improve KL approximation.
The paper decomposes unsupervised learning's generalization error into model, data, and variance components.
Paper introduces a geometric approach to model similar probability distributions.
Paper explores duality in DPPs using embedding structure analysis.
New accelerators for EM improve convergence speed in complex mixture models.
CuBAS selects informative data points based on curvature for better classification.
We address the problem of Compressed Sensing (CS) with side information. Namely, when reconstructing a target CS signal, we assume access to a similar signal. This additional knowledge, the side information, is integrated into CS via L1-L1 and L1-L2 minimization. We then provide lower bounds on the number of measuremen…
We present a novel blind source separation (BSS) method, called information geometric blind source separation (IGBSS). Our formulation is based on the log-linear model equipped with a hierarchically structured sample space, which has theoretical guarantees to uniquely recover a set of source signals by minimizing the K…
Learning an encoding of feature vectors in terms of an over-complete dictionary or a information geometric (Fisher vectors) construct is wide-spread in statistical signal processing and computer vision. In content based information retrieval using deep-learning classifiers, such encodings are learnt on the flattened la…
This paper deals with estimating model parameters in graphical models. We reformulate it as an information geometric optimization problem and introduce a natural gradient descent strategy that incorporates additional meta parameters. We show that our approach is a strong alternative to the celebrated EM approach for le…
We explore the connection between two problems that have arisen independently in the signal processing and related fields: the estimation of the geometric mean of a set of symmetric positive definite (SPD) matrices and their approximate joint diagonalization (AJD). Today there is a considerable interest in estimating t…
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 derive also the information geometry of the 3-manifold of McKay bivariate gamma dist…
In this work, we study generalized entropies and information geometry in a group-theoretical framework. We explore the conditions that ensure the existence of some natural properties and at the same time of a group-theoretical structure for a large class of entropies. In addition, a method for defining new entropies, u…
In this paper, we derive a useful lower bound for the Kullback-Leibler divergence (KL-divergence) based on the Hammersley-Chapman-Robbins bound (HCRB). The HCRB states that the variance of an estimator is bounded from below by the Chi-square divergence and the expectation value of the estimator. By using the relation b…
Optimizes graph neural networks using natural gradient descent.
We present an extension of the ergodic, mixing, and Bernoulli levels of the ergodic hierarchy for statistical models on curved manifolds, making use of elements of the information geometry. This extension focuses on the notion of statistical independence between the microscopical variables of the system. Moreover, we e…
Information geometry offers new tools for statistical analysis.
Driven by a wide range of applications, many principal subspace estimation problems have been studied individually under different structural constraints. This paper presents a unified framework for the statistical analysis of a general structured principal subspace estimation problem which includes as special cases no…
The relative -entropy is the Rényi analog of relative entropy and arises prominently in information-theoretic problems. Recent information geometric investigations on this quantity have enabled the generalization of the Cramér-Rao inequality, which provides a lower bound for the variance of an estimator of an escort…
This paper develops basic setting for the dual Orlicz-Brunn-Minkowski theory for star bodies. An Orlicz -radial addition of two or more star bodies is proposed and related dual Orlicz-Brunn-Minkowski inequality is established. Based on a linear Orlicz -radial addition of two star bodies, we derive a f…
Dual spherical conchoidal motion has been defined by Yapar. In this work, we define this motion on a dual hyperbolic unit sphere in the dual Lorentzian space with dual signature, and the results carried to the Lorentzian lines space by means of the Study s mapping. We also obtain the study maps of the orbits drawn on t…
Study of curves in dual space with constant curvature and torsion.
The paper classifies curves in dual affine and Lorentz-Minkowski planes with constant curvature.