analiza aiqbench
This paper provides a rigorous theoretical framework explaining why feedback-free self-improvement techniques like debate and bootstrap succeed, unifying them under the principle of coherence optimization. By proving equivalence to description-length regularization, the authors demonstrate how these methods maximize worst-case accuracy in semi-supervised learning scenarios without external supervision. The work offers critical insights for advancing autonomous model evolution and understanding the fundamental limits of unsupervised refinement.
Self-Improvement as Coherence Optimization: A Theoretical Account
arXiv:2601.13566v2 Announce Type: replace-cross Abstract: Can language models improve their accuracy without external supervision? Methods such as debate, bootstrap, and internal coherence maximization achieve this surprising feat, even matching golden finetuning performance. Yet why they work remains theoretically unclear. We show that they can all be understood as coherence optimization, the search for a context-to-behavior mapping that is most compressible and jointly predictable, with debate an exact instance and bootstrap and internal coherence maximization closely related to it. We prove that coherence optimization is equivalent to description-length regularization, and that among all such regularization schemes, coherence regularization with a prior derived from a pretrained model optimizes a lower bound of worst-case accuracy for semi-supervised learning. Our theory, supported by preliminary experiments, explains why feedback-free self-improvement works and predicts when it should succeed or fail.
Abstract:Can language models improve their accuracy without external supervision? Methods such as debate, bootstrap, and internal coherence maximization achieve this surprising feat, even matching golden finetuning performance. Yet why they work remains theoretically unclear. We show that they can all be understood as coherence optimization, the search for a context-to-behavior mapping that is most compressible and jointly predictable, with debate an exact instance and bootstrap and internal coherence maximization closely related to it. We prove that coherence optimization is equivalent to description-length regularization, and that among all such regularization schemes, coherence regularization with a prior derived from a pretrained model optimizes a lower bound of worst-case accuracy for semi-supervised learning. Our theory, supported by preliminary experiments, explains why feedback-free self-improvement works and predicts when it should succeed or fail.
Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
arXiv:2601.13566 [cs.LG]
(or arXiv:2601.13566v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2601.13566 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 228 cuvinte
Subiecte conexe

The Entangled Dimensions of Decision Theory
LessWrong · 30 iul. 2026

Deconfusing Corrigibility
AI Alignment Forum · 17 oct. 2026

Qubit transfer errors fall to a quadratic level with STIRAP
Quantum Zeitgeist · 13 oct. 2026
Our response to Séb Krier on Plan A
LessWrong · 14 iul. 2026