Support Vector Machines with Beta-Mixing Input Sequences

This note mainly focuses on a theoretical analysis of support vector machines with beta-mixing input sequences. The explicit bounds are derived on the rate at which the empirical means converge to their true values when the underlying process is beta-mixing. The uniform convergence approach is used to estimate the convergence rates of the support vector machine algorithms with beta-mixing inputs.