arrow
返回

A new EM-based training algorithm for RBF networks

delete2003-01-01
delete32
PRE
AI
M
Marcelino Lázaro
I
Ignacio Santamarı́a
DOI:10.1016/S0893-6080(02)00215-0delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In this paper, we propose a new Expectation-Maximization (EM) algorithm which speeds up the training of feedforward networks with local activation functions such as the Radial Basis Function (RBF) network. In previously proposed approaches, at each E-step the residual is decomposed equally among the units or proportionally to the weights of the output layer. However, these approaches tend to slow down the training of networks with local activation units. To overcome this drawback in this paper we use a new E-step which applies a soft decomposition of the residual among the units. In particular, the decoupling variables are estimated as the posterior probability of a component given an input-output pattern. This adaptive decomposition takes into account the local nature of the activation function and, by allowing the RBF units to focus on different subregions of the input space, the convergence is improved. The proposed EM training algorithm has been applied to the nonlinear modeling of a MESFET transistor. (C) 2002 Elsevier Science Ltd. All rights reserved.
Keyword:
radial basis functions
generalized radial basis functions
expectation-maximization
training
MESFET
intermodulation
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Neural Networks 封面图
Neural Networks
IF:
6.3
论文数:
7.8K
被引数:
3.0W

机构

暂无机构信息