首页> 外文OA文献 >A Fast Neural Network Learning Algorithm with Approximate Singular Value Decomposition
【2h】

A Fast Neural Network Learning Algorithm with Approximate Singular Value Decomposition

机译:具有近似奇异值分解的快速神经网络学习算法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

The learning of neural networks is becoming more and more important. Researchers have constructed dozens of learning algorithms, but it is still necessary to develop faster, more flexible, or more accurate learning algorithms. With fast learning we can examine more learning scenarios for a given problem, especially in the case of meta-learning. In this article we focus on the construction of a much faster learning algorithm and its modifications, especially for nonlinear versions of neural networks. The main idea of this algorithm lies in the usage of fast approximation of the Moore–Penrose pseudo-inverse matrix. The complexity of the original singular value decomposition algorithm is O(mn2). We consider algorithms with a complexity of O(mnl),where l
机译:神经网络的学习变得越来越重要。研究人员建造了数十种学习算法,但仍然有必要开发更快,更灵活或更准确的学习算法。快速学习,我们可以针对特定问题检查更多的学习场景,特别是在元学习的情况下。在本文中,我们专注于构建更快的学习算法及其修改,特别是对于神经网络的非线性版本。该算法的主要思想在于使用摩尔彭六伪逆矩阵的快速近似的使用。原始奇异值分解算法的复杂性是O(MN2)。我们考虑具有O(MNL)的复杂性的算法,其中L

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号