arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.03629cs.LGstat.ML
收藏

利用并行非线性方程求解加速前馈计算

Accelerating Feedforward Computation via Parallel Nonlinear Equation Solving

Stanford University(斯坦福大学);University of Toronto(多伦多大学);Vector Institute(向量研究所)

Yang Song, Chenlin Meng, Renjie Liao, Stefano Ermon

摘要:

前馈计算,例如评估神经网络或从自回归模型采样,在机器学习中无处不在。然而,前馈计算的顺序性需要严格的执行顺序,并且无法通过并行计算轻松加速。为了实现并行化,我们将前馈计算的任务定义为求解非线性方程组。然后,我们建议使用Jacobi或Gauss-Seidel不动点迭代方法以及两者的混合方法来找到解决方案。至关重要的是,Jacobi更新对每个方程独立操作,并且可以并行执行。我们的方法是保证给完全相同的值与原来的前馈计算与减少(或相等)的并行迭代次数,因此减少了足够的并行计算能力的时间。在实验中,我们证明了我们的方法在加速(i)RNN的反向传播,(ii)DenseNets的评估,以及(iii)MADE和PixelCNN++的自回归采样方面的有效性,在各种设置下的加速因子在2.1到26之间。

英文摘要:

Feedforward computation, such as evaluating a neural network or sampling from an autoregressive model, is ubiquitous in machine learning. The sequential nature of feedforward computation, however, requires a strict order of execution and cannot be easily accelerated with parallel computing. To enable parallelization, we frame the task of feedforward computation as solving a system of nonlinear equations. We then propose to find the solution using a Jacobi or Gauss-Seidel fixed-point iteration method, as well as hybrid methods of both. Crucially, Jacobi updates operate independently on each equation and can be executed in parallel. Our method is guaranteed to give exactly the same values as the original feedforward computation with a reduced (or equal) number of parallelizable iterations, and hence reduced time given sufficient parallel computing power. Experimentally, we demonstrate the effectiveness of our approach in accelerating (i) backpropagation of RNNs, (ii) evaluation of DenseNets, and (iii) autoregressive sampling of MADE and PixelCNN++, with speedup factors between 2.1 and 26 under various settings.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑