Abstract
The stochastic approximation problem is to find some root or minimum of a nonlinear function in the presence of noisy measurements. The classical algorithm for stochastic approximation problem is the Robbins-Monro (RM) algorithm, which uses the noisy negative gradient direction as the iterative direction. In order to accelerate the classical RM algorithm, this paper gives a new combined direction stochastic approximation algorithm which employs a weighted combination of the current noisy negative gradient and some former noisy negative gradient as iterative direction. Both the almost sure convergence and the asymptotic rate of convergence of the new algorithm are established. Numerical experiments show that the new algorithm outperforms the classical RM algorithm.
Similar content being viewed by others
References
Robbins H., Monro S.: A stochastic approximation method. Ann. Math. Stat. 22, 400–407 (1951)
Fabian V.: On asymptotic normality in stochastic approximation. Ann. Math. Stat. 39, 1327–1332 (1968)
Wasan, M.: Stochastic Approximation. Cambridge University Press (1970).
Nevel’son M.B., Khas’minskij R.Z.: Stochastic Approximation and Recursive Estimation. American Mathematical Society, Providence (1973)
Blum J.R.: Multidimensional stochastic approximation methods. Ann. Math. Stat. 25, 737–744 (1954)
Kiefer J., Wolfowitz J.: Stochastic estimation of the modulus of a regression function. Ann. Math. Stat. 23, 462–466 (1952)
Kushner H.J., Clark D.S.: Stochastic Approximation for Constrained and Unconstrained Systems. Springer (1978).
Spall J.C.: Multivariate stochastic approximation using a simultanoues perturbation gradient approximation. IEEE Trans. Automat. Contr. 37, 332–341 (1992)
Kesten H.: Accelerated stochastic approximation. Ann. Math. Stat. 29, 41–59 (1958)
Delyon B., Juditsky A.: Accelerated stochastic approximation. SIAM J. Optim. 3, 868–881 (1993)
Spall, J.C.: Introduction to Stochastic Search and Optimization. Wiley (2003).
Dai, Y.H., Yuan, Y.: Nonlinear Conjugate Gradient Methods, Shanghai Scientific and Technical Publishers (2000). (in Chinese)
Bertsekas D.P., Tsitsiklis J.N.: Gradient convergence in gradient methods with errors. SIAM J. Optim. 10, 627–642 (2003)
Moré J.J., Garbow B.S., Hillstrom K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7, 17–41 (1981)
Spall J.C.: Adaptive stochastic approximation by the simultaneous perturbation method. IEEE Trans. Automat. Contr. 45, 1839–1853 (2000)
Schraudolph, N.N., Graepel, T.: Combining conjugate direction methods with stochastic approximation of gradients. In: Proceedings of the 9th International Workshop on Artificial Intelligence and Statistics, Key West, FL, pp. 7–13 (2002)
Xu Z., Dai Y.H.: A stochastic approximation frame algorithm with adaptive directions. Numer. Math. Theory Methods Appl. 1, 460–474 (2008)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Xu, Z. A combined direction stochastic approximation algorithm. Optim Lett 4, 117–129 (2010). https://doi.org/10.1007/s11590-009-0139-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-009-0139-4