Answers are grounded in this paper and cite their sources.
We study the convergence of a random iterative sequence of a family of operators on infinite-dimensional Hilbert spaces, inspired by the stochastic gradient descent (SGD) algorithm in the case of the noiseless regression. We identify conditions that are strictly broader than previously known for polynomial convergence rate in various norms, and characterize the roles the randomness plays in determining the best multiplicative constants. Additionally, we prove almost sure convergence of the sequence.
No takes yet. Share an insight, caveat, or question.
Ghosh et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: