Research
On-device research index

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.

168,695 papers · 148 categories

Trend · papers per month

201402602803 · Jun 202019922001200920172026
48 results for bounded information geometry

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.

This work tightens generalization error bounds using Wasserstein distance.

problem Improving expected generalization error bounds in machine learning.
method Introduces bounds based on Wasserstein distance for various settings.
result New, tighter bounds based on relative entropy and other information measures.

Upper bound on CRN reaction rates derived using information geometry.

problem Challenging task of deriving an upper bound on reaction rates of nonlinear, discrete CRNs.
method Information geometric approach using natural gradient.
result Validated through numerical simulations, demonstrating faster convergence in specific CRNs.

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.

The paper generalizes Bayesian Cramér-Rao inequality using information geometry of relative α-entropy.

problem Establishing a lower bound for the variance of an unbiased estimator for the α-escort distribution.
method Proposes a general Riemannian metric based on relative α-entropy to derive a generalized Bayesian Cramér-Rao inequality.
result Establishes a lower bound for the variance of an unbiased estimator for the α-escort distribution.

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.

New information-theoretic bounds improve machine learning generalization.

problem Improving machine learning generalization beyond traditional complexity-based methods.
method Introducing bounds using Wasserstein distance and structured methods to incorporate geometry and individual data dependence.
result Established connections between different bounds and introduced new tighter bounds for various loss functions.

Study reveals limits of detecting local geometry in random graphs.

problem Detecting local geometry in random graphs with hidden communities.
method Introduced model and used information-theoretic and computational limits to investigate detection.
result Detection threshold determined at d=Θ~(k2k6/n3)d = \widetildeΘ(k^2 \vee k^6/n^3) for fixed pp.

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.

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.

In this paper we establish a gap theorem for the complex geometry of smoothly bounded convex domains which informally says that if the complex geometry near the boundary is close to the complex geometry of the unit ball, then the domain must be strongly pseudoconvex. One consequence of our general result is the followi…

2016-09-22abs ↗pdf ↗

New framework explains data augmentation's role in machine learning.

problem Understanding how data augmentation affects generalization and invariance learning.
method Information-theoretic framework based on mutual information bounds and orbit-averaged loss functions.
result Derives a new generalization bound decomposing the generalization gap into three interpretable terms.

Enhanced 3D shape analysis using information geometry.

problem Challenges in comparing 3D point clouds due to their unstructured nature and complex geometry.
method Information geometric framework for 3D point cloud shape analysis using Gaussian Mixture Models (GMMs) on a statistical manifold. Proposed MSKL divergence with upper and lower bounds.
result MSKL provides stable and monotonically varying values that directly reflect geometric variation, outperforming traditional distances and existing KL approximations.

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.

Develops information geometry for Lévy processes in finance.

problem Understanding the statistical properties of Lévy processes for financial modeling.
method Deriving α\alpha-divergences from Lévy triplets, identifying Fisher information matrix and α\alpha-connection.
result Identifies statistical implications and differential-geometric structures of Lévy processes.

Hyperbolic space outperforms Euclidean in learning hierarchical data.

problem Learning hierarchical data in Euclidean space requires exponentially many samples.
method Established geometric obstruction in Euclidean space and showed hyperbolic space's advantage.
result Hyperbolic space enables learning with O(mRlogm)O(mR \log m) samples, matching information-theoretic optimum.

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.

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…

2018-08-17abs ↗pdf ↗

GS-B3^3SE improves label shift estimation by smoothing priors on a graph.

problem Label shift adaptation when source and target distributions share conditional but not marginal probabilities.
method Graph-Smoothed Bayesian Black-Box Shift Estimator (GS-B3^3SE) places Laplacian-Gaussian priors on log-priors and confusion-matrix columns tied by a label-similarity graph.
result GS-B3^3SE produces a tractable posterior with HMC or Newton-CG schemes, proving identifiability, contraction, and robustness.

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.

2014-10-09abs ↗pdf ↗

Geometric approach to thermodynamics of chemical reaction networks.

problem Thermodynamics of chemical reaction networks with non-ideal behavior.
method Information geometry, Riemannian geometry, Cramer-Rao bound, absolute sensitivity.
result Absolute sensitivity is a projection operator onto the tangent bundle of the equilibrium manifold.

Information geometry applies concepts in differential geometry to probability and statistics and is especially useful for parameter estimation in exponential families where parameters are known to lie on a Riemannian manifold. Connections between the geometric properties of the induced manifold and statistical properti…

2013-10-29abs ↗pdf ↗

We consider globally hyperbolic flat spacetimes in 2+1 and 3+1 dimensions, in which a uniform light signal is emitted on the rr-level surface of the cosmological time for r0r\to 0. We show that the frequency of this signal, as perceived by a fixed observer, is a well-defined, bounded function which is generally not co…

2013-02-27abs ↗pdf ↗

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\mathbb{R}_{>0} as αα-connections with α=±1α= \pm{1}.

This work proves generalization bounds for neural networks without Lipschitz assumptions.

problem Proving generalization guarantees for neural networks without Lipschitz continuity.
method Introduces a data-dependent fractal dimension and uses it to prove generalization bounds.
result Generalization bounds are proven without requiring Lipschitz continuity.

New bounds derived for machine learning algorithms using convex functions.

problem Bounding generalization error in machine learning.
method Using strongly convex functions and subgaussian loss tails, derived new generalization bounds.
result Generalization bounds can be derived using any strongly convex function of the joint input-output distribution.

Optimizes quadratic bandits with tight Hessian-dependent sample complexity bounds.

problem Understanding optimal sample complexity for quadratic functions.
method Introduces energy allocation and optimal energy spectrum to prove tight lower bounds. Solves for Hessian-independent optimal algorithm.
result Proves optimal Hessian-dependent sample complexities and existence of a universally optimal algorithm.

We study the relationship between geometry and capacity measures for deep neural networks from an invariance viewpoint. We introduce a new notion of capacity --- the Fisher-Rao norm --- that possesses desirable invariance properties and is motivated by Information Geometry. We discover an analytical characterization of…

2017-11-05abs ↗pdf ↗

We present a general method for deriving collapsed variational inference algo- rithms for probabilistic models in the conjugate exponential family. Our method unifies many existing approaches to collapsed variational inference. Our collapsed variational inference leads to a new lower bound on the marginal likelihood. W…

2012-06-22abs ↗pdf ↗

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.

For non-compact manifolds with boundary we prove that bounded geometry defined by coordinate-free curvature bounds is equivalent to bounded geometry defined using bounds on the metric tensor in geodesic coordinates. We produce a nice atlas with subordinate partition of unity on manifolds with boundary of bounded geomet…

2000-01-19abs ↗pdf ↗

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.

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.