Hugging Face Trending Papers

Bagging Robustly Learns VC Classes with Linear Sample Complexity

Read the original on Hugging Face Trending Papers →

We revisit the problem of learning predictors robust to adversarial examples at test-time. We prove 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).

Summary generated by The Flow from the publisher's feed. The full article lives at Hugging Face Trending Papers.

arXiv Machine Learning
Jun 25

Learning with Monotone Adversarial Corruptions

arXiv:2601. 02193v2 Announce Type: replace Abstract: We study the extent to which standard machine learning algorithms rely on exchangeability and independence of data by introducing a monotone adversarial corruption model.

By Kasper Green Larsen, Chirag Pabbaraju, Abhishek Shetty