Robust functional data analysis: From sparse to dense designs

Lingxuan Shao & Fang Yao

Bernoulli2026https://doi.org/10.3150/25-bej1920article
ABDC A
Weight
0.50

Abstract

We propose a new perspective to conduct robust functional data analysis of discretely observed functional data ranging from sparse to dense sampling designs. This analysis caters to processes with various distributions, including heavy-tailed, skewed, or contaminated distributions. We study the robust functional mean (M-location) and introduce a robust dimension reduction method via principal component analysis. Theoretical outcomes for the robust functional mean and eigenfunction estimates, derived from pooled discretely observed data, are elucidated, matching their non-robust counterparts. The established convergence rates for these estimated eigenfunctions, with indices increasing with sample size, pave the way for further modeling and analysis.

Open via your library →

Cite this paper

https://doi.org/https://doi.org/10.3150/25-bej1920

Or copy a formatted citation

@article{lingxuan2026,
  title        = {{Robust functional data analysis: From sparse to dense designs}},
  author       = {Lingxuan Shao & Fang Yao},
  journal      = {Bernoulli},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.3150/25-bej1920},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

Robust functional data analysis: From sparse to dense designs

Flags are reviewed by the Arbiter methodology team within 5 business days.


Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.