888 search results - page 114 / 178 » Learning to Select a Ranking Function |
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
We formalize the associative bandit problem framework introduced by Kaelbling as a learning-theory problem. The learning environment is modeled as a k-armed bandit where arm payof...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
Recent theoretical results have shown that improved bounds on generalization error of classifiers can be obtained by explicitly taking the observed margin distribution of the trai...
ICRA
2006
IEEE
14 years 2 months ago
2006
IEEE
— Legged robots can, in principle, traverse a large variety of obstacles and terrains. In this paper, we describe a successful application of reinforcement learning to the proble...
NIPS
2004
13 years 9 months ago
2004
The problem of learning a sparse conic combination of kernel functions or kernel matrices for classification or regression can be achieved via the regularization by a block 1-norm...
EUROGP
2010
Springer
14 years 1 months ago
2010
Springer
We describe a data mining framework that derives panelist information from sparse flavour survey data. One component of the framework executes genetic programming ensemble based s...