Gradient Descent Algorithm in Hilbert Spaces under Stationary Markov Chains with $\ddot{I}•$- and ${\hat{I}}^2$-Mixing

Abstract

In this paper, we study a strictly stationary Markov chain gradient descent algorithm operating in general Hilbert spaces. Our analysis focuses on the mixing coefficients of the underlying process, specifically the $\ddot{I}•$- and ${\hat{I}}^2$-mixing coefficients. Under these assumptions, we derive probabilistic upper bounds on the convergence behavior of the algorithm based on the exponential as well as the polynomial decay of the mixing coefficients.