




















Abstract:We give a computer-assisted counterexample to the open question, posed by Rudin, Schapire, and Daubechies in COLT 2012, of whether exhaustive AdaBoost always converges to a finite cycle. The construction is based on a block-product gadget whose two factors share an exact period-2 orbit for their 5-step branch maps, but whose linearized return maps have dominant eigenvalues with an irrational logarithmic ratio. This irrationality forces the burst-winner sequence to have an irrational asymptotic frequency, precluding eventual periodicity. All assertions are certified by exact rational arithmetic. This work was developed in collaboration with GPT-5.4 Pro and Claude Opus 4.6.
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2604.07055 [cs.LG] |
| (or arXiv:2604.07055v2 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2604.07055 arXiv-issued DOI via DataCite |
From: Erik Wang [view email]
[v1]
Wed, 8 Apr 2026 13:06:53 UTC (26 KB)
[v2]
Fri, 17 Apr 2026 16:49:31 UTC (45 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。