7378 search results - page 1076 / 1476 » Introduction to Machine Learning |
230
click to vote
COLT
2010
Springer
15 years 4 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...
197
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of finding the best arm in a stochastic multi-armed bandit game. The regret of a forecaster is here defined by the gap between the mean reward of the optim...
177
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
One of the most widely used techniques for data clustering is agglomerative clustering. Such algorithms have been long used across many different fields ranging from computational...
193
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
We analyze the regret, measured in terms of log loss, of the maximum likelihood (ML) sequential prediction strategy. This "follow the leader" strategy also defines one o...
176
Voted
COLT
2010
Springer
15 years 4 months ago
2010
Springer
In the present paper, we introduce a variant of Gold-style learners that is not required to infer precise descriptions of the languages in a class, but that must find descriptive ...