OPTIMAL ALGORITHMS OF STOCHASTIC APPROXIMATION TYPE

被引:0
|
作者
STRATONOVICH, RL
机构
来源
ENGINEERING CYBERNETICS | 1970年 / 01期
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:20 / +
页数:1
相关论文
共 50 条
  • [1] OPTIMAL STOCHASTIC APPROXIMATION ALGORITHMS FOR STRONGLY CONVEX STOCHASTIC COMPOSITE OPTIMIZATION, II: SHRINKING PROCEDURES AND OPTIMAL ALGORITHMS
    Ghadimi, Saeed
    Lan, Guanghui
    SIAM JOURNAL ON OPTIMIZATION, 2013, 23 (04) : 2061 - 2089
  • [2] OPTIMAL AND ROBUST KERNEL ALGORITHMS FOR PASSIVE STOCHASTIC-APPROXIMATION
    NAZIN, AV
    POLYAK, BT
    TSYBAKOV, AB
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (05) : 1577 - 1583
  • [3] RATES OF CONVERGENCE FOR STOCHASTIC-APPROXIMATION TYPE ALGORITHMS
    KUSHNER, HJ
    HUANG, H
    SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1979, 17 (05) : 607 - 617
  • [4] Robust algorithms of the type of stochastic approximation (continuous time)
    Lototskii, SV
    THEORY OF PROBABILITY AND ITS APPLICATIONS, 1996, 40 (02) : 309 - 328
  • [5] Optimal convergence rate of the randomized algorithms of stochastic approximation in arbitrary noise
    Granichin, ON
    AUTOMATION AND REMOTE CONTROL, 2003, 64 (02) : 252 - 262
  • [6] Optimal Convergence Rate of the Randomized Algorithms of Stochastic Approximation in Arbitrary Noise
    O. N. Granichin
    Automation and Remote Control, 2003, 64 : 252 - 262
  • [7] Approximation algorithms for stochastic clustering
    Harris, David G.
    Li, Shi
    Pensyl, Thomas
    Srinivasan, Aravind
    Khoa Trinh
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018), 2018, 31
  • [8] Randomized Stochastic Approximation Algorithms
    Amelin, Konstantin
    Granichin, Oleg
    Granichina, Olga
    2014 EUROPEAN CONTROL CONFERENCE (ECC), 2014, : 2827 - 2832
  • [9] Approximation algorithms for stochastic clustering
    Harris, David G.
    Li, Shi
    Pensyl, Thomas
    Srinivasan, Aravind
    Trinh, Khoa
    JOURNAL OF MACHINE LEARNING RESEARCH, 2019, 20
  • [10] Dynamics of stochastic approximation algorithms
    Benaïm, M
    SEMINAIRE DE PROBABILITES XXXIII, 1999, 1709 : 1 - 68