Norming Sets for Tensor and Polynomial Sketching
Yifan Zhang, Joe Kileel

TL;DR
This paper introduces a theoretical framework for tensor and polynomial sketching using norming sets, enabling efficient dimension reduction for complex algebraic varieties and tensor networks with various sketching operators.
Contribution
It develops a norming set-based theory for sketching algebraic varieties and proposes the median sketch method for efficient embedding with fewer measurements.
Findings
Median sketch uses $ ilde{O}( ext{dim }V)$ measurements.
Framework applies to sub-Gaussian, Johnson-Lindenstrauss, and tensor structured sketches.
Provides bounds on sketching dimensions for low-rank tensors and polynomial images.
Abstract
This paper develops the sketching (i.e., randomized dimension reduction) theory for real algebraic varieties and images of polynomial maps, including, e.g., the set of low rank tensors and tensor networks. Through the lens of norming sets, we provide a framework for controlling the sketching dimension for \textit{any} sketch operator used to embed said sets, including sub-Gaussian, fast Johnson-Lindenstrauss, and tensor structured sketch operators. Leveraging norming set theory, we propose a new sketching method called the median sketch. It embeds such a set using only tensor structured or sparse linear measurements.
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
TopicsStochastic Gradient Optimization Techniques · Complexity and Algorithms in Graphs · Tensor decomposition and applications
