資源簡(jiǎn)介
使用matlab實(shí)現(xiàn) e-geedy 算法,關(guān)于n-armed bandits problem。結(jié)果是產(chǎn)生Reinforcement Learning: An Introduction Figure 2.2 。

代碼片段和文件信息
clear;
N?=?10;
runs?=?2000;
times?=?1000;
ver?=?1;
epsilon?=?0.1;
hold?on;
plot(Tenarmedbandits(Nrunstimes0ver));
plot(Tenarmedbandits(Nrunstimes0.01ver));
plot(Tenarmedbandits(Nrunstimes0.1ver));
legend(‘0‘‘0.01‘‘0.1‘);
?屬性????????????大小?????日期????時(shí)間???名稱
-----------?---------??----------?-----??----
?????文件?????????818??2017-09-12?10:15??e-greedy\Tenarmedbandits.m
?????文件?????????256??2017-09-12?10:16??e-greedy\start.m
?????目錄???????????0??2017-09-12?10:19??e-greedy\
評(píng)論
共有 條評(píng)論