arXiv:2503.04204cs.CVcs.LG2025-03

融合一阶与二阶优化,提升效率且保证收敛性。

FUSE: First-Order and Second-Order Unified SynthEsis in Stochastic Optimization

  • 统一框架下动态切换一阶与二阶优化
  • 计算复杂度低于SGD和Adam,理论可证明
  • 适合追求高效训练的深度学习研究者

随机优化方法在现代机器学习中发挥关键作用。尽管已有诸多方法,一阶与二阶方法仍处于不同境地:一阶方法在新兴深度学习中占据主导,但仅能收敛至驻点;二阶方法因高计算开销,在高维问题中不受欢迎。本文提出一种新方法FUSE,将一阶与二阶方法统一于一个算法框架中,并推导出实用版本FUSE-PV。该方法通过动态切换实现高效优化,同时设计了多种切换判断准则。理论上,FUSE-PV的计算复杂度低于SGD和Adam。通过在多个简单测试函数上的消融实验及基准数据集的对比,验证了所提方案的有效性。

原文摘要 · Abstract (English)

Stochastic optimization methods have actively been playing a critical role in modern machine learning algorithms to deliver decent performance. While numerous works have proposed and developed diverse approaches, first-order and second-order methods are in entirely different situations. The former is significantly pivotal and dominating in emerging deep learning but only leads convergence to a stationary point. However, second-order methods are less popular due to their computational intensity in large-dimensional problems. This paper presents a novel method that leverages both the first-order and second-order methods in a unified algorithmic framework, termed FUSE, from which a practical version (PV) is derived accordingly. FUSE-PV stands as a simple yet efficient optimization method involving a switch-over between first and second orders. Additionally, we develop different criteria that determine when to switch. FUSE-PV has provably shown a smaller computational complexity than SGD and Adam. To validate our proposed scheme, we present an ablation study on several simple test functions and show a comparison with baselines for benchmark datasets.

优化算法随机优化深度学习

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