3 papers
cs.LG2026
The Sample Complexity of Replicable Realizable PAC Learning
Kasper Green Larsen, Markus Engelund Mathiasen, Chirag Pabbaraju +1
In this paper, we consider the problem of replicable realizable PAC learning. We construct a particularly hard learning problem and show a sample complexity lower bound with a clos…
math.PR2025
Fourth-Moment Theorems for Sums of Multiple Integrals
Andreas Basse-O'Connor, David Kramer-Bang, Clement Svendsen
Nualart & Pecatti ([Nualart and Peccati, 2005, Thm 1]) established the first fourth-moment theorem for random variables in a fixed Wiener chaos, i.e. they showed that convergence o…
cs.LG2025
Improved Replicable Boosting with Majority-of-Majorities
Kasper Green Larsen, Markus Engelund Mathiasen, Clement Svendsen
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 majo…