103 search results - page 3 / 21 » An Asymptotically Optimal Bandit Algorithm for Bounded Suppo... |
COLT
2008
Springer
13 years 7 months ago
2008
Springer
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
FAW
2009
Springer
13 years 10 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
AAAI
2008
13 years 8 months ago
2008
Modern Bayesian Network learning algorithms are timeefficient, scalable and produce high-quality models; these algorithms feature prominently in decision support model development...
FSTTCS
1995
Springer
13 years 9 months ago
1995
Springer
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
COLT
2010
Springer
13 years 3 months ago
2010
Springer
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...