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,742 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Dec 199219922001200920172026
48 results for Amari formulas

Study curvature and torsion in Gaussian distribution's dual coordinate system.

problem Characterize geometric invariants of Gaussian distribution.
method Investigate Riemannian curvature and torsion in a dual coordinate system of Gaussian distribution.
result Explicitly give Amari formulas in the new coordinate system.

Characterizes connections on multivariate normal distributions.

problem Characterizing connections on statistical manifold of multivariate normal distributions.
method Analyzes statistical manifold (N,gF,ablaA,ablaA)(\mathcal{N}, g^F, abla^{A}, abla^{A*}) of multivariate normal distributions.
result The Amari-Chentsov connection ablaA abla^{A} is characterized by conjugate symmetry.

Dual affine connections on Riemannian manifolds have played a central role in the field of information geometry since their introduction by Amari. Here I would like to extend the notion of dual connections to general vector bundles with an inner product, in the same way as a unitary connection generalizes a metric affi…

2015-11-24abs ↗pdf ↗

A new Weyl prior is proposed for Bayesian statistics, offering a more canonical choice for parameter α.

problem Choosing a prior distribution for Bayesian inference.
method Proposed a new Weyl prior based on the Weyl structure on a statistical manifold.
result The Weyl prior is a special case of the α-parallel prior with α = -n, where n is the dimension of the statistical manifold.

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 ↗

We develope a new and general notion of parametric measure models and statistical models on an arbitrary sample space ΩΩ which does not assume that all measures of the model have the same null sets. This is given by a diffferentiable map from the parameter manifold MM into the set of finite measures or probability me…

2015-10-25abs ↗pdf ↗

New connections found on zero-mean multivariate normal distributions.

problem Characterizing statistical connections on zero-mean multivariate normal distributions.
method Investigating invariant conjugate symmetric statistical connections on the submanifold of zero-mean multivariate normal distributions.
result Invariant connections on zero-mean multivariate normal distributions are not uniquely characterized by invariance under the general linear group action.

We deal with finite dimensional differentiable manifolds. All items are concerned with are differentiable as well. The class of differentiability is CC^\infty. A metric structure in a vector bundle EE is a constant rank symmetric bilinear vector bundle homomorphism of E×EE\times E in the trivial bundle line bundle. We…

2017-09-27abs ↗pdf ↗

Introduces new Finsler metrics and connects them to information geometry.

problem Generalizing Fisher-Rao metrics and studying their geometric properties.
method Introduces LpL^p-Fisher-Rao metrics and studies their relations to Amari-Cencov αα-connections.
result Geodesics of FpF_p and (α)\nabla^{(α)} coincide on Dens+(M)_+(M) for p=2/(1α)p = 2/(1-α).

New geometric interpretation of Amari-Cencov α-connections on probability densities.

problem Geometric interpretation of Amari-Cencov α-connections on probability densities.
method Riemannian metrics and Levi-Civita connections.
result Geodesics of α-connections are energy-minimizing curves.

Improved Bayesian inference using power priors with historical data.

problem Improving Bayesian inference with historical data.
method Generalized power priors that adapt to the α\alpha parameter of Amari's α\alpha-divergence.
result Improved performance through appropriate choices of the α\alpha parameter.

New insights into Markov chain geometry via positive transition measures.

problem Lack of statistical meaning in the space of transition probabilities.
method Constructing an extension of the space of transition probabilities using Amari's theory of positive measures.
result Introduction of a new dually flat structure for the space of positive transition measures.

The paper extends gradient flow and relaxation studies to non-flat Riemannian manifolds.

problem Understanding gradient flows and relaxation in non-flat Riemannian manifolds.
method Developed a criterion for comparing relaxation along gradient descent curves using non-metricity tensor.
result Revealed a universal asymmetry: warming up is faster than cooling down.

Information geometry provides a geometric approach to families of statistical models. The key geometric structures are the Fisher quadratic form and the Amari-Chentsov tensor. In statistics, the notion of sufficient statistic expresses the criterion for passing from one model to another without loss of information. Thi…

2012-07-28abs ↗pdf ↗

On the predual of a von Neumann algebra, we define a differentiable manifold structure and affine connections by embeddings into non-commutative L_p-spaces. Using the geometry of uniformly convex Banach spaces and duality of the L_p and L_q spaces for 1/p+1/q=1, we show that we can introduce the α-divergence, for αin (…

2003-11-05abs ↗pdf ↗

The Conant-Ashby theorem is verified for hypergraph observers, leading to unique learning rules.

problem Verifying conditions for hypergraph observers to maintain internal models.
method Formalizing persistent observers, applying the Conant-Ashby theorem, and using natural gradient descent.
result Natural gradient descent is the unique admissible learning rule for hypergraph observers.

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.

We develop a family of infinite-dimensional (non-parametric) manifolds of probability measures. The latter are defined on underlying Banach spaces, and have densities of class CbkC_b^k with respect to appropriate reference measures. The case k=k=\infty, in which the manifolds are modelled on Fréchet spaces, is included.…

2016-08-13abs ↗pdf ↗

We cast Amari's natural gradient in statistical learning as a specific case of Kalman filtering. Namely, applying an extended Kalman filter to estimate a fixed unknown parameter of a probabilistic model from a series of observations, is rigorously equivalent to estimating this parameter via an online stochastic natural…

2017-03-01abs ↗pdf ↗

More than thirty years ago, Charnes, Cooper and Schinnar (1976) established an enlightening contact between economic production functions (EPFs) -- a cornerstone of neoclassical economics -- and information theory, showing how a generalization of the Cobb-Douglas production function encodes homogeneous functions. As ex…

2009-01-16abs ↗pdf ↗

This paper studies moduli spaces of statistical structures on Lie groups.

problem Understanding statistical structures on Lie groups.
method Introduced and studied moduli spaces for left-invariant statistical structures on Lie groups.
result Moduli spaces of left-invariant Riemannian metrics are singletons for certain Lie groups.

In Riemannian geometry geodesics are integral curves of the Riemannian distance gradient. We extend this classical result to the framework of Information Geometry. In particular, we prove that the rays of level-sets defined by a pseudo-distance are generated by the sum of two tangent vectors. By relying on these vector…

2018-06-29abs ↗pdf ↗

Study reveals how model volume affects learning curves in machine learning.

problem Understanding the double descent risk phenomenon in machine learning.
method Investigates the role of model volume using MDL, Occam's Razor, and information geometry.
result Model volume can explain the double descent risk, suggesting better generalization with increased dimensionality.

The parametric complexity is the key quantity in the minimum description length (MDL) approach to statistical model selection. Rissanen and others have shown that the parametric complexity of a statistical model approaches a simple function of the Fisher information volume of the model as the sample size nn goes to in…

2015-10-01abs ↗pdf ↗

Introduces a new geometric framework for probability distributions.

problem Developing a geometric framework for probability distributions.
method Introduces p\ell^p-information geometry and defines the 2\ell^2-probability simplex via the qq-root transform.
result Defines a noncanonical differentiable structure and qq-root map as an isometry.

Study of generalized Csiszár divergences and their application to Cramér-Rao bounds.

problem Deriving lower bounds for estimator variance using generalized divergences.
method Applied Eguchi's theory to derive Fisher information metric and dual affine connections.
result More widely applicable Cramér-Rao inequality for escort distributions.

One way to avoid overfitting in machine learning is to use model parameters distributed according to a Bayesian posterior given the data, rather than the maximum likelihood estimator. Stochastic gradient Langevin dynamics (SGLD) is one algorithm to approximate such Bayesian posteriors for large models and datasets. SGL…

2017-12-04abs ↗pdf ↗

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 ↗

Introduces new geometric framework for probability densities on manifolds.

problem Developing a new geometric framework for probability densities on manifolds.
method Introduces p\ell^p-information geometry and defines 2\ell^2-probability simplex with qq-root transform.
result Explicit solution of gradient flow and geodesic completeness of ee-connection.

Proposes a new stochastic optimization method for MLR models.

problem Slow convergence of SGD in big data scenarios.
method Dual Stochastic Natural Gradient Descent (DNSGD) based on manifold optimization.
result DNSGD converges and has linear computational complexity.