908 search results - page 6 / 182 » Interactive regret minimization |
107
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The problem of distributed learning and channel access is considered in a cognitive network with multiple secondary users. The availability statistics of the channels are initially...
122
click to vote
COLT
2010
Springer
14 years 9 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
COLT
1999
Springer
15 years 4 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
ALT
2010
Springer
15 years 1 months ago
2010
Springer
: In many prediction problems, including those that arise in computer security and computational finance, the process generating the data is best modeled as an adversary with whom ...
SIGECOM
2010
ACM
15 years 4 months ago
2010
ACM
Product recommendation and decision support systems must generally develop a model of user preferences by querying or otherwise interacting with a user. Recent approaches to elici...