Sciweavers

908 search results - page 31 / 182
» Stochastic Finite Learning
Sort
View
ML
2002
ACM
127views Machine Learning» more  ML 2002»
13 years 8 months ago
Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...
Gunnar Rätsch, Ayhan Demiriz, Kristin P. Benn...
AI
2002
Springer
13 years 8 months ago
Multiagent learning using a variable learning rate
Learning to act in a multiagent environment is a difficult problem since the normal definition of an optimal policy no longer applies. The optimal policy at any moment depends on ...
Michael H. Bowling, Manuela M. Veloso
ALT
1998
Springer
14 years 29 days ago
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
Valery N. Shevchenko, Nikolai Yu. Zolotykh
ALT
2005
Springer
14 years 5 months ago
Monotone Conditional Complexity Bounds on Future Prediction Errors
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true ...
Alexey V. Chernov, Marcus Hutter
ICML
1999
IEEE
14 years 9 months ago
Monte Carlo Hidden Markov Models: Learning Non-Parametric Models of Partially Observable Stochastic Processes
We present a learning algorithm for non-parametric hidden Markov models with continuous state and observation spaces. All necessary probability densities are approximated using sa...
Sebastian Thrun, John Langford, Dieter Fox