Improved Replicable Boosting with Majority-of-Majorities
Not on the map. Why?
Abstract (arXiv)
We introduce a new replicable boosting algorithm which significantly improves the sample complexity compared to previous algorithms. The algorithm works by doing two layers of majority voting, using an improved version of the replicable boosting algorithm introduced by Impagliazzo et al. [2022] in the bottom layer.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 30 Jan 2025.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2026: 2.
2 papers.
- 2026Replicable Compositioncited by 0
- 2026Tight Generalization Bound for AdaBoostcited by 0
- 2026Tight Generalization Bound for AdaBoost29 Jul 2026
- 2026Replicable Composition12 Apr 2026