A Near-Optimal Lower Bound for p-Subspace Embeddings, 1 at most p<2

arXiv:2608.14201 · cs.DS, math.FA · Submitted 2026-08-14 · Read on arXiv

cs.DS, math.FA

Submitted: 2026-08-14

Updated: 2026-10-25

Terminology

• Embeddings — 1× in this paper · explained in 2 episodes

Related papers

• Cascaded Learned Bloom Filter for Optimizing Model-Filter Size Balance and Fast Rejection
• Computational and Statistical Hardness of Calibration Distance
• Edge-Private Matching Kernels Through Local Decoding
• Tight Bounds for Equivalence Testing with Non-Adaptive Conditional Samples
• Local Node Differential Privacy
• Cheaper by the Batch: Shared Traversal for Genotype Graph Editing