Functional Data Analysis with Increasing Number of Projections
Stefan Fremdt, Lajos Horv\'ath, Piotr Kokoszka, Josef G. Steinebach

TL;DR
This paper explores the behavior of functional principal component projections as their number increases, developing a framework for more robust inference in functional data analysis by considering limits as the number of components tends to infinity.
Contribution
It introduces a novel framework for analyzing the asymptotic behavior of functional data projections as the number of FPCs increases, leading to more stable inference procedures.
Findings
Derived a normal approximation for the partial sum process of FPC scores.
Developed change-point and two-sample tests based on the new framework.
Validated the methods through simulations and real data analysis.
Abstract
Functional principal components (FPC's) provide the most important and most extensively used tool for dimension reduction and inference for functional data. The selection of the number, d, of the FPC's to be used in a specific procedure has attracted a fair amount of attention, and a number of reasonably effective approaches exist. Intuitively, they assume that the functional data can be sufficiently well approximated by a projection onto a finite-dimensional subspace, and the error resulting from such an approximation does not impact the conclusions. This has been shown to be a very effective approach, but it is desirable to understand the behavior of many inferential procedures by considering the projections on subspaces spanned by an increasing number of the FPC's. Such an approach reflects more fully the infinite-dimensional nature of functional data, and allows to derive procedures…
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.
