|
Hokkaido University Collection of Scholarly and Academic Papers >
Theses >
博士 （情報科学） >
A Robust Self-Constructing Normalized Gaussian Network for Online Machine Learning
|
Files in This Item:
|
|
|
Related Items in HUSCAP:
|
| Title: | A Robust Self-Constructing Normalized Gaussian Network for Online Machine Learning |
| Other Titles: | オンライン機械学習のための頑健な自己構築正規化ガウスネットワーク |
| Authors: | Backhus, Jana Cathrin Browse this author |
| Issue Date: | 23-Mar-2017 |
| Publisher: | Hokkaido University |
| Abstract: | In this thesis, I aim to improve the robustness and applicability of Normalized Gaussian networks (NGnet) in the context of online machine learning tasks. A challenging problem in online machine learning is the limited domain knowledge provoked by restricted prior knowledge, while additional information are received only sequentially over time. The limited domain knowledge makes the application of artificial neural networks (ANN) more difficult, and major challenges include negative interference and the selection of an accurate model complexity. In this thesis, I consider these challenges in regard to the NGnet, which belongs to a group of ANNs that possess a certain grade of robustness against negative interference due to the local properties of their network architecture. Yet, further improvements of robustness are necessary in regard to the ANN’s learning algorithm and model complexity selection. A recently proposed learning algorithm with localized forgetting provides robustness against negative interference, but it is not applicable over the full numerical range of an implied discount factor. Also, dynamic model selection was yet to be considered. Therefore, I revise the localized forgetting approach and adapt dynamic model selection to it in a self-constructing manner. Dynamic model selection has been considered for an earlier learning algorithm of the NGnet with global forgetting, which however shows a non-robust behavior in negative interference prone environments. Then, I propose localization of some of the model selection mechanisms to improve their robustness and add a new merge manipulation to deal with model redundancies. The effectiveness of the proposed method is compared with earlier learning approaches of the NGnet for several experiments. The proposed method possesses robust and favorable performance in the different tested learning environments, making it the better alternative when applied to online learning tasks with proneness to negative interference. |
| Conffering University: | 北海道大学 |
| Degree Report Number: | 甲第12624号 |
| Degree Level: | 博士 |
| Degree Discipline: | 情報科学 |
| Examination Committee Members: | (主査) 教授 杉本 雅則, 教授 工藤 峰一, 教授 今井 英幸, 准教授 瀧川 一学 |
| Degree Affiliation: | 情報科学研究科（情報理工学専攻） |
| Type: | theses (doctoral) |
| URI: | http://hdl.handle.net/2115/65449 |
| Appears in Collections: | 学位論文 (Theses) > 博士 （情報科学）
課程博士 (Doctorate by way of Advanced Course) > 情報科学院(Graduate School of Information Science and Technology)
|
|
