3 ms·
having probabilistic guarantees on your out of sample results as well as sample complexity, no matter the underlying distribution What technique are you referr
by ced 11y ago
having probabilistic guarantees on your out of sample results as well as sample complexity, no matter the underlying distribution
What technique are you referring to?
- lindbergh 11y agoUsing concentration inequalities on Lipschitz convex learning algorithms to derive generalizing bounds. The seminal papers for this would be Stability and Generalization by Bousquet and Elisseef (2002), or those by Shalev Schwartz.