Keywords
RegretHindsight biasBounded functionVariation (astronomy)Artificial intelligenceComputer scienceCertaintyOnline learningMachine learningAdvice (programming)Adversarial systemVettingMathematicsMathematical optimization
Affiliated Institutions
Related Publications
Incorporating contextual information in recommender systems using a multidimensional approach
The article presents a multidimensional (MD) approach to recommender systems that can provide recommendations based on additional contextual information besides the typical info...
Genetic Algorithms in Search, Optimization and Machine Learning
David Goldberg's Genetic Algorithms in Search, Optimization and Machine Learning is by far the bestselling introduction to genetic algorithms. Goldberg is one of the preeminent ...
Performance evaluation of genetic algorithms for flowshop scheduling problems
The aim of this paper is to evaluate the performance of genetic algorithms for the flowshop scheduling problem with an objective of minimizing the makespan. First we examine var...
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...
Deep neural networks are easily fooled: High confidence predictions for unrecognizable images
Deep neural networks (DNNs) have recently been achieving state-of-the-art performance on a variety of pattern-recognition tasks, most notably visual classification problems. Giv...
Publication Info
- Year
- 2010
- Type
- article
- Volume
- 80
- Issue
- 2-3
- Pages
- 165-188
- Citations
- 93
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
93
OpenAlex
Cite This
Elad Hazan,
Satyen Kale
(2010).
Extracting certainty from uncertainty: regret bounded by variation in costs.
Machine Learning
, 80
(2-3)
, 165-188.
https://doi.org/10.1007/s10994-010-5175-x
Identifiers
- DOI
- 10.1007/s10994-010-5175-x