4903 search results - page 610 / 981 » The Set Covering Machine |
167
click to vote
IJCNN
2007
IEEE
16 years 1 months ago
2007
IEEE
— Most research in machine learning focuses on scenarios in which a learner faces a single learning task, independently of other learning tasks or prior knowledge. In reality, ho...
194
click to vote
COLT
2007
Springer
16 years 1 months ago
2007
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
186
click to vote
COLT
2007
Springer
16 years 1 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...
174
click to vote
COLT
2007
Springer
16 years 1 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...
248
click to vote
COLT
2007
Springer
16 years 1 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...