Hadamard Flattening and Gaussian Pooling Sketch for Least Squares with Coordinate-wise Guarantee

arXiv:2608.26552 · cs.DS, cs.LG, stat.ML · Submitted 2026-08-27 · Read on arXiv

cs.DS, cs.LG, stat.ML

Submitted: 2026-08-27

Updated: 2026-08-27

Terminology

• Core — 6× in this paper · explained in 2 episodes
• Embeddings — 3× in this paper · explained in 2 episodes
• Sparsity — 3× in this paper · explained in 4 episodes
• Accuracy — 1× in this paper · explained in 1 episode
• Hilbert Space — 1× in this paper · explained in 2 episodes
• Trace — 1× in this paper · explained in 2 episodes

Sources

• Note on sampling without replacing from a finite collection of matrices
• A Nearly-Optimal Bound for Fast Regression with $\ell_\infty$ Guarantee

Related papers

• Cascaded Learned Bloom Filter for Optimizing Model-Filter Size Balance and Fast Rejection
• Edge-Private Matching Kernels Through Local Decoding
• Local Node Differential Privacy
• Cheaper by the Batch: Shared Traversal for Genotype Graph Editing
• Scalable Algorithms for Approximate DNF Model Counting
• On the Approximation Relationship between Optimizing Ratio of Submodular (RS) and Difference of Submodular (DS) Functions