Bot-Nguyen Acceleration, Weighted Mean Ergodic Iteration, and the Beta-Binomial Distribution
Abstract
In 2023, Bot and Nguyen introduced a new class of accelerated algorithms for finding a fixed point of a nonexpansive operator as the weak limit of a sequence. In this paper, we analyze a particular instance of their algorithm when the nonexpansive operator is assumed to be linear. Surprisingly, the Bot-Nguyen acceleration then fits naturally into the framework of weighted mean ergodic iterations. This allows us to identify the weak limit as the projection of the starting point onto the fixed point set. Moreover, the weights involved are closely related to the beta-binomial distribution. Finally, when the parameter is equal to 4, then we obtain strong convergence of the iterates.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.