Nonparametric Sparse Tensor Factorization with Hierarchical Gamma Processes
Not on the map. Why?
Abstract (arXiv)
We propose a nonparametric factorization approach for sparsely observed tensors. The sparsity does not mean zero-valued entries are massive or dominated. Rather, it implies the observed entries are very few, and even fewer with the growth of the tensor; this is ubiquitous in practice. Compared with the existent works, our model not only leverages the structural information underlying the observed entry indices, but also provides extra interpretability and flexibility -- it can simultaneously estimate a set of location factors about the intrinsic properties of the tensor nodes, and another set of sociability factors reflecting their extrovert activity in interacting with others; users are free to choose a trade-off between the two types of factors. Specifically, we use hierarchical Gamma processes and Poisson random measures to construct a tensor-valued process, which can freely sample the two types of factors to generate tensors and always guarantees an asymptotic sparsity. We then normalize the tensor process to obtain hierarchical Dirichlet processes to sample each observed entry index, and use a Gaussian process to sample the entry value as a nonlinear function of the factors, so as to capture both the sparse structure properties and complex node relationships. For efficient inference, we use Dirichlet process properties over finite sample partitions, density transformations, and random features to develop a stochastic variational estimation algorithm. We demonstrate the advantage of our method in several benchmark datasets.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 10 of its 65 references that are in the map. First posted on arXiv 19 Oct 2021.
Builds on
10 of 65 references.
References · 10
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2014Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determinationcited by 65
- 2016Bayesian Poisson Tucker Decomposition for Learning the Structure of International Relationscited by 25
- 2014Sparse graphs using exchangeable random measurescited by 20
- 2015Bayesian Poisson Tensor Factorization for Inferring Multilateral Relations from Sparse Dyadic Event Countscited by 19
- 2016Distributed Flexible Nonlinear Tensor Factorizationcited by 15
- 2017Scalable Tucker Factorization for Sparse Tensors - Algorithms and Discoveriescited by 14
- 2014DFacTo: Distributed Factorization of Tensorscited by 8
- 2013Bayesian Conditional Tensor Factorizations for High-Dimensional Classificationcited by 6
- 2015Zero-Truncated Poisson Tensor Factorization for Massive Binary Tensorscited by 3
Built on by
Citing papers per year: 2022: 1; 2023: 3; 2024: 0; 2025: 1; 2026: 1.
6 papers.
- 2022Nonparametric Factor Trajectory Learning for Dynamic Tensor Decompositioncited by 7
- 2023Streaming Factor Trajectory Learning for Temporal Tensor Decompositioncited by 6
- 2023Dynamic Tensor Decomposition via Neural Diffusion-Reaction Processescited by 5
- 2023Graphical Dirichlet Process for Clustering Non-Exchangeable Grouped Datacited by 2
- 2025Score-Based Model for Low-Rank Tensor Recoverycited by 0
- 2026Bayesian Tensor Decomposition with Diffusion Model Priorcited by 0
- 2026Bayesian Tensor Decomposition with Diffusion Model Prior2 Jun 2026
- 2025Score-Based Model for Low-Rank Tensor Recovery27 Jun 2025
- 2023Dynamic Tensor Decomposition via Neural Diffusion-Reaction Processes30 Oct 2023
- 2023Streaming Factor Trajectory Learning for Temporal Tensor Decomposition25 Oct 2023
- 2023Graphical Dirichlet Process for Clustering Non-Exchangeable Grouped Data17 Feb 2023
- 2022Nonparametric Factor Trajectory Learning for Dynamic Tensor Decomposition6 Jul 2022