348
Views
0
CrossRef citations to date
0
Altmetric
Statistical Learning

Functional Nonlinear Learning

& ORCID Icon
Pages 181-191 | Received 22 Jun 2022, Accepted 23 Jun 2023, Published online: 08 Aug 2023
 

Abstract

Using representations of functional data can be more convenient and beneficial in subsequent statistical models than direct observations. These representations, in a lower-dimensional space, extract and compress information from individual curves. The existing representation learning approaches in functional data analysis usually use linear mapping in parallel to those from multivariate analysis, for example, functional principal component analysis (FPCA). However, functions, as infinite-dimensional objects, sometimes have nonlinear structures that cannot be uncovered by linear mapping. Linear methods will be more overwhelmed by multivariate functional data. For that matter, this article proposes a functional nonlinear learning (FunNoL) method to sufficiently represent multivariate functional data in a lower-dimensional feature space. Furthermore, we merge a classification model for enriching the ability of representations in predicting curve labels. Hence, representations from FunNoL can be used for both curve reconstruction and classification. Additionally, we have endowed the proposed model with the ability to address the missing observation problem as well as to further denoise observations. The resulting representations are robust to observations that are locally disturbed by uncontrollable random noises. We apply the proposed FunNoL method to several real datasets and show that FunNoL can achieve better classifications than FPCA, especially in the multivariate functional data setting. Simulation studies have shown that FunNoL provides satisfactory curve classification and reconstruction regardless of data sparsity. Supplementary materials for this article are available online.

Supplementary Materials

A supplementary document includes the additional application and simulation results, proofs of the generalization bound, and some technical details.

Acknowledgments

The authors would like to thank the editor, the associate editor, and one referee for many insightful comments. These comments are very helpful for us to improve our work.

Disclosure Statement

The authors report there are no competing interests to declare.

Additional information

Funding

This research is supported by the Discovery grant (RGPIN-2023-04057) to J.Cao from the Natural Sciences and Engineering Research Council of Canada (NSERC).

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 180.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.