Sparsity of one-sided subspace embeddings
A random sketch compresses vectors into fewer dimensions. A one-sided subspace embedding must keep every direction in a fixed subspace from collapsing. It can expand lengths.
Why it matters and what counts as progress
Why it matters: The construction shows that preventing collapse alone permits substantially sparser sketches at the same embedding dimension.
What counts as progress: Bounds should specify the subspace dimension, sketch size, allowed entries per row, success probability and any structural restrictions on the sketch.
How the problem developed
- August 2025 · Development [1]
SparseStack authors Introduced the structured random sketch and raised the sparsity question for one-sided guarantees.
Lorenzo Beretta and colleagues Gave an construction at linear dimension and a nearly matching lower bound for overlap-restricted sketches.
AI contribution
Optimal Injectivity of the SparseStack
SparseStack can sketch to dimensions using nonzero entries per row and keeps the smallest singular value bounded below on each fixed r-dimensional subspace with constant success probability. A separate lower bound needs nonzeros per row for isotropic sketches satisfying the paper’s row-support overlap condition.
Sources
Publication history
Daily emails by default, only when there’s an update.