22 search results - page 5 / 5 » Worst-Case Absolute Loss Bounds for Linear Learning Algorith... |
COLT
2010
Springer
13 years 3 months ago
2010
Springer
We study the regret of an online learner playing a multi-round game in a Banach space B against an adversary that plays a convex function at each round. We characterize the minima...
PKDD
2010
Springer
13 years 3 months ago
2010
Springer
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...