Near Optimal Sketching of Low-Rank Tensor Regression
Jarvis Haupt, Xingguo Li, David P. Woodruff

TL;DR
This paper introduces a method for efficiently solving low-rank tensor regression problems using sparse random projections, achieving near-optimal dimension reduction for both CP and Tucker tensor models.
Contribution
It develops a novel approach to apply sparse random projections to low-rank tensor regression, significantly reducing problem size while maintaining solution quality.
Findings
Achieves substantial dimension reduction in tensor regression problems.
Provides theoretical guarantees for near-optimal solutions after projection.
Supports the theory with numerical simulations demonstrating effectiveness.
Abstract
We study the least squares regression problem \begin{align*} \min_{\Theta \in \mathcal{S}_{\odot D,R}} \|A\Theta-b\|_2, \end{align*} where is the set of for which for vectors for all and , and denotes the outer product of vectors. That is, is a low-dimensional, low-rank tensor. This is motivated by the fact that the number of parameters in is only , which is significantly smaller than the number of parameters in ordinary least squares regression. We consider the above CP decomposition model of tensors , as well as the Tucker decomposition. For both models we show how to apply data dimensionality reduction techniques based on {\it sparse}…
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 · Electromagnetic Scattering and Analysis
