HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS		QUICK SEARCH:   [advanced] Author: Keyword(s): Year:  Vol:  Page:

This Article Full Text Full Text (PDF) Alert me when this article is cited Alert me if a correction is posted Services Similar articles in this journal Similar articles in PubMed Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by Sato, M.-a. Articles by Ishii, S. Search for Related Content PubMed PubMed Citation Articles by Sato, M.-a. Articles by Ishii, S.

On-line EM Algorithm for the Normalized Gaussian Network

ATR Human Information Processing Research Laboratories, 2-2 Hikaridai, Seika-cho, Soraku-gun, Kyoto 619-0288, Japan

Shin Ishii

Nara Institute of Science and Technology, 8916-5 Takayama-cho, Ikoma-shi, Nara 630-0101, Japan

A normalized gaussian network (NGnet) (Moody & Darken, 1989) is a network of local linear regression units. The model softly partitions the input space by normalized gaussian functions, and each local unit linearly approximates the output within the partition. In this article, we propose a new on-line EM algorithm for the NGnet, which is derived from the batch EM algorithm (Xu, Jordan, & Hinton 1995), by introducing a discount factor. We show that the on-line EM algorithm is equivalent to the batch EM algorithm if a specific scheduling of the discount factor is employed. In addition, we show that the on-line EM algorithm can be considered as a stochastic approximation method to find the maximum likelihood estimator. A new regularization method is proposed in order to deal with a singular input distribution. In order to manage dynamic environments, where the input-output distribution of data changes over time, unit manipulation mechanisms such as unit production, unit deletion, and unit division are also introduced based on probabilistic interpretation. Experimental results show that our approach is suitable for function approximation problems in dynamic environments. We also apply our on-line EM algorithm to robot dynamics problems and compare our algorithm with the mixtures-of-experts family.

This article has been cited by other articles:

				G. Mongillo and S. Deneve Online Learning with Hidden Markov Models Neural Comput., July 1, 2008; 20(7): 1706 - 1716. [Abstract] [Full Text] [PDF]

				H. Fujita and S. Ishii Model-Based Reinforcement Learning for Partially Observable Games with Sampling-Based State Estimation Neural Comput., November 1, 2007; 19(11): 3051 - 3087. [Abstract] [Full Text] [PDF]

				H. SATOH Reinforcement Learning for Continuous Stochastic Actions--An Approximation of Probability Density Function by Orthogonal Wave Function Expansion-- IEICE Trans A: Fundamentals, August 1, 2006; E89-A(8): 2173 - 2180. [Abstract] [PDF]

				M.-a. Sato Online Model Selection Based on the Variational Bayes Neural Comput., July 1, 2001; 13(7): 1649 - 1681. [Abstract] [Full Text]