Sciweavers

429 search results - page 61 / 86
» Noisy Turing Machines
Sort
View
ICML
2009
IEEE
15 years 10 months ago
Approximate inference for planning in stochastic relational worlds
Relational world models that can be learned from experience in stochastic domains have received significant attention recently. However, efficient planning using these models rema...
Tobias Lang, Marc Toussaint
ICML
2009
IEEE
15 years 10 months ago
A simpler unified analysis of budget perceptrons
The kernel Perceptron is an appealing online learning algorithm that has a drawback: whenever it makes an error it must increase its support set, which slows training and testing ...
Ilya Sutskever
ICML
2008
IEEE
15 years 10 months ago
Fast Gaussian process methods for point process intensity estimation
Point processes are difficult to analyze because they provide only a sparse and noisy observation of the intensity function driving the process. Gaussian Processes offer an attrac...
John P. Cunningham, Krishna V. Shenoy, Maneesh Sah...
ICML
2006
IEEE
15 years 10 months ago
Connectionist temporal classification: labelling unsegmented sequence data with recurrent neural networks
Many real-world sequence learning tasks require the prediction of sequences of labels from noisy, unsegmented input data. In speech recognition, for example, an acoustic signal is...
Alex Graves, Faustino J. Gomez, Jürgen Schmid...
ICML
2004
IEEE
15 years 10 months ago
Boosting grammatical inference with confidence oracles
In this paper we focus on the adaptation of boosting to grammatical inference. We aim at improving the performances of state merging algorithms in the presence of noisy data by us...
Jean-Christophe Janodet, Richard Nock, Marc Sebban...