arXiv:2610.41251v1 Announce Type: cross Abstract: We study the non-asymptotic convergence of Stochastic Mirror Descent (SMD) algorithm when the noisy first-order oracle is driven by dependent observations. Departing from the classical i.i.d. assumption underlying most existing guarantees, we introduce a flexible ``forgetting" condition that accommodates geometrically or polynomially dependent sequences. Under this condition we derive explicit finite-sample accuracy bounds for the averaged SMD iterates, recovering the classical $O(1/T)$ and $O(1/\sqrt{T})$ rates in the large- and small-initial-error regimes. We instantiate the general framework on two applications: high-dimensional linear regression with dependent regressors and nonparametric estimation of the drift function of a functional autoregressive model.