Adaptive functional principal components analysis
Sunny G.W. Wang, Valentin Patilea, Nicolas Klutchnikoff

TL;DR
This paper introduces an adaptive kernel smoothing method for functional principal components analysis, providing explicit risk bounds, refined bandwidth selection, and demonstrating effectiveness through simulations and real data application.
Contribution
It develops a new adaptive smoothing technique tailored for FPCA, with explicit risk bounds and efficient bandwidth rules, improving over existing methods.
Findings
Provides explicit risk bounds for eigen-elements
Develops refined, computationally efficient bandwidth rules
Demonstrates effectiveness through simulations and real data
Abstract
Functional data analysis almost always involves smoothing discrete observations into curves, because they are never observed in continuous time and rarely without error. Although smoothing parameters affect the subsequent inference, data-driven methods for selecting these parameters are not well-developed, frustrated by the difficulty of using all the information shared by curves while being computationally efficient. On the one hand, smoothing individual curves in an isolated, albeit sophisticated way, ignores useful signals present in other curves. On the other hand, bandwidth selection by automatic procedures such as cross-validation after pooling all the curves together quickly become computationally unfeasible due to the large number of data points. In this paper we propose a new data-driven, adaptive kernel smoothing, specifically tailored for functional principal components…
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.
Taxonomy
TopicsStatistical Methods and Inference · Advanced Statistical Methods and Models · Bayesian Methods and Mixture Models
