提出SNGD方法,让自然梯度在深层网络中更快更高效。
Reconstructing Deep Neural Networks: Unleashing the Optimization Potential of Natural Gradient Descent
- 用结构化重构网络,把全局费雪矩阵分解为局部计算。
- 实验显示收敛速度比原始NGD快,且效果接近传统方法。
- 适合追求优化效率的深度学习研究者使用。
自然梯度下降(NGD)是强大的机器学习优化技术,但其逆费雪信息矩阵的计算复杂性限制了在训练深层神经网络中的应用。为此,我们提出一种新型优化方法——结构化自然梯度下降(SNGD)。理论上,使用NGD优化原网络等价于用快速梯度下降(GD)优化经过参数矩阵结构变换后的重构网络。基于此,我们在重构网络中构建局部费雪层,将全局费雪信息矩阵的计算分解为高效的局部费雪矩阵计算,从而加速训练。在多种深度网络和数据集上的实验表明,SNGD在保持与NGD相近解质量的同时,收敛速度更快。此外,该方法在效率和有效性上均优于传统梯度下降。因此,所提方法有望显著提升NGD在深度学习应用中的可扩展性和效率。代码已公开于https://github.com/Chaochao-Lin/SNGD。
原文摘要 · Abstract (English)
Natural gradient descent (NGD) is a powerful optimization technique for machine learning, but the computational complexity of the inverse Fisher information matrix limits its application in training deep neural networks. To overcome this challenge, we propose a novel optimization method for training deep neural networks called structured natural gradient descent (SNGD). Theoretically, we demonstrate that optimizing the original network using NGD is equivalent to using fast gradient descent (GD) to optimize the reconstructed network with a structural transformation of the parameter matrix. Thereby, we decompose the calculation of the global Fisher information matrix into the efficient computation of local Fisher matrices via constructing local Fisher layers in the reconstructed network to speed up the training. Experimental results on various deep networks and datasets demonstrate that SNGD achieves faster convergence speed than NGD while retaining comparable solutions. Furthermore, our method outperforms traditional GDs in terms of efficiency and effectiveness. Thus, our proposed method has the potential to significantly improve the scalability and efficiency of NGD in deep learning applications. Our source code is available at https://github.com/Chaochao-Lin/SNGD.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。