Asynchronous stochastic approximations

被引:87
作者
Borkar, VS [1 ]
机构
[1] Indian Inst Sci, Dept Comp Sci & Automat, Bangalore 560012, Karnataka, India
关键词
distributed algorithms; asynchronous algorithms; communication delays; stochastic approximation; ODE limit;
D O I
10.1137/S0363012995282784
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The asymptotic behavior of a distributed, asynchronous stochastic approximation scheme is analyzed in terms of a limiting nonautonomous differential equation. The relation between the latter and the relative values of suitably rescaled relative frequencies of updates of different components is underscored.
引用
收藏
页码:840 / 851
页数:12
相关论文
共 22 条
[1]  
ABOUNADI J, 1996, ANAL Q LEARNING ALGO
[2]  
[Anonymous], 1991, PITMAN RES NOTES MAT
[3]  
Benveniste A, 1990, Adaptive algorithms and stochastic approximations
[4]  
Bertsekas Dimitri P., 1989, PARALLEL DISTRIBUTED
[5]   MANAGING INTERPROCESSOR DELAYS IN DISTRIBUTED RECURSIVE ALGORITHMS [J].
BORKAR, VS ;
PHANSALKAR, VV .
SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 1994, 19 :995-1003
[6]   Distributed computation of fixed points of infinity-nonexpansive maps [J].
Borkar, VS .
PROCEEDINGS OF THE INDIAN ACADEMY OF SCIENCES-MATHEMATICAL SCIENCES, 1996, 106 (03) :289-300
[7]  
BORKAR VS, 1997, IEEE T CIRCUITS SYST, V44, P509
[8]  
CHEN HF, 1994, P 1994 HONG KONG INT, P2
[9]  
FOSTER D, 1990, THEORET POPULATION B, V38, P229
[10]  
Freidlin MI, 1984, RANDOM PERTURBATIONS