Estimation of the Learning Coefficient Using Empirical Loss
Tatsuyoshi Takio, Joe Suzuki

TL;DR
This paper introduces a new numerical method to estimate the learning coefficient using empirical loss, demonstrating improved accuracy and consistency over previous methods through theoretical analysis and experiments.
Contribution
A novel estimation technique for the learning coefficient based on empirical loss, outperforming existing methods in bias and variance.
Findings
Lower bias and variance in estimates
Theoretical explanation of improved performance
Empirical validation through numerical experiments
Abstract
The learning coefficient plays a crucial role in analyzing the performance of information criteria, such as the Widely Applicable Information Criterion (WAIC) and the Widely Applicable Bayesian Information Criterion (WBIC), which Sumio Watanabe developed to assess model generalization ability. In regular statistical models, the learning coefficient is given by d/2, where d is the dimension of the parameter space. More generally, it is defined as the absolute value of the pole order of a zeta function derived from the Kullback-Leibler divergence and the prior distribution. However, except for specific cases such as reduced-rank regression, the learning coefficient cannot be derived in a closed form. Watanabe proposed a numerical method to estimate the learning coefficient, which Imai further refined to enhance its convergence properties. These methods utilize the asymptotic behavior of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
