118
click to vote
NIPS
2008
15 years 4 months ago
2008
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...