中文
相关论文

相关论文: BPPSA: Scaling Back-propagation by Parallel Scan A…

200 篇论文

A mathematical characterization of serially-pruned permutations (SPPs) employed in variable-length permuters and their associated fast pruning algorithms and architectures are proposed. Permuters are used in many signal processing systems…

信息论 · 计算机科学 2014-10-21 Mohammad M. Mansour

Backpropagation (BP) of errors is the backbone training algorithm for artificial neural networks (ANNs). It updates network weights through gradient descent to minimize a loss function representing the mismatch between predictions and…

机器学习 · 统计学 2025-08-13 Davide Casnici , Charlotte Frenkel , Justin Dauwels

Deploying deep learning (DL) models across multiple compute devices to train large and complex models continues to grow in importance because of the demand for faster and more frequent training. Data parallelism (DP) is the most widely used…

Benefitting from large-scale training datasets and the complex training network, Convolutional Neural Networks (CNNs) are widely applied in various fields with high accuracy. However, the training process of CNNs is very time-consuming,…

机器学习 · 计算机科学 2019-11-26 Jianguo Chen , Kenli Li , Kashif Bilal , Xu Zhou , Keqin Li , Philip S. Yu

Backpropagation (BP) is the cornerstone of today's deep learning algorithms, but it is inefficient partially because of backward locking, which means updating the weights of one layer locks the weight updates in the other layers.…

神经与进化计算 · 计算机科学 2021-02-10 Yu-Wei Kao , Hung-Hsuan Chen

Constructing states from sequences of observations is an important component of reinforcement learning agents. One solution for state construction is to use recurrent neural networks. Back-propagation through time (BPTT), and real-time…

机器学习 · 计算机科学 2023-11-23 Khurram Javed , Haseeb Shah , Rich Sutton , Martha White

Backpropagation is inherently sequential across depth, creating an $O(K)$-deep dependency chain that bottlenecks parallel training. While parallel-scan formulations theoretically reduce this depth to $O(\log K)$, they are computationally…

机器学习 · 计算机科学 2026-05-12 Shaun Christopher Lee , Sangeetha Abdu Jyothi

Channel Pruning, widely used for accelerating Convolutional Neural Networks, is an NP-hard problem due to the inter-layer dependency of channel redundancy. Existing methods generally ignored the above dependency for computation simplicity.…

机器学习 · 计算机科学 2019-03-28 Yuefu Zhou , Ya Zhang , Yanfeng Wang , Qi Tian

Deep Neural Network (DNN) models are usually trained sequentially from one layer to another, which causes forward, backward and update locking's problems, leading to poor performance in terms of training time. The existing parallel…

分布式、并行与集群计算 · 计算机科学 2022-07-25 Samson B. Akintoye , Liangxiu Han , Huw Lloyd , Xin Zhang , Darren Dancey , Haoming Chen , Daoqiang Zhang

Deep Learning's outstanding track record across several domains has stemmed from the use of error backpropagation (BP). Several studies, however, have shown that it is impossible to execute BP in a real brain. Also, BP still serves as an…

机器学习 · 计算机科学 2021-06-11 Swaroop Mishra , Anjana Arunkumar

Binary Neural Networks (BNNs), which constrain both weights and activations to binary values, offer substantial reductions in computational complexity, memory footprint, and energy consumption. These advantages make them particularly well…

机器学习 · 计算机科学 2026-02-18 Luca Colombo , Fabrizio Pittorino , Daniele Zambon , Carlo Baldassi , Manuel Roveri , Cesare Alippi

Backpropagation (BP) is a core component of the contemporary deep learning incarnation of neural networks. Briefly, BP is an algorithm that exploits the computational architecture of neural networks to efficiently evaluate the gradient of a…

机器学习 · 统计学 2021-07-21 Dirk Ostwald , Franziska Usée

Training recurrent neural networks (RNNs) with standard backpropagation through time (BPTT) can be challenging, especially in the presence of long input sequences. A practical alternative to reduce computational and memory overhead is to…

机器学习 · 计算机科学 2026-02-12 Julian D. Schiller , Malte Heinrich , Victor G. Lopez , Matthias A. Müller

Supercomputers are equipped with an increasingly large number of cores to use computational power as a way of solving problems that are otherwise intractable. Unfortunately, getting serial algorithms to run in parallel to take advantage of…

分布式、并行与集群计算 · 计算机科学 2013-12-31 Faisal N. Abu-Khzam , Khuzaima Daudjee , Amer E. Mouawad , Naomi Nishimura

The ubiquitous backpropagation algorithm requires sequential updates through the network introducing a locking problem. In addition, back-propagation relies on the transpose of forward weight matrices to compute updates, introducing a…

Scaling CNN training is necessary to keep up with growing datasets and reduce training time. We also see an emerging need to handle datasets with very large samples, where memory requirements for training are large. Existing training…

分布式、并行与集群计算 · 计算机科学 2019-03-18 Nikoli Dryden , Naoya Maruyama , Tom Benson , Tim Moon , Marc Snir , Brian Van Essen

A new neural network architecture (PSCNN) is developed to improve performance and speed of such networks. The architecture has all the advantages of the previous models such as self-organization and possesses some other superior…

神经与进化计算 · 计算机科学 2020-08-06 Homayoun Valafar , Faramarz Valafar , Okan Ersoy

The biological implausibility of backpropagation (BP) has motivated many alternative, brain-inspired algorithms that attempt to rely only on local information, such as predictive coding (PC) and equilibrium propagation. However, these…

机器学习 · 计算机科学 2025-12-01 Francesco Innocenti , El Mehdi Achour , Christopher L. Buckley

Deep neural networks are a very powerful tool for many computer vision tasks, including image restoration, exhibiting state-of-the-art results. However, the performance of deep learning methods tends to drop once the observation model used…

图像与视频处理 · 电气工程与系统科学 2020-07-01 Jenny Zukerman , Tom Tirer , Raja Giryes

A major bottleneck in scenario-based Sample Average Approximation (SAA) for stochastic programming (SP) is the cost of solving an exact second-stage problem for every scenario, especially when each scenario contains an NP-hard combinatorial…

最优化与控制 · 数学 2026-05-12 Jingyi Zhao , Linxin Yang , Haohua Zhang , Qile He , Tian Ding