Abstract
Analyzing large-scale functional data poses significant computational challenges due to high costs and substantial data storage needs. Additionally, traditional batch learning algorithms are not well-equipped to manage streaming data effectively. To address these issues, we propose a fully online learning algorithm designed for functional linear regression, which models the linear relationship between a scalar response and a functional predictor. Our approach employs Tikhonov regularization schemes within the framework of reproducing kernel Hilbert spaces (RKHS). A key feature of this fully online algorithm is its polynomially decaying regularization parameter, which adapts dynamically at each learning step, distinguishing it from the partially online algorithm that uses a fixed parameter. Within the functional linear model framework, we establish sufficient conditions for the convergence of the fully online algorithm in the RKHS norm. Additionally, we employ a capacity-independent approach to derive error bounds and almost sure convergence rates for both prediction and estimation, achieved through careful selection of step sizes and regularization parameters.
Funding Information
  • Shantou University Scientific Research Start up Fund (NTF18022)
  • Research Grants Council of Hong Kong (HKBU12302923)
  • Research Grants Council of Hong Kong (12303024)
  • Guangdong Basic and Applied Basic Research Fund (2024A1515011878)
  • Hong Kong Baptist University (RC-FNRA-IG/22-23/SCI/02)
  • Fundamental and Interdisciplinary Disciplines Breakthrough Plan of the Ministry of Education of China (JYB2025XDXM103XX)
  • National Key Research and Development Program of China (2025YFA1016800)
  • National Natural Science Foundation of China (12271473)