.png){kind=icon}
返回
Gradient descent methods in learning classifier systems: Improving XCS performance in multistep problems
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2005.850265.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The accuracy-based XCS classifier system has been shown to solve typical data mining problems in a machine-learning competitive way. However, successful applications in multistep problems, modeled by a Markov decision process, were restricted to very small problems. Until now, the temporal difference learning technique in XCS was based on deterministic updates. However, since a prediction is actually generated by a set of rules in XCS and Learning Classifier Systems in general, gradient-based update methods are applicable. The extension of XCS to gradient-based update methods results in a classifier system that is more robust and more parameter independent, solving large and difficult maze problems reliably. Additionally, the extension to gradient methods highlights the relation of XCS to other function approximation methods in reinforcement learning.
Keyword:
function approximation
gradient descent
learning classifier systems (LCSs)
multistop problems
Q-learning
reinforcement learning
XCS
期刊
IF:
12
论文数:
1.8K
被引数:
2.4W
机构
暂无机构信息
引用论文
Echocardiographic assessment of abnormal left ventricular relaxation in man.超声心动图评估男性异常左心室舒张。.png)
Heart
OAAI
HeartIF0
OAAI分享收藏
查看更多内容