Answers are grounded in this paper and cite their sources.
In this article, we study leave-one-out style cross-validation bounds for kernel methods. The essential element in our analysis is a bound on the parameter estimation stability for regularized kernel formulations. Using this result, we derive bounds on expected leave-one-out cross-validation errors, which lead to expected generalization bounds for various kernel algorithms. In addition, we also obtain variance bounds for leave-oneout errors. We apply our analysis to some classification and regression problems and compare them with previous results.
No takes yet. Share an insight, caveat, or question.
Tong Zhang (2003) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: