Keywords
RegretSequence (biology)MathematicsBounded functionMathematical optimizationOnline algorithmCover (algebra)Advice (programming)AlgorithmCompetitive analysisComputer scienceUpper and lower bounds
Affiliated Institutions
Related Publications
Stability-Based Validation of Clustering Solutions
Data clustering describes a set of frequently employed techniques in exploratory data analysis to extract “natural” group structure in data. Such groupings need to be validated ...
Publication Info
- Year
- 2007
- Type
- article
- Volume
- 69
- Issue
- 2-3
- Pages
- 169-192
- Citations
- 855
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
855
OpenAlex
Cite This
Elad Hazan,
Amit Agarwal,
Satyen Kale
(2007).
Logarithmic regret algorithms for online convex optimization.
Machine Learning
, 69
(2-3)
, 169-192.
https://doi.org/10.1007/s10994-007-5016-8
Identifiers
- DOI
- 10.1007/s10994-007-5016-8