263 search results - page 3 / 53 » Regret Bounds for Prediction Problems |
168
click to vote
SIGMOD
2012
ACM
13 years 6 months ago
2012
ACM
We study the notion of regret ratio proposed in [19] to deal with multi-criteria decision making in database systems. The regret minimization query proposed in [19] was shown to h...
145
click to vote
COLT
2005
Springer
15 years 5 months ago
2005
Springer
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 ...
151
click to vote
ESA
2005
Springer
15 years 9 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
162
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multiarmed bandit problem, where the payoff function is ...
133
click to vote
COLT
2008
Springer
15 years 5 months ago
2008
Springer
We study on-line decision problems where the set of actions that are available to the decision algorithm vary over time. With a few notable exceptions, such problems remained larg...