Efficient Nonnegative Tensor Factorization via Saturating Coordinate Descent
arXiv:2003.03572 · doi:10.1145/3385654
Abstract
With the advancements in computing technology and web-based applications, data is increasingly generated in multi-dimensional form. This data is usually sparse due to the presence of a large number of users and fewer user interactions. To deal with this, the Nonnegative Tensor Factorization (NTF) based methods have been widely used. However existing factorization algorithms are not suitable to process in all three conditions of size, density, and rank of the tensor. Consequently, their applicability becomes limited. In this paper, we propose a novel fast and efficient NTF algorithm using the element selection approach. We calculate the element importance using Lipschitz continuity and propose a saturation point based element selection method that chooses a set of elements column-wise for updating to solve the optimization problem. Empirical analysis reveals that the proposed algorithm is scalable in terms of tensor size, density, and rank in comparison to the relevant state-of-the-art algorithms.
arXiv commentAccepted for publication in ACM Transactions on Knowledge Discovery from Data
References in corpus (6)
- Tensor Decomposition for Signal Processing and Machine Learning
- All-at-once Optimization for Coupled Matrix and Tensor Factorizations
- DFacTo: Distributed Factorization of Tensors
- A Survey of Point-of-interest Recommendation in Location-based Social Networks
- Convergence guarantees for a class of non-convex and non-smooth optimization problems
- On Fast Computation of Gradients for CANDECOMP/PARAFAC Algorithms