首页> 外文会议>IEEE International Conference on Cognitive Informatics Cognitive Computing >Model-based polynomial function approximation with spiking neural networks
【24h】

Model-based polynomial function approximation with spiking neural networks

机译:尖峰神经网络的基于模型的多项式函数逼近

获取原文

摘要

Artificial neural networks are known to perform function approximation but with increasingly large non-redundant input spaces, the number of required neurons grows drastically. Functions have to be sampled densely leading to large data sets which imposes problems for applications such as neurorobotics, and requires a long time for training. Furthermore, they perform poorly on extrapolation as there are no model assumptions about the target function. This paper presents a novel network architecture of spiking neural networks for efficient model-based function approximation and prediction based on the concept of multivariate polynomial function approximation. This approach reduces the number of both training samples and required neurons, provides generalization and extrapolation depending on the chosen basis, and is capable of supervised learning. The network is implemented using the Neural Engineering Framework in the Nengo simulator and is centered around a mechanism for efficiently computing products of many input signals. We present the construction of the compound network, performance evaluation and propose a use case of its application.
机译:众所周知,人工神经网络可以执行功能逼近,但是随着非冗余输入空间的增大,所需神经元的数量急剧增加。必须对功能进行密集采样,从而导致大数据集,这给诸如神经机器人的应用程序带来了问题,并且需要很长时间进行训练。此外,由于没有关于目标函数的模型假设,因此它们在外推上的表现较差。基于多元多项式函数逼近的概念,本文提出了一种新型的尖峰神经网络结构,用于基于模型的函数逼近和预测。这种方法减少了训练样本和所需神经元的数量,根据选择的基础进行了概括和外推,并且能够进行监督学习。该网络是使用Nengo模拟器中的神经工程框架实现的,并且围绕一种有效地计算许多输入信号乘积的机制而集中。我们介绍了复合网络的构建,性能评估,并提出了其应用的用例。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号