Distribution Learnability and Robustness
<|reference_start|>Distribution Learnability and Robustness: We examine the relationship between learnability and robust (or agnostic) learnability for the problem of distribution learning. We show that, contrary to other learning settings (e.g., PAC learning of function classes), realizable learnability of a class of probability distributions does not imply its agnostic learnability. We go on to examine what type of data corruption can disrupt the learnability of a distribution class and what is such learnability robust against. We show that realizable learnability of a class of distributions implies its robust learnability with respect to only additive corruption, but not against subtractive corruption.   We also explore related implications in the context of compression schemes and differentially private learnability.<|reference_end|>
@article{ben-david2024distribution,
    title={Distribution Learnability and Robustness},
    author={Shai Ben-David, Alex Bie, Gautam Kamath, Tosca Lechner},
    journal={arXiv preprint arXiv:2406.17814},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.17814},
    primaryClass={stat.ML cs.DS cs.IT cs.LG math.IT math.ST stat.TH}
}