כתבה
arXiv cs.LG ·
Generalized Least Squares Kernelized Tensor Factorization
תקציר מקורי באנגליתarXiv:2412.07041v4 Announce Type: replace-cross Abstract: Recovering incomplete multidimensional tensor-structured data is a fundamental task in many real-world applications. Smoothness-constrained low-rank tensor factorization effectively captures global and long-range correlations, but often struggles to characterize short-scale, high-frequency, or locally varying structures. We propose GLSKF, a complementary Generalized Least Squares Kernelized Tensor Factorization framework, for multidimensional spatiotemporal data completion. GLSKF additively integrates a covariance-regularized low-rank global component with an explicitly modeled locally correlated residual component under a GLS objective, enabling effective modeling of both global dependencies and localized variations. A covariance n
קרא במקור המקורי
arxiv.org
פתח כתבה מקורית