mlsanityData to 7 Oct 2026

MTC: Multiresolution Tensor Completion from Partial and Coarse Observations

arXiv 2106.07135 ↗First posted 14 Jun 2021math.NA cs.LG cs.NAcited by 4

Not on the map. Why?

Abstract (arXiv)

Existing tensor completion formulation mostly relies on partial observations from a single tensor. However, tensors extracted from real-world data are often more complex due to: (i) Partial observation: Only a small subset (e.g., 5%) of tensor elements are available. (ii) Coarse observation: Some tensor modes only present coarse and aggregated patterns (e.g., monthly summary instead of daily reports). In this paper, we are given a subset of the tensor and some aggregated/coarse observations (along one or more modes) and seek to recover the original fine-granular tensor with low-rank factorization. We formulate a coupled tensor completion problem and propose an efficient Multi-resolution Tensor Completion model (MTC) to solve the problem. Our MTC model explores tensor mode properties and leverages the hierarchy of resolutions to recursively initialize an optimization setup, and optimizes on the coupled system using alternating least squares. MTC ensures low computational and space complexity. We evaluate our model on two COVID-19 related spatio-temporal tensors. The experiments show that MTC could provide 65.20% and 75.79% percentage of fitness (PoF) in tensor completion with only 5% fine granular observations, which is 27.96% relative improvement over the best baseline. To evaluate the learned low-rank factors, we also design a tensor prediction task for daily and cumulative disease case predictions, where MTC achieves 50% in PoF and 30% relative improvements over the best baseline.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 11 of its 35 references that are in the map. First posted on arXiv 14 Jun 2021.

Builds on

11 of 35 references.

References · 11

  1. 2016Tensor Decomposition for Signal Processing and Machine Learningcited by 223
  2. 2019Deep Learning for Spatio-Temporal Data Mining: A Surveycited by 171
  3. 2018Canonical Tensor Decomposition for Knowledge Base Completioncited by 150
  4. 2017Tensor Completion Algorithms in Big Data Analyticscited by 48
  5. 2018Generalized Canonical Polyadic Tensor Decompositioncited by 34
  6. 2019LSAR: Efficient Leverage Score Sampling Algorithm for the Analysis of Big Time Series Datacited by 8
  7. 2020STELAR: Spatio-temporal Tensor Factorization with Latent Epidemiological Regularizationcited by 7
  8. 2020SWIFT: Scalable Wasserstein Factorization for Sparse Nonnegative Tensorscited by 6
  9. 2020Multiresolution Tensor Learning for Efficient and Interpretable Spatial Analysiscited by 5
  10. 2019PREMA: Principled Tensor Data Recovery from Multiple Aggregated Viewscited by 2
  11. 2020Coupled Tensor Decomposition for Hyperspectral and Multispectral Image Fusion with Inter-Image Variabilitycited by 1

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 2.

4 papers.