Sciweavers

14895 search results - page 6 / 2979
» Evaluating The Regret System
Sort
View
EWRL
2008
13 years 9 months ago
Optimistic Planning of Deterministic Systems
If one possesses a model of a controlled deterministic system, then from any state, one may consider the set of all possible reachable states starting from that state and using any...
Jean-François Hren, Rémi Munos
AI
2006
Springer
13 years 7 months ago
Constraint-based optimization and utility elicitation using the minimax decision criterion
In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which multiple users have distinct preferences. However, making su...
Craig Boutilier, Relu Patrascu, Pascal Poupart, Da...
CORR
2004
Springer
103views Education» more  CORR 2004»
13 years 7 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...
TIT
1998
96views more  TIT 1998»
13 years 7 months ago
Sequential Prediction of Individual Sequences Under General Loss Functions
Abstract— We consider adaptive sequential prediction of arbitrary binary sequences when the performance is evaluated using a general loss function. The goal is to predict on each...
David Haussler, Jyrki Kivinen, Manfred K. Warmuth
CP
2003
Springer
14 years 23 days ago
Constraint-Based Optimization with the Minimax Decision Criterion
Abstract. In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which users have preferences. We consider the problem of...
Craig Boutilier, Relu Patrascu, Pascal Poupart, Da...