Sciweavers

NIPS
2008
13 years 6 months ago
On the Generalization Ability of Online Strongly Convex Programming Algorithms
This paper examines the generalization properties of online convex programming algorithms when the loss function is Lipschitz and strongly convex. Our main result is a sharp bound...
Sham M. Kakade, Ambuj Tewari