Nonparametric Factor Trajectory Learning for Dynamic Tensor Decomposition
Not on the map. Why?
Abstract (arXiv)
Tensor decomposition is a fundamental framework to analyze data that can be represented by multi-dimensional arrays. In practice, tensor data is often accompanied by temporal information, namely the time points when the entry values were generated. This information implies abundant, complex temporal variation patterns. However, current methods always assume the factor representations of the entities in each tensor mode are static, and never consider their temporal evolution. To fill this gap, we propose NONparametric FActor Trajectory learning for dynamic tensor decomposition (NONFAT). We place Gaussian process (GP) priors in the frequency domain and conduct inverse Fourier transform via Gauss-Laguerre quadrature to sample the trajectory functions. In this way, we can overcome data sparsity and obtain robust trajectory estimates across long time horizons. Given the trajectory values at specific time points, we use a second-level GP to sample the entry values and to capture the temporal relationship between the entities. For efficient and scalable inference, we leverage the matrix Gaussian structure in the model, introduce a matrix Gaussian posterior, and develop a nested sparse variational learning algorithm. We have shown the advantage of our method in several real-world applications.
Key facts. Cited by 7 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 6 Jul 2022.
Builds on
11 of 35 references.
References · 11
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2013Auto-Encoding Variational Bayescited by 3,980
- 2013Gaussian Processes for Big Datacited by 377
- 2017Doubly Stochastic Variational Inference for Deep Gaussian Processescited by 143
- 2016Bayesian Poisson Tucker Decomposition for Learning the Structure of International Relationscited by 25
- 2015Bayesian Poisson Tensor Factorization for Inferring Multilateral Relations from Sparse Dyadic Event Countscited by 19
- 2016Distributed Flexible Nonlinear Tensor Factorizationcited by 15
- 2020Dynamic Tensor Recommender Systemscited by 12
- 2014DFacTo: Distributed Factorization of Tensorscited by 8
- 2021Nonparametric Sparse Tensor Factorization with Hierarchical Gamma Processescited by 6
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 3; 2026: 2.
7 papers.
- 2024Lightweight Pixel Difference Networks for Efficient Visual Representation Learningcited by 17
- 2025Generating Full-field Evolution of Physical Dynamics from Irregular Sparse Observationscited by 8
- 2023SiBBlInGS: Similarity-driven Building-Block Inference using Graphs across Statescited by 5
- 2025Functional Complexity-adaptive Temporal Tensor Decompositioncited by 2
- 2026Multi-Integration of Labels across Categories for Component Identification (MILCCI)cited by 1
- 2025Score-Based Model for Low-Rank Tensor Recoverycited by 0
- 2026StreamPhy: Streaming Inference of High-Dimensional Physical Dynamics via State Space Modelscited by 0
- 2026StreamPhy: Streaming Inference of High-Dimensional Physical Dynamics via State Space Models8 May 2026
- 2026Multi-Integration of Labels across Categories for Component Identification (MILCCI)4 Feb 2026
- 2025Score-Based Model for Low-Rank Tensor Recovery27 Jun 2025
- 2025Generating Full-field Evolution of Physical Dynamics from Irregular Sparse Observations14 May 2025
- 2025Functional Complexity-adaptive Temporal Tensor Decomposition10 Feb 2025
- 2024Lightweight Pixel Difference Networks for Efficient Visual Representation Learning1 Feb 2024
- 2023SiBBlInGS: Similarity-driven Building-Block Inference using Graphs across States7 Jun 2023