paper-with-me

홈 › Papers

Fisher Width: A Geometric Measure of Complexity on Statistical Manifolds

2026-06-16 · Vu Khac Ky arxiv

Gaussian width is a central geometric complexity measure in high-dimensional probability, compressed sensing, convex optimization, and learning theory. It quantifies the average extent of a set along random directions, thereby capturing the effective dimension of constraint sets, hypothesis classes, and descent cones. However, this notion is intrinsically Euclidean. Statistical models instead carry a natural Riemannian geometry induced by the Fisher information metric, where directions are scaled according to statistical distinguishability rather than ambient Euclidean length. We introduce Fisher width, a Fisher-geometric analogue of Gaussian width for statistical manifolds. At a parameter point $θ$, Fisher width replaces the Euclidean identity by the local metric tensor $G(θ)^{1/2}$, measuring the Gaussian width of the Fisher-rescaled set. This makes the resulting quantity sensitive to local statistical curvature and invariant under smooth reparameterizations. We develop the basic theory of Fisher width, showing that it retains key structural features of Gaussian width, including concentration, metric perturbation stability, and spectral comparison bounds with the Euclidean baseline, while also capturing anisotropic geometric effects invisible to Euclidean measures. As an application, we prove a generalization bound for Fisher-Lipschitz hypothesis classes and propose computable estimators, which we evaluate empirically on MNIST across three model classes. Fisher width is to statistical manifolds what Gaussian width is to Euclidean convex bodies. This work lays the foundation for studying complexity and learning on curved statistical manifolds.

📄 PDF Abstract BibTeX arXiv:2606.18306

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

On the statistical complexity of quantum circuits

2021-01-15 · Kaifeng Bu, Dax Enshan Koh, Lu Li, Qingxian Luo 외

In theoretical machine learning, the statistical complexity is a notion that measures the richness of a hypothesis space. In this work, we apply a particular measure of statistical complexity, namely the Rademacher compl…

The Basic Geometric Structures of Electromagnetic Digital Information: Statistical characterization of the digital measurement of spatio-Doppler and polarimetric fluctuations of the radar electromagnetic wave

2020-06-26 · Frédéric Barbaresco, Yann Cabanes

The aim is to describe new geometric approaches to define the statistics of spatio-temporal and polarimetric measurements of the states of an electromagnetic wave, using the works of Maurice Fr{\'e}chet, Jean-Louis Koszu…

Structured Estimation with Atomic Norms: General Bounds and Applications

2015-12-01 · NeurIPS 2015 12 · Sheng Chen, Arindam Banerjee

For structured estimation problems with atomic norms, recent advances in the literature express sample complexity and estimation error bounds in terms of certain geometric measures, in particular Gaussian width of the un…

Approximate Joint Diagonalization and Geometric Mean of Symmetric Positive Definite Matrices

2015-05-26 · Marco Congedo, Bijan Afsari, Alexandre Barachant, Maher Moakher

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 t…

Time Series Analysis

Local Urysohn Width: A Topological Complexity Measure for Classification

2026-03-16 · Xin Li arxiv

We introduce \emph{local Urysohn width}, a complexity measure for classification problems on metric spaces. Unlike VC dimension, fat-shattering dimension, and Rademacher complexity, which characterize the richness of hyp…