Systems | Information | Learning | Optimization
 

Robust Learning from Batches: The Best Things in Life are (Almost) Free

In many applications, including sensor networks, collaborative filtering, and federated learning, data are collected in batches, some potentially corrupt, biased, or even adversarial. Learning algorithms for this setting have therefore garnered considerable recent attention. We develop a general framework for robust learning from batches, and determine the least number of samples required for robust density estimation and classification over both discrete and continuous domains. Perhaps surprisingly, we show that robust learning can be achieved with essentially the same number of samples as required for genuine data. For the important problems of learning discrete and piecewise-polynomial densities, and of interval-based classification, we achieve these limits with polynomial-time algorithms.

Joint work with Ayush Jain.

March 24 @ 12:30
12:30 pm (1h)

Remote

Alon Orlitsky