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 条
  • [21] Distributed stochastic gradient tracking methods with momentum acceleration for non-convex optimization
    Gao, Juan
    Liu, Xin-Wei
    Dai, Yu-Hong
    Huang, Yakui
    Gu, Junhua
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2023, 84 (02) : 531 - 572
  • [22] Stationarity in Nonsmooth Optimization with Switching Constraints
    Shabankareh, Fatemeh Gorgini
    Kanzi, Nader
    Fallahi, Kamal
    Izadi, Javad
    IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION A-SCIENCE, 2022, 46 (03): : 907 - 915
  • [23] Stationarity in Nonsmooth Optimization with Switching Constraints
    Fatemeh Gorgini Shabankareh
    Nader Kanzi
    Kamal Fallahi
    Javad Izadi
    Iranian Journal of Science and Technology, Transactions A: Science, 2022, 46 : 907 - 915
  • [24] Fast proximal algorithms for nonsmooth convex optimization
    Ouorou, Adam
    OPERATIONS RESEARCH LETTERS, 2020, 48 (06) : 777 - 783
  • [25] A DESCENT ALGORITHM FOR NONSMOOTH CONVEX-OPTIMIZATION
    FUKUSHIMA, M
    MATHEMATICAL PROGRAMMING, 1984, 30 (02) : 163 - 175
  • [27] A feasible directions method for nonsmooth convex optimization
    Herskovits, Jose
    Freire, Wilhelm P.
    Fo, Mario Tanaka
    Canelas, Alfredo
    STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2011, 44 (03) : 363 - 377
  • [28] TRUNCATED CODIFFERENTIAL METHOD FOR NONSMOOTH CONVEX OPTIMIZATION
    Bagirov, A. M.
    Ganjehlou, A. Nazari
    Ugon, J.
    Tor, A. H.
    PACIFIC JOURNAL OF OPTIMIZATION, 2010, 6 (03): : 483 - 496
  • [29] A feasible directions method for nonsmooth convex optimization
    José Herskovits
    Wilhelm P. Freire
    Mario Tanaka Fo
    Alfredo Canelas
    Structural and Multidisciplinary Optimization, 2011, 44 : 363 - 377
  • [30] A trust region method for nonsmooth convex optimization
    Sagara, Nobuko
    Fukushima, Masao
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2005, 1 (02) : 171 - 180