arrow
返回

Memorized sparse backpropagation

delete2020-11-01
delete6
delete
OA
AI
Z
Zhiyuan Zhang
P
Pengcheng Yang
X
Xuancheng Ren
Q
Qi Su *
X
Xu Sun *
DOI:10.1016/j.neucom.2020.08.055delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Neural network learning is usually time-consuming since backpropagation needs to compute full gradients and backpropagate them across multiple layers. Despite its success of existing works in accelerating propagation through sparseness, the relevant theoretical characteristics remain under-researched and empirical studies found that they suffer from the loss of information contained in unpropagated gradients. To tackle these problems, this paper presents a unified sparse backpropagation framework and provides a detailed analysis of its theoretical characteristics. Analysis reveals that when applied to a multilayer perceptron, our framework essentially performs gradient descent using an estimated gradient similar enough to the true gradient, resulting in convergence in probability under certain conditions. Furthermore, a simple yet effective algorithm named memorized sparse backpropagation (MSBP) is proposed to remedy the problem of information loss by storing unpropagated gradients in memory for learning in the next steps. Experimental results demonstrate that the proposed MSBP is effective to alleviate the information loss in traditional sparse backpropagation while achieving comparable acceleration. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Neural Networks
Backpropagation
Sparse Gradient
Acceleration
AI总结

AI总结

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

期刊

Neurocomputing 封面图
Neurocomputing
IF:
6.5
论文数:
2.5W
被引数:
6.5W

机构

P
peking university
学者数:
11.9W
论文数: 8.7W
被引数: 146
引用论文

引用论文

Acid catalysis in hydrolytic reactions水解反应中的酸催化
err1929-01-01
err0
PREAI
errJ. N. Brönsted; W. F. K. Wynne-Jones
err分享
err收藏
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
学者 查看更多内容