mlsanityData to 14 Oct 2026

Improved Replicable Boosting with Majority-of-Majorities

arXiv 2501.18388 ↗First posted 30 Jan 2025cs.LGcited by 2

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

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.