Learning theory estimates with observations from general stationary stochastic processes
Hanyuan Hang, Yunlong Feng, Ingo Steinwart, and Johan A.K. Suykens

TL;DR
This paper develops a unified theoretical framework for analyzing supervised learning algorithms with data from a wide class of stationary stochastic processes, establishing convergence rates and oracle inequalities.
Contribution
It introduces a generalized Bernstein-type inequality to analyze learning schemes with various mixing processes, deriving near-optimal convergence rates for multiple models.
Findings
Optimal learning rates for i.i.d. data recovered
Matching rates for certain mixing processes
Near-optimal rates for remaining cases
Abstract
This paper investigates the supervised learning problem with observations drawn from certain general stationary stochastic processes. Here by \emph{general}, we mean that many stationary stochastic processes can be included. We show that when the stochastic processes satisfy a generalized Bernstein-type inequality, a unified treatment on analyzing the learning schemes with various mixing processes can be conducted and a sharp oracle inequality for generic regularized empirical risk minimization schemes can be established. The obtained oracle inequality is then applied to derive convergence rates for several learning schemes such as empirical risk minimization (ERM), least squares support vector machines (LS-SVMs) using given generic kernels, and SVMs using Gaussian kernels for both least squares and quantile regression. It turns out that for i.i.d.~processes, our learning rates for ERM…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsControl Systems and Identification · Statistical Methods and Inference · Sparse and Compressive Sensing Techniques
