Journal
IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING
Volume 10, Issue 2, Pages 284-295Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JSTSP.2015.2503260
Keywords
Tensor decomposition; canonical polyadic decomposition; CANDECOMP/PARAFAC; randomized algorithms; block sampling; big data; blind source separation
Categories
Funding
- Research Council KU Leuven [c16/15/059-nD, CoE PFV/10/002]
- F.W.O. [G.0830.14N, G.0881.14N]
- Belgian Federal Science Policy Office [IUAP P7/19]
- European Research Council under European Union/ERC [339804]
- Research Foundation-Flanders (FWO)
Ask authors/readers for more resources
For the analysis of large-scale datasets one often assumes simple structures. In the case of tensors, a decomposition in a sum of rank-1 terms provides a compact and informative model. Finding this decomposition is intrinsically more difficult than its matrix counterpart. Moreover, for large-scale tensors, computational difficulties arise due to the curse of dimensionality. The randomized block sampling canonical polyadic decomposition method presented here combines increasingly popular ideas from randomization and stochastic optimization to tackle the computational problems. Instead of decomposing the full tensor at once, updates are computed from small random block samples. Using step size restriction the decomposition can be found up to near optimal accuracy, while reducing the computation time and number of data accesses significantly. The scalability is illustrated by the decomposition of a synthetic 8 TB tensor and a real life 12.5 GB tensor in a few minutes on a standard laptop.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available