Sciweavers

908 search results - page 9 / 182
» Interactive regret minimization
Sort
View
129
Voted
ICML
2009
IEEE
16 years 2 months ago
Online feature elicitation in interactive optimization
Most models of utility elicitation in decision support and interactive optimization assume a predefined set of "catalog" features over which user preferences are express...
Craig Boutilier, Kevin Regan, Paolo Viappiani
BCSHCI
2007
15 years 3 months ago
Is an apology enough?: how to resolve trust breakdowns in episodic online interactions
This paper addresses what kind of system allows the victim of a trust breakdown to fairly assess an unintentional offender who is also a benevolent member. Two systems were compar...
Asimina Vasalou, Astrid Hopfensitz, Jeremy Pitt
122
Voted
ECCC
2007
180views more  ECCC 2007»
15 years 1 months ago
Adaptive Algorithms for Online Decision Problems
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
Elad Hazan, C. Seshadhri
CORR
2010
Springer
175views Education» more  CORR 2010»
14 years 8 months ago
On the Combinatorial Multi-Armed Bandit Problem with Markovian Rewards
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
Yi Gai, Bhaskar Krishnamachari, Mingyan Liu