Almost sure convergence rates for linear algorithmsare symmetric, positive semidefinite random matrices and {b k } ∞ k=1 are random vectors. It is shown that |hn − A −1 b| = o(n −γ ) a.s. for the γ ∈ [0, χ), positive definite A and vector b such that, 1 , these assumptions are implied by the Marcinkiewicz strong law of large numbers, which allows the {A k } and {b k } to have heavytails, long-range dependence or both. Finally, corroborating experimental outcomes and decreasing-gain design considerations are provided.Primary 60F15, 62L20, 62L12; secondary 62J05, 41A25.