Learning for Control: L₁-error Bounds for Kernel-based Regression

We consider functional regression models with noisy outputs resulting from linear transformations. In the setting of regularization theory in Reproducing Kernel Hilbert Spaces (RKHSs), much work has been devoted to build uncertainty bounds around kernel-based estimates, hence characterizing their convergence rates. Such results are typically formulated using either the average squared loss for the prediction or the RKHS norm. However, in signal processing and in emerging areas like learning for control , measuring the estimation error through the <tex-math notation="LaTeX">L₁</tex-math> norm is often more advantageous. This can e.g. provide insights on the convergence rate in the Laplace/Fourier domain whose role is crucial in the analysis of dynamical systems. For this reason, we consider all the RKHSs <tex-math notation="LaTeX">H</tex-math> associated to Lebesgue measurable positive-definite kernels which induce subspaces of <tex-math notation="LaTeX">L₁</tex-math> , also known as stable RKHSs in the literature. The inclusion <tex-math notation="LaTeX">H ⊂ L₁</tex-math> is then characterized. This permits to convert all the error bounds which depend on the RKHS norm in terms of the <tex-math notation="LaTeX">L₁</tex-math> norm. We also show that our result is optimal: there does not exist any better reformulation of the bounds in <tex-math notation="LaTeX">L₁</tex-math> than the one here presented.