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...
In this paper, we present a robust feature extraction framework based on informationtheoretic learning. Its formulated objective aims at simultaneously maximizing the Renyi's...
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...
Andreas Argyriou, Charles A. Micchelli, Massimilia...
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...
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...
Prem Melville, Stewart M. Yang, Maytal Saar-Tsecha...