
arXiv: 2202.02266
Abstract 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.
FOS: Computer and information sciences, Computer Science - Machine Learning, random operators, polynomial convergence, Functional Analysis (math.FA), Machine Learning (cs.LG), Mathematics - Functional Analysis, 46N10, 47B80, 60B10, FOS: Mathematics, Applications of operator theory in optimization, convex analysis, mathematical programming, economics, Convergence of probability measures, Random linear operators, stochastic gradient descent algorithm
FOS: Computer and information sciences, Computer Science - Machine Learning, random operators, polynomial convergence, Functional Analysis (math.FA), Machine Learning (cs.LG), Mathematics - Functional Analysis, 46N10, 47B80, 60B10, FOS: Mathematics, Applications of operator theory in optimization, convex analysis, mathematical programming, economics, Convergence of probability measures, Random linear operators, stochastic gradient descent algorithm
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
