126
Voted
NIPS
2008
15 years 4 months ago
2008
We describe a primal-dual framework for the design and analysis of online strongly convex optimization algorithms. Our framework yields the tightest known logarithmic regret bound...