CORTEXA
← Browse
arxivcs.LGmath.STstat.ML2026-07-22

Fisher Widths: Local Learning Geometry and Anisotropic Recovery

Vu Khac Ky

We study Gaussian-width complexity on statistical manifolds through a pair of functionals: the primal Fisher width $w_G(T) = w(G^{1/2}T)$, induced by the Fisher metric, and the inverse-Fisher width $w_{G^{-1}}(T) = w(G^{-1/2}T)$, induced by the inverse Fisher metric. The two widths play complementary statistical roles. On the learning side, the Fisher width measures the size of local parameter fluctuations in the geometry induced by the Fisher information. For Fisher-regular losses, we prove that the scale \(w_G(H_r)/\sqrt n\) is attained on sufficiently small Fisher balls. On the recovery side, the inverse-Fisher width captures the effect of anisotropic Gaussian measurements whose covariance is determined by the inverse Fisher information. For sparse recovery, the resulting geometry depends not only on sparsity but also on the position of the active coordinates in the Fisher spectrum. We obtain a two-sided estimate for the corresponding statistical dimension, together with support-sensitive recovery estimates and a natural ordering of supports with different curvature profiles. Finally, we establish a sharp relation between the primal and inverse-Fisher widths. On any common compact coordinate set $T$, they satisfy \[ w_G(T)w_{G^{-1}}(T)\geq w(T)^2. \] Thus, Fisher anisotropy may transfer complexity from one geometry to the other, but cannot reduce both widths relative to the Euclidean scale.

View free PDFSource page

Related papers

arxivstat.MLcs.LGmath.ST2026-07-08

Statistical inverse learning and $\ell^1$-regularization

Abhishake Rastogi, Tatiana A. Bubba, Tapio Helin, Luca Ratti

We study the recovery of sparse functions from finite, noisy, and indirect observations in the framework of statistical inverse learning. The unknown is modeled as an element of $\ell^1$, and observations are generated through a possibly nonlinear forward operator $A:\ell^1\to H$…

View free PDFSource page
arxivcs.DScs.LGmath.STstat.ML2026-06-25

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity

Haitong Liu, Deepak Narayanan Sridharan, David Steurer, Manuel Wiedmer

We study the fundamental problem of learning a high-dimensional Gaussian truncated to an unknown halfspace. Lee, Mehrotra and Zampetakis (FOCS'24) recently obtained the first polynomial time algorithm for this problem, but their resulting sample and time complexity bounds are not…

View free PDFSource page
arxivstat.MLcs.LGmath.ST2026-07-20

Mixing-Free and Signal-Optimal Learning of Gaussian Graphical Models from Glauber Dynamics

Vignesh Tirukkonda, Gautam Dasarathy

Gaussian graphical model selection is usually studied under independent sampling, but in many applications the data arise as a single trajectory of a dependent stochastic process. We study exact recovery of the graph from one trajectory of random-scan Gaussian Glauber dynamics. E…

View free PDFSource page
arxivstat.MLcs.LGmath.PRmath.ST2026-07-15

Spectral Concentration and Recovery in Sparse High-Dimensional Random Geometric Graphs

Manuel Fernandez, Yizhe Zhu

We study sparse threshold random geometric graphs generated by high-dimensional spherical or Gaussian latent vectors. Although each edge has marginal probability $p$, shared latent variables make the adjacency entries dependent. At the connectivity scale $np=Ω(\log n)$, the spher…

View free PDFSource page
arxivcs.LGmath.STstat.ML2026-07-24

Beyond Negative-Ridge Endpoints: Mixed-Sign Spectral Regularization via Negative-Shifted Gradient Descent

Peng Zhao

In overparameterized linear regression, many weak spectral directions act like a ridge penalty on the signal-bearing spectrum; negative ridge is the natural correction, pushing filters above one. The stable negative-ridge endpoint, however, is structurally limited: its pole must…

View free PDFSource page
arxivstat.MLcs.LGmath.STstat.ME2026-07-02

Contaminated Multi-task Learning with Heterogeneity: Fundamental Limits and Optimal Algorithms

Ye Tian, Mengchu Li, Marco Avella Medina

Integrating information across related tasks can improve estimation and prediction in transfer, multi-task, and federated learning, but contamination and heterogeneity make robust borrowing challenging. We study a contaminated multi-task empirical risk minimization (ERM) framewor…

View free PDFSource page