跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.12696 · v1

Generalized Adaptive Boosting and the Geometry of Mistakes

首次提交 2026-11-10 00:56
版本更新 2026-11-10 00:56
雷达观测 2026-11-10 15:22
arXiv ↗PDF ↗

摘要

Not all mistakes are alike. For example, in medical diagnosis, false positive and false negative mistakes have a different impact and should not be aggregated. By revisiting the classical theory of boosting through this lens, we introduce the notion of ZZ-learner, which returns weak hypotheses achieving joint false-positive/false-negative guarantees (FP,FN)(\mathrm{FP},\mathrm{FN}) from some set Z⊆[0,1]2Z \subseteq [0,1]^2. This formulation generalizes the standard notion of γγ-weak learning--recovered by taking Z={(z1,z2):z1+z2<1/2−γ}Z=\{(z_1,z_2): z_1+z_2<1/2-γ\}--and allows for more flexible notions of weak learnability that account for the impact of the distribution on the achievable learning guarantees. This raises a natural question: which sets ZZ are boostable? We answer this by giving a complete geometric characterization that unifies, as special cases, both the classical boosting dichotomy and the recent multi-objective extension of Bressan et al. (COLT 2025). We also present an adaptive algorithm for boosting ZZ-learners without relying on the prior knowledge of ZZ, generalizing AdaBoost's ability to handle unknown margin parameters. Finally, we demonstrate that ZZ-learners can achieve confidence amplification. However, the analysis is significantly more involved than in classical boosting and relies on the centerpoint theorem from discrete and computational geometry.

作者备注:Accepted at NeurIPS 2026

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-10 00:56 · 最新观测版本

Generalized Adaptive Boosting and the Geometry of Mistakes

Not all mistakes are alike. For example, in medical diagnosis, false positive and false negative mistakes have a different impact and should not be aggregated. By revisiting the classical theory of boosting through this lens, we introduce the notion of ZZ-learner, which returns weak hypotheses achieving joint false-positive/false-negative guarantees (FP,FN)(\mathrm{FP},\mathrm{FN}) from some set Z⊆[0,1]2Z \subseteq [0,1]^2. This formulation generalizes the standard notion of γγ-weak learning--recovered by taking Z={(z1,z2):z1+z2<1/2−γ}Z=\{(z_1,z_2): z_1+z_2<1/2-γ\}--and allows for more flexible notions of weak learnability that account for the impact of the distribution on the achievable learning guarantees. This raises a natural question: which sets ZZ are boostable? We answer this by giving a complete geometric characterization that unifies, as special cases, both the classical boosting dichotomy and the recent multi-objective extension of Bressan et al. (COLT 2025). We also present an adaptive algorithm for boosting ZZ-learners without relying on the prior knowledge of ZZ, generalizing AdaBoost's ability to handle unknown margin parameters. Finally, we demonstrate that ZZ-learners can achieve confidence amplification. However, the analysis is significantly more involved than in classical boosting and relies on the centerpoint theorem from discrete and computational geometry.

查看此版本解读 →查看此版本原文 ↗