Continuous and Discrete-time Accelerated Stochastic Mirror Descent for Strongly Convex Functions

被引:0
|
作者
Xu, Pan [1 ]
Wang, Tianhao [2 ]
Gu, Quanquan [1 ]
机构
[1] Univ Calif Los Angeles, Dept Comp Sci, Los Angeles, CA 90095 USA
[2] Univ Sci & Technol China, Sch Math Sci, Hefei, Anhui, Peoples R China
来源
INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 80 | 2018年 / 80卷
基金
美国国家科学基金会;
关键词
APPROXIMATION ALGORITHMS; COMPOSITE OPTIMIZATION; MINIMIZATION;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We provide a second-order stochastic differential equation (SDE), which characterizes the continuous-time dynamics of accelerated stochastic mirror descent (ASMD) for strongly convex functions. This SDE plays a central role in designing new discrete-time ASMD algorithms via numerical discretization and providing neat analyses of their convergence rates based on Lyapunov functions. Our results suggest that the only existing ASMD algorithm, namely, AC-SA proposed in Ghadimi & Lan (2012) is one instance of its kind, and we can derive new instances of ASMD with fewer tuning parameters. This sheds light on revisiting accelerated stochastic optimization through the lens of SDEs, which can lead to a better understanding as well as new simpler algorithms of acceleration in stochastic optimization. Numerical experiments on both synthetic and real data support our theory.
引用
收藏
页数:10
相关论文
共 50 条
  • [41] CONVEX STOCHASTIC DOMINANCE WITH CONTINUOUS DISTRIBUTION FUNCTIONS
    FISHBURN, PC
    JOURNAL OF ECONOMIC THEORY, 1974, 7 (02) : 143 - 158
  • [42] Convex Functions on Discrete Time Domains
    Atici, Ferhan M.
    Yaldiz, Hatice
    CANADIAN MATHEMATICAL BULLETIN-BULLETIN CANADIEN DE MATHEMATIQUES, 2016, 59 (02): : 225 - 233
  • [43] Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization
    Chen, Sijia
    Zhang, Yu-Jie
    Tu, Wei-Wei
    Zhao, Peng
    Zhang, Lijun
    JOURNAL OF MACHINE LEARNING RESEARCH, 2024, 25 : 1 - 62
  • [44] Analysis of stochastic gradient descent in continuous time
    Jonas Latz
    Statistics and Computing, 2021, 31
  • [45] Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization
    Chen, Sijia
    Tu, Wei-Wei
    Zhao, Peng
    Zhang, Lijun
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 202, 2023, 202
  • [46] Analysis of stochastic gradient descent in continuous time
    Latz, Jonas
    STATISTICS AND COMPUTING, 2021, 31 (04)
  • [47] Continuous-Time Averaged Models of Discrete-Time Stochastic Systems: Survey and Open Problems
    Fradkov, A. L.
    2011 50TH IEEE CONFERENCE ON DECISION AND CONTROL AND EUROPEAN CONTROL CONFERENCE (CDC-ECC), 2011, : 2076 - 2081
  • [48] Exact Detectability of Discrete-Time and Continuous-Time Linear Stochastic Systems: A Unified Approach
    Dragan, Vasile
    Costa, Eduardo Fontoura
    Popa, Ioan-Lucian
    Aberkane, Samir
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2022, 67 (11) : 5730 - 5745
  • [49] Dynamical Lee-Yang zeros for continuous-time and discrete-time stochastic processes
    Yoshida, Hiroki
    Takahashi, Kazutaka
    PHYSICAL REVIEW E, 2022, 105 (02)
  • [50] Fast and approximative estimation of continuous-time stochastic signals from discrete-time data
    Mossberg, M
    Larsson, EK
    2004 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOL II, PROCEEDINGS: SENSOR ARRAY AND MULTICHANNEL SIGNAL PROCESSING SIGNAL PROCESSING THEORY AND METHODS, 2004, : 529 - 532