Sciweavers

96 search results - page 9 / 20
» Adding Reinforcement Learning Features to the Neural-Gas Met...
Sort
View
AIPS
2007
13 years 10 months ago
Discovering Relational Domain Features for Probabilistic Planning
In sequential decision-making problems formulated as Markov decision processes, state-value function approximation using domain features is a critical technique for scaling up the...
Jia-Hong Wu, Robert Givan
ICCBR
2010
Springer
13 years 11 months ago
Reducing the Memory Footprint of Temporal Difference Learning over Finitely Many States by Using Case-Based Generalization
In this paper we present an approach for reducing the memory footprint requirement of temporal difference methods in which the set of states is finite. We use case-based generaliza...
Matt Dilts, Héctor Muñoz-Avila
AAAI
2011
12 years 7 months ago
End-User Feature Labeling via Locally Weighted Logistic Regression
Applications that adapt to a particular end user often make inaccurate predictions during the early stages when training data is limited. Although an end user can improve the lear...
Weng-Keen Wong, Ian Oberst, Shubhomoy Das, Travis ...
JMLR
2006
124views more  JMLR 2006»
13 years 7 months ago
A Direct Method for Building Sparse Kernel Learning Algorithms
Many kernel learning algorithms, including support vector machines, result in a kernel machine, such as a kernel classifier, whose key component is a weight vector in a feature sp...
Mingrui Wu, Bernhard Schölkopf, Gökhan H...
ILP
2003
Springer
14 years 24 days ago
A Comparative Evaluation of Feature Set Evolution Strategies for Multirelational Boosting
Boosting has established itself as a successful technique for decreasing the generalization error of classification learners by basing predictions on ensembles of hypotheses. Whil...
Susanne Hoche, Stefan Wrobel