AdaBoost Does Not Always Cycle: A Computer-Assisted Counterexample
arXiv:2604.07055v1 Announce Type: new
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…