Efficient Covariance Estimation for Sparsified Functional Data
Not on the map. Why?
Abstract (arXiv)
Motivated by recent work involving the analysis of leveraging spatial correlations in sparsified mean estimation, we present a novel procedure for constructing covariance estimator. The proposed Random-knots (Random-knots-Spatial) and B-spline (Bspline-Spatial) estimators of the covariance function are computationally efficient. Asymptotic pointwise of the covariance are obtained for sparsified individual trajectories under some regularity conditions. Our proposed nonparametric method well perform the functional principal components analysis for the case of sparsified data, where the number of repeated measurements available per subject is small. In contrast, classical functional data analysis requires a large number of regularly spaced measurements per subject. Model selection techniques, such as the Akaike information criterion, are used to choose the model dimension corresponding to the number of eigenfunctions in the model. Theoretical results are illustrated with Monte Carlo simulation experiments. Finally, we cluster multi-domain data by replacing the covariance function with our proposed covariance estimator during PCA.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 20 of its 39 references that are in the map. First posted on arXiv 23 Nov 2025.
Builds on
20 of 39 references.
References · 20
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,462
- 2019XLNet: Generalized Autoregressive Pretraining for Language Understandingcited by 2,801
- 2018Sparsified SGD with Memorycited by 373
- 2017Six Challenges for Neural Machine Translationcited by 334
- 2018The Convergence of Sparsified Gradient Methodscited by 228
- 2020Unsupervised Domain Clusters in Pretrained Language Modelscited by 160
- 2016Distributed Mean Estimation with Limited Communicationcited by 134
- 2019Domain Robustness in Neural Machine Translationcited by 64
- 2021Covariance-Aware Private Mean Estimation Without Private Covariance Estimationcited by 46
8 more
- 2021Rethinking gradient sparsification as total error minimizationcited by 41
- 2019Domain Adaptation of Neural Machine Translation by Lexicon Inductioncited by 33
- 2014On Communication Cost of Distributed Statistical Estimation and Dimensionalitycited by 24
- 2013Sparse PCA via Covariance Thresholdingcited by 21
- 2019Unsupervised Domain Adaptation for Neural Machine Translation with Domain-Aware Feature Embeddingscited by 14
- 2019Domain Differential Adaptation for Neural Machine Translationcited by 10
- 2021The Complexity of Sparse Tensor PCAcited by 7
- 2021Leveraging Spatial and Temporal Correlations in Sparsified Mean Estimationcited by 7
Built on by
Not cited yet.