CP2 uses geometric information to improve conformal prediction robustness.
problem CP fails under geometric data shifts, losing coverage guarantees.
method Integrates geometric pose information into CP via canonicalization.
result Integrating geometric information with CP ensures robustness under geometric shifts.
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 present a deformable generator model to disentangle the appearance and geometric information for both image and video data in a purely unsupervised manner. The appearance generator network models the information related to appearance, including color, illumination, identity or category, while the geometric generator…
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.
problem Formation of shock singularities in compressible fluid equations.
method Information geometric regularization of unidimensional pressureless Euler equations.
result Smooth global solutions without artificial viscosity.
This paper analyzes Barlow Twins' representation efficiency using information-geometric methods.
problem Understanding and comparing the efficiency of self-supervised learning methods.
method Introduces an information-geometric framework to quantify representation efficiency and applies it to Barlow Twins.
result Proves that Barlow Twins achieves optimal representation efficiency (η=1).
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.
The study extends stochastic block models to geometric settings, focusing on community detection and information flow.
problem Generalizing community detection and information flow models to geometric settings.
method Considered a geometric random graph over a homogeneous metric space, defined a geometric counterpart of flow of information on trees.
result Sufficient conditions for recovering locations and for percolation of information in geometric settings.
Geometric structure reveals optimal investment and hedging products.
problem Optimal design of investment and hedging products.
method Investigation of geometric structure in risks and returns using a simple formula.
result Duality between hedging and investment with geometric interpretation of rationality.
New method uses entropy dissipation to prove isoperimetric inequalities.
problem Proving isoperimetric inequalities in geometric settings.
method Information-theoretic approach based on entropy dissipation under heat flow.
result New proof of Euclidean isoperimetric inequality with sharp constant.
Information mapping is a popular application of Multivoxel Pattern Analysis (MVPA) to fMRI. Information maps are constructed using the so called searchlight method, where the spherical multivoxel neighborhood of every voxel (i.e., a searchlight) in the brain is evaluated for the presence of task-relevant response patte…
New geometric structures defined on SPD matrices for better understanding.
problem Understanding SPD matrices and their geometric properties.
method Introducing Finslerian and dual information-geometric structures on James' bicone domain.
result Geodesics correspond to straight lines in coordinate systems, and new dissimilarities generalize existing ones.
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.
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.
Second-order optimizers retain residual information after data deletion, affecting machine unlearning.
problem Residual information in second-order optimizers after data deletion.
method Comparison of first-order and second-order learners, eigendecomposition analysis.
result Second-order optimizers retain residual information, not detectable by first-order analysis.
Meta-learning performance is affected by how task diversity is allocated, not just overall variability.
problem Meta-learning performance degrades when task diversity is unevenly distributed.
method Decomposed task-specific regression effects into structurally informative and orthogonal components.
result Meta-learning prediction degrades when a larger fraction of task variability is orthogonal and non-informative.
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.
Introduces a new geometric method for optimal experimental design.
problem Restrictive invariance properties of traditional OED approaches based on probability densities.
method Mutual transport dependence (MTD) using optimal transport theory.
result Demonstrates high-quality designs and flexibility compared to standard methods.
The information bottleneck (IB) approach to clustering takes a joint distribution P(X,Y) and maps the data X to cluster labels T which retain maximal information about Y (Tishby et al., 1999). This objective results in an algorithm that clusters data points based upon the similarity of their condit…
Study explores geometric structure and prior for beta-logistic distribution.
problem Understanding the geometric structure and prior distributions of the beta-logistic distribution.
method Exploring dual geometric structure and uncovering α-parallel prior. result The beta-logistic distribution admits an α-parallel prior for any real number α. 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…
Introduces new info-geometric structure for dynamics on graphs and hypergraphs.
problem Modeling dynamics on discrete structures like graphs and hypergraphs.
method Introduces two dually flat structures: one on vertex space and another on edge space.
result Extends gradient flows to include nonequilibrium dynamics.
Unified geometric framework for quantum states using dual number algebras.
problem Representing quantum states in a geometrically unified way.
method Smooth embeddings into higher-order dual number algebras and algebraic flows.
result Established nilpotent dual algebras as a geometric landscape for quantum kinematics.
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.
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…
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…
Paper introduces a geometric approach to model similar probability distributions.
problem Incorporating similar probability distributions into graphical models.
method Information geometric approach to model similar distributions.
result Allows reinterpretation of existing models.
Geometric Variational Inference improves efficiency in complex probability distributions.
problem Efficiently accessing information in non-linear and high-dimensional probability distributions.
method Geometric Variational Inference (geoVI) uses Riemannian geometry and the Fisher information metric to construct a coordinate transformation.
result geoVI provides a more efficient variational approximation by a normal distribution, demonstrated on various problems.
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.
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 …
Proposes IIB for domain generalization, overcoming failure modes of IRM.
problem Domain generalization with nonlinear classifiers and pseudo-invariant features.
method Invariant Information Bottleneck (IIB) using mutual information and variational formulation.
result Significantly outperforms IRM on synthetic datasets and real-world benchmarks.
GSAN learns adaptive node representations using geometric scattering and attention.
problem Oversmoothing in node representation learning.
method Attention-based architecture integrating geometric scattering and GCN channels.
result GSAN outperforms previous networks in semi-supervised node classification.
The choice of constellations largely affects the performance of communication systems. When designing constellations, both the locations and probability of occurrence of the points can be optimized. These approaches are referred to as geometric and probabilistic shaping, respectively. Usually, the geometry of the const…
A lightweight framework improves convergence and stability of PINNs for complex PDEs.
problem Training instability and reduced accuracy in PINNs for complex PDEs.
method Adaptive curvature correction using secant information to optimize first-order optimizers.
result Consistent improvements in convergence speed, stability, and accuracy over standard optimizers.
Geometric methods solve sampling, optimisation, inference, and adaptive decision-making.
problem Efficient solutions for sampling, optimisation, inference, and adaptive decision-making.
method Derive algorithms exploiting geometric structures of Hamiltonian systems, Hilbertian subspaces, and information geometry.
result Wide range of geometric theories emerge in these fields, enabling efficient solutions.
Steerable E(3) Graph Neural Networks incorporate geometric and physical covariant information.
problem Incorporating covariant information like position, force, velocity, or spin in graph neural networks.
method Steerable E(3) Equivariant Graph Neural Networks (SEGNNs) that use steerable MLPs to incorporate geometric and physical covariant information.
result SEGNNs improve upon classic linear point convolutions and recent equivariant graph networks that send invariant messages.
This note summarizes in an informal way some geometric properties of Anosov representations into the symplectic group, which were presented in a talk at the conference What is Next. The mathematical legacy of Bill Thurston, held in June 2014 in Cornell.
Paper explores SNN for learning spectral geometric info from data.
problem Challenges in applying traditional eigensolvers to big data.
method Introduces Spectral Neural Networks (SNN) as an alternative.
result Investigates tradeoffs and optimization landscape of SNN.
InfoOT improves data alignment by maximizing mutual information.
problem Optimal transport's limitations in handling clusters, outliers, and new data.
method InfoOT extends optimal transport by maximizing mutual information while minimizing distances.
result InfoOT outperforms optimal transport in domain adaptation, cross-domain retrieval, and single-cell alignment.
The space of all probability measures having positive density function on a connected compact smooth manifold M, denoted by P(M), carries the Fisher information metric G. We define the geometric mean of probability measures by the aid of which we investigate information geometry of P(M), equ…
New method speeds up Bayesian inverse problem solving with neural operators.
problem Solving infinite-dimensional Bayesian inverse problems with high computational cost.
method Delayed-acceptance geometric MCMC driven by derivative-informed neural operator surrogates.
result Significant speedup in generating posterior samples (3-9 times faster).
New bounds for SGD generalize without mutual information terms.
problem Generalizing SGD's learning dynamics for heavy-tailed distributions.
method Introducing a geometric decoupling term and bounding it computably.
result Proved generalization bounds without mutual information terms.
Study geometric structures in transfer learning to avoid negative transfer.
problem Understanding information-theoretic limits of transfer learning without exploiting domain geometry.
method Integrates geometric structure into linear regression models, using Gram matrices of source and target domains.
result Proposes an interpolation estimator that matches minimax lower bound and outperforms existing methods.
A novel method compares 3D point clouds using information geometry.
problem Comparing 3D point clouds in machine learning applications.
method Interprets point clouds as probability density functions on a statistical manifold, using GMM and Modified Symmetric KL divergence.
result Demonstrates effectiveness through various case studies.
Enhances quantum circuit synthesis using deep learning and geometric methods.
problem Optimizing quantum circuits for time efficiency.
method Combining deep learning with geometric control techniques.
result Improved time-optimal control in quantum circuit synthesis.
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…
CuBAS selects informative data points based on curvature for better classification.
problem Lack of efficient sampling strategies for maximizing dataset informativeness.
method Information-geometric framework using curvature scores to select labeled data.
result Consistent and statistically significant improvements over random and uncertainty-based sampling.
GD-VAEs learn dynamics from observations using geometric and topological information.
problem Learning parsimonious representations of nonlinear dynamics from observations.
method Develops data-driven methods incorporating geometric and topological information using Variational Autoencoders (VAEs).
result GD-VAEs provide methods for learning reduced dimensional representations of nonlinear dynamics.