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 条
  • [41] CONVERGENCE OF AN INEXACT ALGORITHM FOR COMPOSITE NONSMOOTH OPTIMIZATION
    WRIGHT, SJ
    IMA JOURNAL OF NUMERICAL ANALYSIS, 1990, 10 (03) : 299 - 321
  • [42] Global Convergence of ADMM in Nonconvex Nonsmooth Optimization
    Wang, Yu
    Yin, Wotao
    Zeng, Jinshan
    JOURNAL OF SCIENTIFIC COMPUTING, 2019, 78 (01) : 29 - 63
  • [44] Difference convex optimization techniques in nonsmooth computational mechanics
    Stavroulakis, GE
    Polyakova, LN
    OPTIMIZATION METHODS & SOFTWARE, 1996, 7 (01): : 57 - 81
  • [45] Parallel Successive Convex Approximation for Nonsmooth Nonconvex Optimization
    Razaviyayn, Meisam
    Hong, Mingyi
    Luo, Zhi-Quan
    Pang, Jong-Shi
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 27 (NIPS 2014), 2014, 27
  • [46] A Class of Alternating Linearization Algorithms for Nonsmooth Convex Optimization
    Dan LI
    Jie SHEN
    Yuan LU
    Li-Ping PANG
    Zun-Quan XIA
    Acta Mathematicae Applicatae Sinica, 2019, 35 (02) : 435 - 443
  • [47] A variable metric method for nonsmooth convex constrained optimization
    Peng, Yehui
    Liu, Zhenhai
    APPLIED MATHEMATICS AND COMPUTATION, 2006, 183 (02) : 961 - 971
  • [48] A doubly stabilized bundle method for nonsmooth convex optimization
    Welington de Oliveira
    Mikhail Solodov
    Mathematical Programming, 2016, 156 : 125 - 159
  • [49] Lagrange optimality system for a class of nonsmooth convex optimization
    Jin, B.
    Takeuchi, T.
    OPTIMIZATION, 2016, 65 (06) : 1151 - 1166
  • [50] Exponentially Fast Distributed Coordination for Nonsmooth Convex Optimization
    Niederlaender, Simon K.
    Allgoewer, Frank
    Cortes, Jorge
    2016 IEEE 55TH CONFERENCE ON DECISION AND CONTROL (CDC), 2016, : 1036 - 1041