On regularized polynomial functional regression
arXiv:2311.03036 · doi:10.1016/j.jco.2024.101853
Abstract
This article offers a comprehensive treatment of polynomial functional regression, culminating in the establishment of a novel finite sample bound. This bound encompasses various aspects, including general smoothness conditions, capacity conditions, and regularization techniques. In doing so, it extends and generalizes several findings from the context of linear functional regression as well. We also provide numerical evidence that using higher order polynomial terms can lead to an improved performance.
arXiv comment26 pages
References in corpus (7)
- Functional linear regression analysis for longitudinal data
- Prediction in functional linear regression
- Methodology and convergence rates for functional linear regression
- A reproducing kernel Hilbert space approach to functional linear regression
- Distributed learning with regularized least squares
- Optimal Rates for Spectral Algorithms with Least-Squares Regression over Hilbert Spaces
- A test of significance in functional quadratic regression