On Weak-to-Strong Generalization and f-Divergence
Not on the map. Why?
Abstract (arXiv)
Weak-to-strong generalization (W2SG) has emerged as a promising paradigm for stimulating the capabilities of strong pre-trained models by leveraging supervision from weaker supervisors. To improve the performance of the strong model, existing methods often require additional weak models or complex procedures, leading to substantial computational and memory overhead. Motivated by the effectiveness of f-divergence loss in various machine learning domains, we introduce f-divergence as an information-theoretic loss function framework in W2SG. Our theoretical analysis reveals fundamental limitations and equivalence of different f-divergence losses in W2SG, supported by sample complexity bounds and information-theoretic insights. We empirically demonstrate that f-divergence loss, which generalizes widely-used metrics like KL divergence, effectively improves generalization and noise tolerance of the strong model in practice.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 3 Jun 2025.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026Weak-to-Strong On-Policy Distillationcited by 8
- 2026Weak-to-Strong Generalization is Nearly Inevitable (in Linear Models)cited by 2
- 2026Empirical Risk Minimization with f-Divergence Regularizationcited by 0
- 2026AdaStop: Cost-Aware Early Stopping for DNN Test Selectioncited by 0
- 2026Weak-to-Strong On-Policy Distillation28 Jul 2026
- 2026AdaStop: Cost-Aware Early Stopping for DNN Test Selection6 Jul 2026
- 2026Weak-to-Strong Generalization is Nearly Inevitable (in Linear Models)7 May 2026
- 2026Empirical Risk Minimization with f-Divergence Regularization19 Jan 2026