強化学習問題のための分布推定アルゴリズム
スポンサーリンク
概要
- 論文の詳細を見る
Estimation of Distribution Algorithms (EDAs) are a promising evolutionary computation method. Due to the use of probabilistic models, EDAs can outperform conventional evolutionary computation. In this paper, EDAs are extended to solve reinforcement learning problems which are a framework for autonomous agents. In the reinforcement learning problems, we have to find out better policy of agents such that it yields a large amount of reward for the agents in the future. In general, such policy can be represented by conditional probabilities of agents actions, given the perceptual inputs. In order to estimate such a conditional probability distribution, Conditional Random Fields (CRFs) by Lafferty (2001) are introduced into EDAs. The reason why CRFs are adopted is that CRFs are able to learn conditional probabilistic distributions from a large amount of input-output data, i.e., episodes in the case of reinforcement learning problems. Computer simulations on Probabilistic Transition Problems and Perceptual Aliasing Maze Problems show the effectiveness of EDA-RL.
論文 | ランダム
- Compressed Channel Sensing for Two-way Relay Network
- LS-12 乾燥ひじきの製造方法(ランチョンセミナー,第62回日本生物工学会大会)
- LS-11 霧島のプレミアムG-tasteの造り(ランチョンセミナー,第62回日本生物工学会大会)
- LS-9 次世代シーケンサーの菌叢解析への応用(ランチョンセミナー,第62回日本生物工学会大会)
- LS-7 発酵大麦エキスが有する機能性の紹介 : 微生物からヒトまで(ランチョンセミナー,第62回日本生物工学会大会)