.png){kind=icon}
.png){kind=icon}
Return
Robustness and generalization
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-011-5268-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 complexity or stability arguments, to study generalization of learning algorithms. One advantage of the robustness approach, compared to previous methods, is the geometric intuition it conveys. Consequently, robustness-based analysis is easy to extend to learning in non-standard setups such as Markovian samples or quantile loss. We further show that a weak notion of robustness is both sufficient and necessary for generalizability, which implies that robustness is a fundamental property that is required for learning algorithms to work.
Keywords:
Generalization
Robust
Non-IID sample
Quantile loss
Journal
IF:
2.9
Papers:
2.6K
Citations:
3.4W