a public good project by the
Synthesis
Company
of California

© 2026

Logarithmic regret algorithms for online convex optimization | doi.page

0 citations0 references

Google Scholar doi.org

Logarithmic regret algorithms for online convex optimization

Machine Learning·2007·Vol. 69(2-3), pp. 169–192

Citations Over TimeTop 1% of 2007 papers

Elad Hazan, Amit Agarwal, Satyen Kale

Related Papers

Bounded regret in stochastic multi-armed bandits(2013)
→ A New Approach to Online Scheduling(2016)10 cited
→ Tight Bounds for Online TSP on the Line(2017)5 cited
A New Approach to Competitive Analysis: Approximating the Optimal Competitive Ratio(2012)