3381 search results - page 163 / 677 » LEO - DB2's LEarning Optimizer |
176
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
An anytime algorithm is capable of returning a response to the given task at essentially any time; typically the quality of the response improves as the time increases. Here, we c...
154
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
In this paper, we present a robust feature extraction framework based on informationtheoretic learning. Its formulated objective aims at simultaneously maximizing the Renyi's...
150
click to vote
COLT
2005
Springer
16 years 20 hour ago
2005
Springer
We study the problem of learning a kernel which minimizes a regularization error functional such as that used in regularization networks or support vector machines. We consider thi...
151
click to vote
ECML
2005
Springer
16 years 16 hour ago
2005
Springer
This paper examines the problem of finding an optimal policy for a Partially Observable Markov Decision Process (POMDP) when the model is not known or is only poorly specified. W...
174
click to vote
ECML
2005
Springer
16 years 16 hour ago
2005
Springer
Active selection of good training examples is an important approach to reducing data-collection costs in machine learning; however, most existing methods focus on maximizing classi...