Momentum Acceleration in the Individual Convergence of Nonsmooth Convex Optimization With Constraints

被引:11
|
作者
Tao, Wei [1 ]
Wu, Gao-Wei [2 ,3 ]
Tao, Qing [4 ]
机构
[1] Army Engn Univ PLA, Coll Command & Control Engn, Nanjing 210007, Peoples R China
[2] Chinese Acad Sci, Inst Automat, Beijing 100190, Peoples R China
[3] Univ Chinese Acad Sci, Sch Artificial Intelligence, Beijing 100049, Peoples R China
[4] Army Acad Artillery & Air Def, Hefei 230031, Peoples R China
关键词
Heavy-ball (HB) methods; individual convergence; machine learning; momentum methods; nonsmooth optimization; sparsity;
D O I
10.1109/TNNLS.2020.3040325
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Momentum technique has recently emerged as an effective strategy in accelerating convergence of gradient descent (GD) methods and exhibits improved performance in deep learning as well as regularized learning. Typical momentum examples include Nesterov's accelerated gradient (NAG) and heavy-ball (HB) methods. However, so far, almost all the acceleration analyses are only limited to NAG, and a few investigations about the acceleration of HB are reported. In this article, we address the convergence about the last iterate of HB in nonsmooth optimizations with constraints, which we name individual convergence. This question is significant in machine learning, where the constraints are required to impose on the learning structure and the individual output is needed to effectively guarantee this structure while keeping an optimal rate of convergence. Specifically, we prove that HB achieves an individual convergence rate of O(1/root t), where t is the number of iterations. This indicates that both of the two momentum methods can accelerate the individual convergence of basic GD to be optimal. Even for the convergence of averaged iterates, our result avoids the disadvantages of the previous work in restricting the optimization problem to be unconstrained as well as limiting the performed number of iterations to be predefined. The novelty of convergence analysis presented in this article provides a clear understanding of how the HB momentum can accelerate the individual convergence and reveals more insights about the similarities and differences in getting the averaging and individual convergence rates. The derived optimal individual convergence is extended to regularized and stochastic settings, in which an individual solution can be produced by the projection-based operation. In contrast to the averaged output, the sparsity can be reduced remarkably without sacrificing the theoretical optimal rates. Several real experiments demonstrate the performance of HB momentum strategy.
引用
收藏
页码:1107 / 1118
页数:12
相关论文
共 50 条
  • [1] Individual Convergence of Projected Dual Averaging Methods in Nonsmooth Convex Cases
    Qu J.
    Bao L.
    Tao Q.
    Moshi Shibie yu Rengong Zhineng/Pattern Recognition and Artificial Intelligence, 2021, 34 (01): : 25 - 32
  • [2] Neural network for nonsmooth pseudoconvex optimization with general convex constraints
    Bian, Wei
    Ma, Litao
    Qin, Sitian
    Xue, Xiaoping
    NEURAL NETWORKS, 2018, 101 : 1 - 14
  • [3] The Strength of Nesterov's Extrapolation in the Individual Convergence of Nonsmooth Optimization
    Tao, Wei
    Pan, Zhisong
    Wu, Gaowei
    Tao, Qing
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2020, 31 (07) : 2557 - 2568
  • [4] A general approach to convergence properties of some methods for nonsmooth convex optimization
    Birge, JR
    Qi, L
    Wei, Z
    APPLIED MATHEMATICS AND OPTIMIZATION, 1998, 38 (02): : 141 - 158
  • [5] A General Approach to Convergence Properties of Some Methods for Nonsmooth Convex Optimization
    J. R. Birge
    L. Qi
    Z. Wei
    Applied Mathematics and Optimization, 1998, 38 : 141 - 158
  • [6] Hypodifferentials of Nonsmooth Convex Functions and their Applications to Nonsmooth Convex Optimization
    Dolgopolik, Maksim V.
    JOURNAL OF CONVEX ANALYSIS, 2025, 32 (04) : 1255 - 1298
  • [7] Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
    Iiduka, Hideaki
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 253 (02) : 503 - 513
  • [8] Distributed Multiproximal Algorithm for Nonsmooth Convex Optimization With Coupled Inequality Constraints
    Huang, Yi
    Meng, Ziyang
    Sun, Jian
    Ren, Wei
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2023, 68 (12) : 8126 - 8133
  • [9] Stochastic Halfspace Approximation Method for Convex Optimization With Nonsmooth Functional Constraints
    Singh, Nitesh Kumar
    Necoara, Ion
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2025, 70 (01) : 479 - 486
  • [10] Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
    Iiduka, H.
    OPTIMIZATION METHODS & SOFTWARE, 2016, 31 (05): : 931 - 951