mlsanityData to 14 Oct 2026

Evidence Slopes and Effective Dimension in Singular Linear Models

arXiv 2601.01238 ↗First posted 3 Jan 2026stat.ML cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Bayesian model selection commonly relies on Laplace approximation or the Bayesian Information Criterion (BIC), which assume that the effective model dimension equals the number of parameters. Singular learning theory replaces this assumption with the real log canonical threshold (RLCT), an effective dimension that can be strictly smaller in overparameterized or rank-deficient models. We study linear-Gaussian rank models and linear subspace (dictionary) models in which the exact marginal likelihood is available in closed form and the RLCT is analytically tractable. In this setting, we show theoretically and empirically that the error of Laplace/BIC grows linearly with (d/2 minus lambda) times log n, where d is the ambient parameter dimension and lambda is the RLCT. An RLCT-aware correction recovers the correct evidence slope and is invariant to overcomplete reparameterizations that represent the same data subspace. Our results provide a concrete finite-sample characterization of Laplace failure in singular models and demonstrate that evidence slopes can be used as a practical estimator of effective dimension in simple linear settings.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 3 of its 15 references that are in the map. First posted on arXiv 3 Jan 2026.

Builds on

3 of 15 references.

References · 3

  1. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
  2. 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 533
  3. 2017Fisher-Rao Metric, Geometry, and Complexity of Neural Networkscited by 100

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.