Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Using 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.


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: