Sciweavers

83 search results - page 2 / 17
» Online Learning: Beyond Regret
Sort
View
COLT
2008
Springer
13 years 8 months ago
Extracting Certainty from Uncertainty: Regret Bounded by Variation in Costs
Prediction from expert advice is a fundamental problem in machine learning. A major pillar of the field is the existence of learning algorithms whose average loss approaches that ...
Elad Hazan, Satyen Kale
COLT
2005
Springer
13 years 9 months ago
From External to Internal Regret
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
Avrim Blum, Yishay Mansour
SOFSEM
2010
Springer
14 years 3 months ago
Regret Minimization and Job Scheduling
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
Yishay Mansour
SODA
2010
ACM
371views Algorithms» more  SODA 2010»
14 years 4 months ago
Online Learning with Queries
The online learning problem requires a player to iteratively choose an action in an unknown and changing environment. In the standard setting of this problem, the player has to ch...
Chao-Kai Chiang, Chi-Jen Lu
ICML
2008
IEEE
14 years 7 months ago
No-regret learning in convex games
Quite a bit is known about minimizing different kinds of regret in experts problems, and how these regret types relate to types of equilibria in the multiagent setting of repeated...
Geoffrey J. Gordon, Amy R. Greenwald, Casey Marks