首页> 外文会议>International conference on neural information processing;ICONIP 2009 >An Incremental Learning Algorithm for Resource Allocating Networks Based on Local Linear Regression
【24h】

An Incremental Learning Algorithm for Resource Allocating Networks Based on Local Linear Regression

机译:基于局部线性回归的资源分配网络增量学习算法

获取原文

摘要

To learn things incrementally without the catastrophic interference, we have proposed Resource Allocating Network with Long-Term Memory (RAN-LTM). In RAN-LTM, not only training data but also memory items stored in long-term memory are trained. In this paper, we propose an extended RAN-LTM called Resource Allocating Network by Local Linear Regression (RAN-LLR), in which its centers are not trained but selected based on output errors and the connections are updated by solving a linear regression problem. To reduce the computation and memory costs, the modified connections are restricted based on RBF activity. In the experiments, we first apply RAN-LLR to a one-dimensional function approximation problem to see how the negative interference is effectively suppressed. Then, the performance of RAN-LLR is evaluated for a real-world prediction problem. The experimental results demonstrate that the proposed RAN-LLR can learn fast and accurately with less memory costs compared with the conventional models.
机译:为了在没有灾难性干扰的情况下逐步学习事物,我们提出了带有长期内存的资源分配网络(RAN-LTM)。在RAN-LTM中,不仅训练数据,而且训练长期存储器中存储的存储项目。在本文中,我们提出了一种扩展的RAN-LTM,称为通过局部线性回归的资源分配网络(RAN-LLR),其中其中心未经训练,而是根据输出误差进行选择,并且通过解决线性回归问题来更新连接。为了减少计算和内存成本,基于RBF活动限制了修改后的连接。在实验中,我们首先将RAN-LLR应用于一维函数逼近问题,以了解如何有效抑制负干扰。然后,针对实际预测问题评估RAN-LLR的性能。实验结果表明,与传统模型相比,所提出的RAN-LLR可以快速,准确地学习,并且具有较少的存储成本。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号