Algorithms of Robust Stochastic Optimization Based on Mirror Descent Method

被引:21
|
作者
Nazin, A., V [1 ]
Nemirovsky, A. S. [2 ]
Tsybakov, A. B. [3 ]
Juditsky, A. B. [4 ]
机构
[1] Russian Acad Sci, Trapeznikov Inst Control Sci, Moscow, Russia
[2] Georgia Inst Technol, Atlanta, GA 30332 USA
[3] ENSAE, CREST, Palaiseau, France
[4] Univ Grenoble Alpes, Grenoble, France
基金
俄罗斯科学基金会;
关键词
robust iterative algorithms; stochastic optimization algorithms; convex composite stochastic optimization; mirror descent method; robust confidence sets; APPROXIMATION ALGORITHMS; CONVERGENCE;
D O I
10.1134/S0005117919090042
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We propose an approach to the construction of robust non-Euclidean iterative algorithms by convex composite stochastic optimization based on truncation of stochastic gradients. For such algorithms, we establish sub-Gaussian confidence bounds under weak assumptions about the tails of the noise distribution in convex and strongly convex settings. Robust estimates of the accuracy of general stochastic algorithms are also proposed.
引用
收藏
页码:1607 / 1627
页数:21
相关论文
共 50 条
  • [31] Distributed mirror descent method with operator extrapolation for stochastic aggregative games
    Wang, Tongyu
    Yi, Peng
    Chen, Jie
    [J]. AUTOMATICA, 2024, 159
  • [32] The ordered subsets mirror descent optimization method with applications to tomography
    Ben-Tal, A
    Margalit, T
    Nemirovski, A
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2001, 12 (01) : 79 - 108
  • [33] Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization
    Chen, Sijia
    Zhang, Yu-Jie
    Tu, Wei-Wei
    Zhao, Peng
    Zhang, Lijun
    [J]. JOURNAL OF MACHINE LEARNING RESEARCH, 2024, 25 : 1 - 62
  • [34] Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization
    Chen, Sijia
    Tu, Wei-Wei
    Zhao, Peng
    Zhang, Lijun
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 202, 2023, 202
  • [35] Accelerated Randomized Coordinate Descent Algorithms for Stochastic Optimization and Online Learning
    Bhandari, Akshita
    Singh, Chandramani
    [J]. LEARNING AND INTELLIGENT OPTIMIZATION, LION 12, 2019, 11353 : 1 - 15
  • [36] BACKWARD ERROR ANALYSIS AND THE QUALITATIVE BEHAVIOUR OF STOCHASTIC OPTIMIZATION ALGORITHMS: APPLICATION TO STOCHASTIC COORDINATE DESCENT
    DI Giovacchino, Stefano
    Higham, Desmond j.
    Zygalakis, Konstantinos c.
    [J]. JOURNAL OF COMPUTATIONAL DYNAMICS, 2024,
  • [37] Parameters Optimization of the Beam Cleanup System Based on Stochastic Parallel Gradient Descent Method
    Wang Sanhong
    Cui Junfeng
    Ma Haotong
    Liang Yonghui
    Yu Qifeng
    [J]. HIGH-POWER LASERS AND APPLICATIONS VI, 2012, 8551
  • [38] A robust adaptive particle swarm optimization for clustering analysis based on steepest descent method
    Sun, Zhichao
    He, Ying
    Wu, Junjie
    Huang, Yulin
    Yang, Jianyu
    [J]. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2017, 32 (01) : 23 - 33
  • [39] Distributed mirror descent method for multi-agent optimization with delay
    Li, Jueyou
    Chen, Guo
    Dong, Zhaoyang
    Wu, Zhiyou
    [J]. NEUROCOMPUTING, 2016, 177 : 643 - 650
  • [40] Accelerated Randomized Mirror Descent Algorithms for Composite Non-strongly Convex Optimization
    Le Thi Khanh Hien
    Cuong V. Nguyen
    Huan Xu
    Canyi Lu
    Jiashi Feng
    [J]. Journal of Optimization Theory and Applications, 2019, 181 : 541 - 566