Sciweavers

723 search results - page 89 / 145
» Computationally Efficient Transductive Machines
Sort
View
NOMS
2010
IEEE
201views Communications» more  NOMS 2010»
13 years 7 months ago
Checkpoint-based fault-tolerant infrastructure for virtualized service providers
Crash and omission failures are common in service providers: a disk can break down or a link can fail anytime. In addition, the probability of a node failure increases with the num...
Iñigo Goiri, Ferran Julià, Jordi Gui...
ICML
2009
IEEE
14 years 9 months ago
Regularization and feature selection in least-squares temporal difference learning
We consider the task of reinforcement learning with linear value function approximation. Temporal difference algorithms, and in particular the Least-Squares Temporal Difference (L...
J. Zico Kolter, Andrew Y. Ng
ICML
2007
IEEE
14 years 9 months ago
On learning linear ranking functions for beam search
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...
Yuehua Xu, Alan Fern
ICML
2008
IEEE
14 years 9 months ago
Expectation-maximization for sparse and non-negative PCA
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
Christian D. Sigg, Joachim M. Buhmann
ICML
2006
IEEE
14 years 9 months ago
A statistical approach to rule learning
We present a new, statistical approach to rule learning. Doing so, we address two of the problems inherent in traditional rule learning: The computational hardness of finding rule...
Stefan Kramer, Ulrich Rückert