2223 search results - page 19 / 445 » Implicit Online Learning |
ETS
2007
IEEE
13 years 7 months ago
2007
IEEE
ICML
2009
IEEE
14 years 2 months ago
2009
IEEE
In this work, we extend the ellipsoid method, which was originally designed for convex optimization, for online learning. The key idea is to approximate by an ellipsoid the classi...
COLT
2006
Springer
13 years 11 months ago
2006
Springer
We describe a novel framework for the design and analysis of online learning algorithms based on the notion of duality in constrained optimization. We cast a sub-family of universa...
ML
2007
ACM
13 years 6 months ago
2007
ACM
We describe a novel framework for the design and analysis of online learning algorithms based on the notion of duality in constrained optimization. We cast a sub-family of universa...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...