Least-square regularized regression with non-iid sampling

We study the least-square regression learning algorithm generated by regularization schemes in reproducing kernel Hilbert spaces. A non-iid setting is considered: the sequence of probability measures for sampling is not identical and the sampling may be dependent. When the sequence of marginal distributions for sampling converges exponentially fast in the dual of a Hِlder space and the sampling process satisfies a polynomial strong mixing condition, we derive learning rates for the learning algorithm.