Preprint
Aug 2026
Bagging Robustly Learns VC Classes with Linear Sample Complexity
It is proved that VC classes are adversarially robustly learnable with sample complexity linear in the VC dimension $d$, providing an exponential improvement over the previous upper bound of Montasser, Hanneke, and Srebro (2019).
Omar Montasser
· 0 citations