We introduce DQFIM to quantify and improve generalization of quantum machine learning models.
problem Understanding and improving generalization of quantum machine learning models.
method Data quantum Fisher information metric (DQFIM) to quantify circuit parameters and training data.
result Improves generalization by breaking symmetries of training data and using a low number of training states.
Develops an analytic theory for quantum imaginary time evolution.
problem Lack of a first-principle understanding of quantum imaginary time evolution.
method Interprets QITE as a form of VQA trained with QNGD and connects it to the geometric geodesic distance in the quantum Fisher information metric.
result QITE converges faster than vanilla gradient descent-based VQAs, though the advantage is suppressed by Hilbert space dimensionality.
The probability distribution function (PDF) for prices on financial markets is derived by extremization of Fisher information. It is shown how on that basis the quantum-like description for financial markets arises and different financial market models are mapped by quantum mechanical ones.
Market strategies minimize Fisher information to minimize risk.
problem Applying minimum Fisher information principle to market dynamics.
method Analytical extension to quantum harmonic oscillator eigenstates and Gibbs distribution.
result Minimizing Fisher information reduces information and risk.
Let (M,g) be a compact, connected and oriented Riemannian manifold. We denote D the space of smooth probability density functions on M. In this paper, we show that the Frechet manifold D is equipped with a Riemannian metric g^{D} and an affine connection \nabla^{D} which are infinite dimensional analogues of the Fisher…
Develops a new geometric framework for quantum metrics.
problem Quantum metric generalization for pure two-qubit states.
method Support-projected Petz monotone geometry for pure two-qubit families.
result Strictly generalizes SLD/Bures case and includes other metrics.
Machine learning approximates phase transitions using Fisher information.
problem Understanding phase transitions from data using machine learning.
method Information geometry and Fisher information.
result Machine learning indicators approximate the square root of Fisher information.
Quantum machine learning tackles large datasets with randomized measurements.
problem Efficiently process large, high-dimensional datasets on quantum computers.
method Randomized measurements to scale linearly with dataset size and quadratic for post-processing.
result Substantial speed-up for noisy quantum computers, enabling image classification.
The Riemannian Bures metric on the space of (normalized) complex positive matrices is used for parameter estimation of mixed quantum states based on repeated measurements just as the Fisher information in classical statistics. It appears also in the concept of purifications of mixed states in quantum physics. Here we d…
This paper shows any Kähler metric can be a Fisher information metric.
problem Establishing a new characterization of Kähler and coKähler manifolds.
method Statistical approach using Fisher information and exponential families.
result Any Kähler metric is a Fisher information metric.
Jordan algebras in information geometry linked to metrics on probability distributions.
problem Understanding Jordan algebras in information geometry.
method Inspired by Kirillov's coadjoint orbits, a pseudo-Riemannian metric is constructed on Jordan algebra leaves.
result Not all points in the dual space lie on a leaf, and the metric structure depends on the cone of positive functionals.
Noise-resilient optimization on noisy quantum computers.
problem Noise's impact on hybrid quantum-classical optimization.
method Iterative quantum circuit with noise consideration, using Quantum Fisher Information bound.
result Algorithm robustness against different noise strengths.
New algorithm improves efficiency of quantum system modeling.
problem Intractable complexities in quantum Hamiltonian learning and Gibbs sampling.
method Generalized quantum natural gradient descent and Quantum-Probabilistic Mirror Descent.
result Data sample efficiency proven using information geometry and quantum metrology.
New method learns quantum states using neural networks, revealing hidden dynamics.
problem High-precision ground state estimation of quantum many-body problems.
method Stochastic reconfiguration method with neural network Ansatz states.
result Learning landscape modes with least entanglement have largest eigenvalues, suggesting correlations are encoded in large flat valleys.
Paper discusses the Fisher metric and differentiability in statistical models.
problem Understanding the relationship between Fisher metric and differentiability in statistical models.
method Comparison of different concepts and models in Information Geometry, mathematical statistics, and measure theory.
result Discussion of various models and their differentiability properties.
We show a general relation between the spatially disjoint product of probability density functions and the sum of their Fisher information metric tensors. We then utilise this result to give a method for constructing the probability density functions for an arbitrary Riemannian Fisher information metric tensor. We note…
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.
Estimates metric tensor on neuromanifolds using Fisher information and random methods.
problem Computing the metric tensor on high-dimensional neuromanifolds efficiently and accurately.
method Deterministic bounds and unbiased random estimators based on Hutchinson's trace method.
result An efficient random estimator with bounded standard deviation.
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.
Overparametrization improves QNN trainability by reducing spurious local minima.
problem Understanding how overparametrization affects the loss landscape of QNNs.
method Rigorous analysis of overparametrization in QNNs with periodic structure.
result Overparametrization corresponds to a computational phase transition improving QNN trainability.
A new measure of model complexity based on Fisher Information.
problem Model complexity measurement in statistical models.
method Effective dimension defined by the number of cubes needed to cover the model space.
result The effective dimension is scale-dependent and measures model complexity.
New statistics are introduced that maintain the Fisher metric structure closely, akin to sufficient statistics.
problem Maintaining the Fisher metric structure in statistical models.
method Characterizing statistics that maintain the Fisher metric structure bi-Lipschitz equivalently.
result Characterized statistics that preserve the Fisher metric structure closely.
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.
The family N of n-variate normal distributions is parameterized by the cone of positive definite symmetric n×n-matrices and the n-dimensional real vector space. Equipped with the Fisher information metric, N becomes a Riemannian manifold. As such, it is diffeomorphic, but not isometr…
Study on Gaussian-width complexity on statistical manifolds and its applications in learning and recovery.
problem Understanding the geometry of statistical manifolds and its implications for learning and recovery.
method Analysis of Fisher width and inverse-Fisher width, proving their complementary roles and establishing a relation between them.
result Established a sharp relation between Fisher width and inverse-Fisher width, showing they cannot reduce relative to Euclidean scale.
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.
Paper analyzes latent space geometry in generative models using Fisher information.
problem Understanding the structure of latent spaces in generative models.
method Reconstructs Fisher information metric from generated samples and posterior distribution.
result Reveals fractal structure and abrupt changes in Fisher metric at phase boundaries.
Noise can affect the overparametrization of QNNs, enabling new directions but also suppressing sensitivity.
problem The overparametrization of QNNs in the presence of noise.
method Analyzing the Quantum Fisher Information Matrix (QFIM) to understand how noise affects the rank of QFIM.
result Noise can turn previously-zero eigenvalues of the QFIM to non-zero, enabling exploration of new directions.
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.
A deep neural network is a hierarchical nonlinear model transforming input signals to output signals. Its input-output relation is considered to be stochastic, being described for a given input by a parameterized conditional probability distribution of outputs. The space of parameters consisting of weights and biases i…
SQFA learns features maximizing Fisher-Rao distance for better classification.
problem Improving classification accuracy through feature learning.
method SQFA learns linear features maximizing Fisher-Rao distance between class-conditional distributions.
result SQFA-H features achieve the best classification accuracy.
The Madelung transform is known to relate Schrödinger-type equations in quantum mechanics and the Euler equations for barotropic-type fluids. We prove that, more generally, the Madelung transform is a Kähler map (i.e. a symplectomorphism and an isometry) between the space of wave functions and the cotangent bundle to t…
In this paper we consider the space of those probability distributions which maximize the q-Rényi entropy. These distributions have the same parameter space for every q, and in the q=1 case these are the normal distributions. Some methods to endow this parameter space with Riemannian metric is presented: the seco…
Many deep learning models are vulnerable to the adversarial attack, i.e., imperceptible but intentionally-designed perturbations to the input can cause incorrect output of the networks. In this paper, using information geometry, we provide a reasonable explanation for the vulnerability of deep learning models. By consi…
Concrete distribution properties examined on simplex.
problem Properties of Concrete distribution on simplex.
method Reflection and location-scale transformation of uniform distribution; explicit parameterization to Poincaré half-space.
result Fisher information and information metric are hyperbolic space; Fisher-Rao geodesic distance computed.
New method uses Fisher-Rao metric for non-Gaussian decoders.
problem Existing latent space geometry theory only works for Gaussian decoders.
method Pull back Fisher-Rao metric to latent space for non-Gaussian decoders.
result Achieves meaningful latent geometries for various non-Gaussian decoders.
GANs can be used to extract Fisher vectors for unsupervised feature learning.
problem Unsupervised feature extraction for classification and similarity tasks.
method Derive Fisher Information and Fisher Vectors from GANs' density model.
result GAN-induced Fisher Vectors perform competitively in unsupervised feature extraction.
This work improves OOD detection using deep generative models by approximating Fisher information metrics.
problem Deep generative models often incorrectly infer higher likelihoods for out-of-distribution data.
method Approximating Fisher information metrics using gradient norms of data points.
result The method outperforms existing OOD detection techniques.
Adaptive sampling improves graph diffusion models by maintaining uniform information speed.
problem Standard diffusion models overlook non-homogeneous dynamics on complex manifolds.
method Information-geometric framework using Fisher-Rao metric and Drift Variation Score (DVS).
result DVS solver ensures uniform rate of distributional change, improving structural fidelity and efficiency.
Fisher width is a geometric measure of complexity on statistical manifolds.
problem Complexity measures on statistical manifolds
method Introducing Fisher width as a Fisher-geometric analogue of Gaussian width
result Fisher width retains key structural features of Gaussian width while capturing anisotropic geometric effects
The cost of belief changes with precision and is a hyperbolic geometry.
problem The cost of belief changes with precision and is a hyperbolic geometry.
method The cost of belief changes with precision and is a hyperbolic geometry.
result The cost of belief changes with precision and is a hyperbolic geometry.
Introduces new Finsler metrics and connects them to information geometry.
problem Generalizing Fisher-Rao metrics and studying their geometric properties.
method Introduces Lp-Fisher-Rao metrics and studies their relations to Amari-Cencov α-connections. result Geodesics of Fp and ∇(α) coincide on Dens+(M) for p=2/(1−α). Paper defines Fisher co-metric on cotangent bundle and clarifies its relation to variance.
problem Defines Fisher co-metric on cotangent bundle and clarifies its relation to variance.
method Defines Fisher co-metric directly from Fisher metric without going through tangent bundle, using a natural correspondence between cotangent vectors and random variables.
result Clarifies the relation between Fisher co-metric and variance/covariance, trivializing the Cramér-Rao inequality.
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.
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 present a framework for Nesterov's accelerated gradient flows in probability space to design efficient mean-field Markov chain Monte Carlo (MCMC) algorithms for Bayesian inverse problems. Here four examples of information metrics are considered, including Fisher-Rao metric, Wasserstein-2 metric, Kalman-Wasserstein m…
Study reveals how Fisher information changes with network depth, finding it grows linearly.
problem Understanding the trainability of deep neural networks (DNNs).
method Investigates the spectral distribution of the conditional Fisher information matrix (FIM) for fully-connected networks achieving dynamical isometry.
result The conditional FIM's spectrum concentrates around the maximum and grows linearly with depth.
In this communication, we describe some interrelations between generalized q-entropies and a generalized version of Fisher information. In information theory, the de Bruijn identity links the Fisher information and the derivative of the entropy. We show that this identity can be extended to generalized versions of en…