Keywords

RegretComputer scienceLogarithmConvex optimizationAlgorithmRegular polygonMathematical optimizationMathematicsMachine learning

Affiliated Institutions

Related Publications

On clusterings

We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is sh...

2004 Journal of the ACM 842 citations

Handbook of Genetic Algorithms

This book sets out to explain what genetic algorithms are and how they can be used to solve real-world problems. The first objective is tackled by the editor, Lawrence Davis. Th...

1991 7308 citations

Publication Info

Year
2006
Type
book-chapter
Pages
499-513
Citations
207
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

207
OpenAlex

Cite This

Elad Hazan, Adam Tauman Kalai, Satyen Kale et al. (2006). Logarithmic Regret Algorithms for Online Convex Optimization. Lecture notes in computer science , 499-513. https://doi.org/10.1007/11776420_37

Identifiers

DOI
10.1007/11776420_37