Learning from Multiway Data: Simple and Efficient Tensor Regression
Rose Yu, Yan Liu

TL;DR
This paper introduces a simple, efficient tensor regression algorithm using subsampled tensor projected gradient with randomized sketching, suitable for large multiway data, and demonstrates its superior empirical performance.
Contribution
It presents a novel subsampled tensor projected gradient method that is faster and more memory-efficient for large-scale tensor regression tasks.
Findings
Algorithm converges in fixed number of iterations.
Memory requirement grows linearly with data size.
Outperforms existing methods in empirical tests.
Abstract
Tensor regression has shown to be advantageous in learning tasks with multi-directional relatedness. Given massive multiway data, traditional methods are often too slow to operate on or suffer from memory bottleneck. In this paper, we introduce subsampled tensor projected gradient to solve the problem. Our algorithm is impressively simple and efficient. It is built upon projected gradient method with fast tensor power iterations, leveraging randomized sketching for further acceleration. Theoretical analysis shows that our algorithm converges to the correct solution in fixed number of iterations. The memory requirement grows linearly with the size of the problem. We demonstrate superior empirical performance on both multi-linear multi-task learning and spatio-temporal applications.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Sparse and Compressive Sensing Techniques
