Acceleration of Stochastic Approximation by Averaging
Abstract
A new recursive algorithm of stochastic approximation type with the averaging of trajectories is investigated. Convergence with probability one is proved for a variety of classical optimization and identification problems. It is also demonstrated for these problems that the proposed algorithm achieves the highest possible rate of convergence.
[1] , The Method of Potential Functions in the Machine Learning Theory, Nauka, Moscow, 1970, (In Russian.)
[2] , Multidimensional asymptotically optimal stochastic approximation, problems inform. transmission, 17 (1982), 423–434
[3] , Algorithmes Adaptatifs et Approximations Stochastiques (Théorie et Applications), Masson, Paris, 1987
[4] , Convergence analysis of smoothed stochastic gradient-type algorithm, Internat. J. Systems Sci., 18 (1987), 1061–1078 88c:62132 0627.93080
[5] , Stochastic Programming Methods, Nauka, 1976Moscow, (In Russian.)
[6] , Asymptotically efficient stochastic approximation; the ${\rm RM}$ case, Ann. Statist., 1 (1973), 486–495 52:2086 0258.62048
[7] , On asymptotically efficient recursive estimation, Ann. Statist., 6 (1978), 854–866 57:17983 0378.62031
[8] , Recursive Estimation and Adaptive Filtering, Nauka, Moscow, 1984, (In Russian.)
[9] , Sequential Methods in Pattern Recognition and Machine Learning, Academic Press, New York, London, 1968 0188.52303
[10] , Adaptive Filtering, Prediction and Control, Prentice-Hall, Englewood Cliffs, NJ, 1984 0653.93001
[11] , Stochastic analog of the conjugate gradients method, Cybernetics, N1 (1972), 125–126, (In Russian.)
[12] , Stochastic estimation of the maximum of a regression function, Ann. Math. Statistics, 23 (1952), 462–466 14,299e 0049.36601
[13] , Estimation of parameters of linear and nonlinear stochastic systems using the method of averaged residuals, Automate Remote Control, 46 (1986), 966–974
[14] , Stocastic Recurrent Procedures, Nauka, Moscow, 1981, (In Russian.)
[15] , On multi-step stochastic optimization procedures, Automat. Remote Control, 43 (1982), 606–611
[16] , Stochastic approximation methods for constrained and unconstrained systems, Applied Mathematical Sciences, Vol. 26, Springer-Verlag, New York, 1978x+261 80g:62065 0381.60004
[17] , Martingale Theory, Nauka, Moscow, 1986, (In Russian.) 0654.60035
[18] , Theory and practice of recursive identification, MIT Press Series in Signal Processing, Optimization, and Control, 4, MIT Press, Cambridge, Mass., 1983xx+529 84k:93002 0548.93075
[19] , Informational bounds for gradient stochastic optimization and optimal implemented algorithms, Automat. Remote Control, 50 (1989), 520–531
[20] , Complexity of Problems and Effectiveness of Optimization Methods, Nauka, Moscow, 1980, (In Russian.)
[21] , Stochastic approximation and recursive estimation, American Mathematical Society, Providence, R. I., 1973iv+244 54:11689
[22] , Adaptive Robbins-Monro procedure, Automat. Remote Control, 34 (1974), 1594–1607
[23] , Comparison of convergence rate for single-step and multi-step optimization algorithms in the presence of noise, Engrg. Cybernet., 15 (1977), 6–10
[24] , A new method of stochastic approximation type, Avtomat. i Telemekh., (1990), 98–107 91j:90056
[25] , Introduction to optimization, Translations Series in Mathematics and Engineering, Optimization Software Inc. Publications Division, New York, 1987xxvii+438 92b:49001
[26] , Attainable accuracy of adaptation algorithmsProblems of Cybernetics. Adaptive Systems, Nauka, Moscow, 1976, 6–19, (In Russian.)
[27] , Adaptive estimation algorithms (convergence, optimality, stability), Automat. Remote Control, 40 (1980), 378–389 0418.93077
[28] , Optimal pseudogradient adaptation algorithms, Automat. Remote Control, 41 (1981), 1101–1110 0462.49036
[29] , A stochastic approximation method, Ann. Math. Statistics, 22 (1951), 400–407 13,144j 0054.05901
[30] , J. S. Rustaji, A convergence theorem for non negative almost supermartingales and some applicationsOptimizing methods in statistics (Proc. Sympos., Ohio State Univ., Columbus, Ohio, 1971), Academic Press, New York, 1971, 233–257 49:8097 0286.60025
[31] , A Newton-Raphson version of the multivariate Robbins-Monro procedure, Ann. Statist., 13 (1985), 236–245 86f:62141 0571.62072
[32] , Efficient estimators from a slowly convergent Robbins-Monro process, Tech. Report, 781, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, 1988
[33] , Stochastic approximation method with gradient averaging for unconstrained problems, IEEE Trans. Automat. Control, 28 (1983), 1097–1105 10.1109/TAC.1983.1103184 86b:49041 0533.62076
[34] , A. V. Balakrishnan, Stochastic approximation: A recursive method for solving regression problemsAdvances in Communication Theory and Applications, Vol. 2, Academic Press, New York, London, 1966, 51–106
[35] , Probability, Nauka, Moscow, 1980, (In Russian.)
[36] , Adaptation and learning in automatic systems, Academic Press, New York, 1971xix+291, London 57:4680
[37] , Foundations of Informational Theory of Identification, Nauka, Moscow, 1984, (In Russian.)
[38] , An extension of the Robbins-Monro procedure, Ann. Math. Statist., 38 (1967), 181–190 34:5225 0158.36901
[39] , Convergence and optimality of implementable, adaptation algorithms (informational approach), Problems Inform. Transmission, 20 (1985), 314–326
[40] , Stochastic approximation, Cambridge Tracts in Mathematics and Mathematical Physics, No. 58, Cambridge University Press, London, 1969x+202 40:975 0293.62026