Learning Capacity: A Measure of the Effective Dimensionality of a Model
원문 초록
We use a formal correspondence between thermodynamics and inference, where the number of samples can be thought of as the inverse temperature, to study a quantity called ``learning capacity'' which is a measure of the effective dimensionality of a model. We show that the learning capacity is a useful notion of the complexity because (a) it correlates well with the test loss and it is a tiny fraction of the number of parameters for many deep networks trained on typical datasets, (b) it depends upon the number of samples used for training, (c) it is numerically consistent with notions of capacity obtained from PAC-Bayes generalization bounds, and (d) the test loss as a function of the learning capacity does not exhibit double descent. We show that the learning capacity saturates at very small and very large sample sizes; the threshold that characterizes the transition between these two regimes provides guidelines as to when one should procure more data and when one should search for a different architecture to improve performance. We show how the learning capacity can be used to provide a quantitative notion of capacity even for non-parametric models such as random forests and nearest neighbor classifiers.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Learning Non-Vacuous Generalization Bounds from Optimization
Learning Where to Learn: Training Distribution Selection for Provable OOD Performance
Operator Learning for Schrödinger Equation: Unitarity, Error Bounds, and Time Generalization
Graph Representational Learning: When Does More Expressivity Hurt Generalization?
Model Steering: Learning with a Reference Model Improves Generalization Bounds and Scaling Laws
Achieving Distributive Justice in Federated Learning via Uncertainty Quantification
토론
이 논문과 연결된 포럼 글이 아직 없습니다.