arXiv:2605. 03823v3 Announce Type: replace Abstract: We study strong universal Bayes-consistency in the realizable setting for learning with general metric losses, extending classical characterizations beyond $0$-$1$ classification (Bousquet et al.
By Dan Tsir Cohen, Steve Hanneke, Aryeh Kontorovich
arXiv:2606. 11149v1 Announce Type: new Abstract: We study the problem of learning a drifting concept in the presence of Massart noise.
By Mingchen Ma, Guyang Cao, Jelena Diakonikolas, Ilias Diakonikolas
arXiv:2602. 06257v2 Announce Type: replace Abstract: Online strategic classification studies settings in which agents strategically modify their features to obtain favorable predictions.
By Chase Hutton, Adam Melrod, Han Shao
arXiv:2605. 18662v2 Announce Type: replace Abstract: Noise-tolerant PAC learning of linear models has been of central interests in machine learning community since the last century.
By Rita Adhikari, Shiwei Zeng
arXiv:2605. 09200v2 Announce Type: replace Abstract: We study adversarial noisy bandits given a known function class $\mathcal{F}$.
By Steve Hanneke, Kun Wang
arXiv:2602. 19172v2 Announce Type: replace Abstract: Realizable online regression can behave very differently from online classification.
By Ilan Doron-Arad, Idan Mehalel, Elchanan Mossel