44 search results - page 8 / 9 » colt 2007 |
129
click to vote
COLT
2007
Springer
15 years 10 months ago
2007
Springer
In the standard model of observational learning, n agents sequentially decide between two alternatives a or b, one of which is objectively superior. Their choice is based on a stoc...
136
click to vote
COLT
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
130
click to vote
COLT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Considering one-dimensional continuum-armed bandit problems, we propose an improvement of an algorithm of Kleinberg and a new set of conditions which give rise to improve...
182
click to vote
COLT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We study online regret minimization algorithms in a bicriteria setting, examining not only the standard notion of regret to the best expert, but also the regret to the av...
120
click to vote
COLT
2006
Springer
15 years 7 months ago
2006
Springer
U-shaped learning is a learning behaviour in which the learner first learns a given target behaviour, then unlearns it and finally relearns it. Such a behaviour, observed by psych...