arXiv:2410.00232cs.LGcs.NA2024-10被引 6

揭示预处理如何加速训练,统一解释优化与正则化机制

Preconditioning for Accelerated Gradient Descent Optimization and Regularization

  • 用海森矩阵条件数分析预处理加速原理
  • 证明AdamW本质是选择内在参数做正则化
  • 适用于理解优化器设计与正则化搭配的研学者

加速训练算法如自适应学习率(或预处理)和各类归一化方法广泛应用但理解不充分。引入正则化后,标准优化器如自适应学习率可能失效,促使人们探索替代方案如AdamW,并思考如何合理结合正则化与预处理。本文基于预处理理论解决这些问题:(1) 解释AdaGrad、RMSProp和Adam通过改善海森矩阵条件数加速训练;(2) 探讨$L_2$-正则化与预处理的交互,证明AdamW等价于在底层内在参数上进行正则化,并推导出对$L_1$-正则化的推广;(3) 展示输入归一化、批归一化、层归一化等方法通过改善海森矩阵条件数加速训练。本分析提供统一数学框架,用于理解各类加速技术或设计合适的正则化方案。

原文摘要 · Abstract (English)

Accelerated training algorithms, such as adaptive learning rates (or preconditioning) and various normalization methods, are widely used but not fully understood. When regularization is introduced, standard optimizers like adaptive learning rates may not perform effectively. This raises the need for alternative regularization approaches such as AdamW and the question of how to properly combine regularization with preconditioning. In this paper, we address these challenges using the theory of preconditioning as follows: (1) We explain how AdaGrad, RMSProp, and Adam accelerates training through improving Hessian conditioning; (2) We explore the interaction between $L_2$-regularization and preconditioning, demonstrating that AdamW amounts to selecting the underlying intrinsic parameters for regularization, and we derive a generalization for the $L_1$-regularization; and (3) We demonstrate how various normalization methods such as input data normalization, batch normalization, and layer normalization accelerate training by improving Hessian conditioning. Our analysis offers a unified mathematical framework for understanding various acceleration techniques or deriving appropriate regularization schemes.

优化算法正则化预处理理论分析

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。