Sciweavers

2980 search results - page 45 / 596
» Learning better together
Sort
View
NN
2010
Springer
187views Neural Networks» more  NN 2010»
14 years 5 months ago
Efficient exploration through active learning for value function approximation in reinforcement learning
Appropriately designing sampling policies is highly important for obtaining better control policies in reinforcement learning. In this paper, we first show that the least-squares ...
Takayuki Akiyama, Hirotaka Hachiya, Masashi Sugiya...
ICML
2005
IEEE
15 years 11 months ago
Active learning for Hidden Markov Models: objective functions and algorithms
Hidden Markov Models (HMMs) model sequential data in many fields such as text/speech processing and biosignal analysis. Active learning algorithms learn faster and/or better by cl...
Brigham Anderson, Andrew Moore
ICML
1996
IEEE
15 years 11 months ago
Unsupervised Learning Using MML
This paper discusses the unsupervised learning problem. An important part of the unsupervised learning problem is determining the numberofconstituent groups (componentsor classes)...
Jonathan J. Oliver, Rohan A. Baxter, Chris S. Wall...
NIPS
1997
14 years 11 months ago
Nonparametric Model-Based Reinforcement Learning
This paper describes some of the interactions of model learning algorithms and planning algorithms we have found in exploring model-based reinforcement learning. The paper focuses...
Christopher G. Atkeson
AAAI
1996
14 years 11 months ago
A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
Roberto J. Bayardo Jr., Daniel P. Miranker