English

Robustness and Generalization

Machine Learning 2015-03-17 v1

Abstract

We derive generalization bounds for learning algorithms based on their robustness: the property that if a testing sample is "similar" to a training sample, then the testing error is close to the training error. This provides a novel approach, different from the complexity or stability arguments, to study generalization of learning algorithms. We further show that a weak notion of robustness is both sufficient and necessary for generalizability, which implies that robustness is a fundamental property for learning algorithms to work.

Keywords

Cite

@article{arxiv.1005.2243,
  title  = {Robustness and Generalization},
  author = {Huan Xu and Shie Mannor},
  journal= {arXiv preprint arXiv:1005.2243},
  year   = {2015}
}
R2 v1 2026-06-21T15:22:18.603Z