New online boosting algorithm runs 50x faster without ensemble, matches best comparators
Aaroth · x · 2026-08-14
Aaroth presents a new online boosting algorithm that avoids maintaining an ensemble by constructing an online hard core set. It matches or beats the best comparator on real and synthetic datasets while running 50x faster.
Related event: New Online Boosting Algorithm Ditches Ensembles, Runs 50x Faster(3 posts)→
More from Research
- First Agent Memory Leaderboard launches; MemoraX tops commercial text-memory track — rohanpaul_ai · 2026-08-14
- Anthropic Frontier Red Team Report: Multi-Agent Systems Face Cooperation and Trust Issues — dhadfieldmenell · 2026-08-14
- Microsoft folds Normuon row-norm into row selection for modest gains — JohnCLangford · 2026-08-14
- Scale learning rate by 1/sqrt(f) when sampling rows, Microsoft finds — JohnCLangford · 2026-08-14
- Microsoft Open-Sources Dion Optimizer: Integrates Gram-NS, Row Selection, and More, 6x Faster Training — JohnCLangford · 2026-08-14
- RL in Big Worlds workshop happening tomorrow at RL Conference — tw_killian · 2026-08-14