Exact Learning Coefficients for Singular Models

Gr\'egoire Sergeant-Perthuis (CQSB, Sorbonne Universit\'e), Elias Tsigaridas (Ouragan Team, INRIA), Jules Tsukahara (Ouragan Team, INRIA)· August 21, 2026 View original

Key takeaways

  • Classical information criteria fail for singular models common in deep learning.
  • Local learning coefficients (RLCTs) are crucial for correct model selection in these cases.
  • A new deterministic algorithm can exactly compute RLCTs for two-dimensional singular models.
  • This provides ground truth for estimators and reveals algebraic structure, outperforming sampling in shallow regimes.

Who benefits

AI ResearchMachine Learning EngineeringTheoretical Computer ScienceData Science

Summary

This paper presents the first deterministic algorithm for exactly computing local learning coefficients (Real Log Canonical Thresholds) for two-dimensional singular models. This breakthrough provides ground truth for calibrating sampling-based estimators and reveals algebraic structure in learning coefficients, outperforming sampling in shallow regimes.

Researchers have achieved a significant breakthrough by developing the first deterministic algorithm capable of exactly computing local learning coefficients, also known as Real Log Canonical Thresholds (RLCTs), for two-dimensional singular models. Traditional information criteria like BIC often fail for singular models, which are common in deep learning, leading to incorrect model selection. The Widely Applicable Bayesian Information Criterion (WBIC) relies on these local learning coefficients for accurate marginal likelihood asymptotics. Previously, exact computation was limited to special cases, with general applicability relying on sampling-based estimation. This new algorithm provides ground truth for calibrating these sampling methods and uncovers algebraic structures in learning coefficients that sampling cannot reveal. The method is effective for a broad class of models, including polynomial neural networks, and demonstrates superior speed in shallow model regimes, offering a more precise understanding of model complexity.

Why it matters

This advancement provides a more accurate and fundamental understanding of model complexity in deep learning, which can lead to better model selection, improved training stability, and more reliable theoretical foundations for AI.

How to implement this in your domain

  1. 1Utilize this exact computation method to calibrate and validate existing sampling-based estimators for learning coefficients.
  2. 2Apply the insights gained from algebraic structure to design more theoretically sound deep learning models.
  3. 3Explore the method's applicability to specific two-dimensional singular models in your research.
  4. 4Consider how exact RLCTs can inform model selection criteria beyond traditional BIC for singular models.

Original post by Gr\'egoire Sergeant-Perthuis (CQSB, Sorbonne Universit\'e), Elias Tsigaridas (Ouragan Team, INRIA), Jules Tsukahara (Ouragan Team, INRIA)

"arXiv:2608.20183v1 Announce Type: new Abstract: Classical information criteria such as the Bayesian Information Criterion (BIC) rely on regularity assumptions that break down for singular models, leading to incorrect model selection in settings such as deep learning. The Widely A…"

View on X

Originally posted by Gr\'egoire Sergeant-Perthuis (CQSB, Sorbonne Universit\'e), Elias Tsigaridas (Ouragan Team, INRIA), Jules Tsukahara (Ouragan Team, INRIA) on X · view source

Want to go deeper?

Turn these trends into skills with Learnijoy's hands-on AI & tech courses.

Explore courses