# Improved Replicable Boosting with Majority-of-Majorities

arXiv: https://arxiv.org/abs/2501.18388 · HTML: https://mlsanity.com/paper/2501.18388/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 30 Jan 2025.

## Built on by (most cited first, 2 of 2)

- [Replicable Composition](https://mlsanity.com/paper/2604.10423/) (2026)
- [Tight Generalization Bound for AdaBoost](https://mlsanity.com/paper/2607.26838/) (2026)

## 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.