Abstract
Functional tensor decomposition can analyze multidimensional data with real-valued indices, paving the path for applications in machine learning and signal processing. A limitation of existing approaches is the assumption that the tensor rank—a critical parameter governing model complexity—is known. However, determining the optimal rank is a nondeterministic polynomial-time hard (NP-hard) task and there is a limited understanding regarding the expressive power of functional low-rank tensor models for continuous signals.We propose a rank-revealing functional Bayesian tensor completion (RRFBTC) method. Modeling the latent functions through carefully designed multioutput Gaussian processes, RR-FBTC handles tensors with real-valued indices while enabling automatic tensor rank determination during the inference process. We establish the universal approximation property of the model for continuous multi-dimensional signals, demonstrating its expressive power in a concise format. To learn this model, we employ the variational inference framework and derive an efficient algorithm with closed-form updates. Experiments on both synthetic and realworld datasets demonstrate the effectiveness and superiority of the RR-FBTC over state-of-the-art approaches.
Funding Information
  • National Natural Science Foundation of China (62371418)
  • Fundamental Research Funds for the Central Universities (226-2025-00168)
  • Shenzhen Science and Technology Program (JCYJ20220530143806016)
  • European Commission (101136568 - HERON)

This publication has 48 references indexed in Scilit: