Sciweavers

80 search results - page 12 / 16
» Efficient Reinforcement Learning Using Recursive Least-Squar...
Sort
View
BMCBI
2006
146views more  BMCBI 2006»
13 years 7 months ago
Recursive gene selection based on maximum margin criterion: a comparison with SVM-RFE
Background: In class prediction problems using microarray data, gene selection is essential to improve the prediction accuracy and to identify potential marker genes for a disease...
Satoshi Niijima, Satoru Kuhara
IJCNN
2008
IEEE
14 years 1 months ago
Learning to select relevant perspective in a dynamic environment
— When an agent observes its environment, there are two important characteristics of the perceived information. One is the relevance of information and the other is redundancy. T...
Zhihui Luo, David A. Bell, Barry McCollum, Qingxia...
ATAL
2008
Springer
13 years 9 months ago
Sigma point policy iteration
In reinforcement learning, least-squares temporal difference methods (e.g., LSTD and LSPI) are effective, data-efficient techniques for policy evaluation and control with linear v...
Michael H. Bowling, Alborz Geramifard, David Winga...
ML
2002
ACM
100views Machine Learning» more  ML 2002»
13 years 7 months ago
Structure in the Space of Value Functions
Solving in an efficient manner many different optimal control tasks within the same underlying environment requires decomposing the environment into its computationally elemental ...
David J. Foster, Peter Dayan
ENTCS
2010
111views more  ENTCS 2010»
13 years 4 months ago
Fundamental Nano-Patterns to Characterize and Classify Java Methods
Fundamental nano-patterns are simple, static, binary properties of Java methods, such as ObjectCreator and Recursive. We present a provisional catalogue of 17 such nano-patterns. ...
Jeremy Singer, Gavin Brown, Mikel Luján, Ad...