Abstract
To motivate the results of this chapter, consider the classical strong law of large numbers: Let \(\{X_n\}\) be i.i.d. random variables with \(E\left[ X_n\right] = \mu , E\left[ X_n^2\right] < \infty \).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Basak, G. K., Hu, I., & Wei, C.-Z. (1997). Weak convergence of recursions. Stochastic Processes and Their Applications, 68(1), 65–82.
Benveniste, A., Metivier, M., & Priouret, P. (1990). Adaptive algorithms and stochastic approximation. Berlin - New York: Springer.
Billingsley, P. (1968). Convergence of probability measures. New York: Wiley.
Borkar, V. S. (1995). Probability theory: An advanced course. New York: Springer.
Borkar, V., Chen, S., Devraj, A., Kontoyiannis, I. & Meyn, S. (2021). The ODE method for asymptotic statistics in stochastic approximation and reinforcement learning. ar**v:2110.14427.
Chung, K. L. (1954). On a stochastic approximation method. Annals of Mathematical Statistics, 25, 463–483.
Dupuis, P. (1988). Large deviations analysis of some recursive algorithms with state-dependent noise. Annals of Probability, 16(4), 1509–1536.
Dupuis, P., & Kushner, H. J. (1989). Stochastic approximation and large deviations: upper bounds and w. p. 1 convergence. SIAM Journal on Control and Optimization, 27(5), 1108–1135.
Fabian, V. (1968). On asymptotic normality in stochastic approximation. Annals of Mathematical Statistics, 39(4), 1327–1332.
Gerencsér, L. (1992). Rate of convergence of recursive estimators. SIAM Journal on Control and Optimization, 30(5), 1200–1227.
Hsieh, M.-H., & Glynn, P. W. (2002). Confidence regions for stochastic approximation algorithms. Proceedings of the Winter Simulation Conference, 1, 370–376.
Joslin, J. A., & Heunis, A. J. (2000). Law of the iterated logarithm for a constant-gain linear stochastic gradient algorithm. SIAM Journal on Control and Optimization, 39(2), 533–570.
Kailath, T. (1980). Linear systems. Englewood Cliffs, NJ: Prentice Hall.
Karatzas, I., & Shreve, S. (1998). Brownian motion and stochastic calculus (2nd ed.). New York: Springer Verlag.
Lai, T. L., & Robbins, H. (1978). Limit theorems for weighted sums and stochastic approximation processes. Proceedings National Academy of Sciences USA, 75, 1068–1070.
Pelletier, M. (1998). On the almost sure asymptotic behaviour of stochastic algorithms. Stochastic Processes and Their Applications, 78(2), 217–244.
Pelletier, M. (1999). An almost sure central limit theorem for stochastic approximation algorithms. Journal of Multivariate Analysis, 71(1), 76–93.
Pezeshki-Esfahani, H., & Heunis, A. J. (1997). Strong diffusion approximations for recursive stochastic algorithms. IEEE Transactions on Information Theory, 43(2), 512–523.
Sacks, J. (1958). Asymptotic distribution of stochastic approximation procedures. The Annals of Mathematical Statistics, 29(2), 373–405.
Solo, V. (1982). Stochastic approximation and the final value theorem. Stochastic Processes and their Applications, 13(2), 139–156.
Solo, V. (1982). Stochastic approximation with dependent noise. Stochastic Processes and their Applications, 13(2), 157–170.
Stroock, D. W., & Varadhan, S. R. S. (1979). Multidimensional diffusion processes. New York: Springer.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2023 Hindustan Book Agency
About this chapter
Cite this chapter
Borkar, V.S. (2023). A Limit Theorem for Fluctuations. In: Stochastic Approximation: A Dynamical Systems Viewpoint. Texts and Readings in Mathematics, vol 48. Springer, Singapore. https://doi.org/10.1007/978-981-99-8277-6_7
Download citation
DOI: https://doi.org/10.1007/978-981-99-8277-6_7
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-99-8276-9
Online ISBN: 978-981-99-8277-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)