No article text was recorded for this version.
sparse random projection
Version 1 of 1225 papers343 conceptsfrozen 2026-10-04
Papers in this version
- Blog: OSNAP: Faster Numerical Linear Algebra Algorithms via Sparser Subspace Embeddings
- Blog: Low-Rank Approximation and Regression in Input Sparsity Time
- Blog: Sparse Embedded k-Means Clustering
- Blog: Sparse Dimensionality Reduction Revisited
- Blog: Sparse Dimensionality Reduction Revisited
- Blog: The Fast Johnson-Lindenstrauss Transform is Even Faster
- Blog: Iterative Hessian Sketch in Input Sparsity Time
- Blog: Understanding Sparse JL for Feature Hashing
- Blog: On Sparsity and Sub-Gaussianity in the Johnson- Lindenstrauss Lemma
- Blog: Sparser Johnson-Lindenstrauss transforms
- Blog: Sparser Johnson-Lindenstrauss Transforms
- Blog: On a Connection Between Fast and Sparse Oblivious Subspace Embeddings
- Blog: A sparse Johnson: Lindenstrauss transform
- Blog: Simple Analyses of the Sparse Johnson-Lindenstrauss Transform
- Blog: Isometric sketching of any set via the Restricted Isometry Property
- Blog: Binary Random Projections with Controllable Sparsity Patterns
- Blog: Tight Bounds for 𝓁p Oblivious Subspace Embeddings
- Blog: Tight Bounds for ℓp Oblivious Subspace Embeddings
- Blog: Sparse graph based sketching for fast numerical linear algebra
- Blog: Memory and Computation Efficient PCA via Very Sparse Random Projections
- Blog: Entropy Matters: Understanding Performance of Sparse Random Embeddings
- Blog: A Sparser Johnson-Lindenstrauss Transform
- Blog: OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings
- Blog: Analysis of SparseHash: An efficient embedding of set-similarity via sparse projections
- Blog: Rademacher Chaos, Random Eulerian Graphs and The Sparse Johnson-Lindenstrauss Transform
- Blog: Optimal Embedding Dimension for Sparse Subspace Embeddings
- Blog: Low Rank Approximation and Regression in Input Sparsity Time
- Blog: Sketching Algorithms and Lower Bounds for Ridge Regression
- Blog: Dimensionality reduction on complex vector spaces for dynamic weighted Euclidean distance
- Blog: An Econometric Perspective on Algorithmic Subsampling
- Blog: Low-distortion Subspace Embeddings in Input-sparsity Time and Applications to Robust Linear Regression
- Blog: Differential Private Knowledge Transfer for Privacy-Preserving Cross-Domain Recommendation
- Blog: Subspace Embeddings and ℓp-Regression Using Exponential Random Variables
- Blog: Fast k-NN search
- Blog: Optimal Subspace Embeddings: Resolving Nelson-Nguyen Conjecture Up to Sub-Polylogarithmic Factors
- Blog: Tight Bounds for $\ell_p$ Oblivious Subspace Embeddings
- Blog: Sketch In, Sketch Out: Accelerating both Learning and Inference for Structured Prediction with Kernels
- Blog: Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time
- Blog: Increasing the Scope as You Learn: Adaptive Bayesian Optimization in Nested Subspaces
- Blog: Binary Random Projections with Controllable Sparsity Patterns
- Blog: Bellman Error Based Feature Generation using Random Projections on Sparse Spaces
- Blog: Tensor Random Projection for Low Memory Dimension Reduction
- Blog: Sparse Matrix-based Random Projection for Classification
- Blog: Lower Bounds for Sparse Oblivious Subspace Embeddings
- Blog: Optimal Sketching Bounds for Sparse Linear Regression
- Blog: Fast Kernel Methods for Generic Lipschitz Losses via p-Sparsified Sketches
- Blog: Beyond Worst-Case Dimensionality Reduction for Sparse Vectors
- Blog: Faster Binary Embeddings for Preserving Euclidean Distances
- Blog: A Derandomized Sparse Johnson-Lindenstrauss Transform
- Blog: Dimensionality Reduction on Complex Vector Spaces for Euclidean Distance with Dynamic Weights
- Blog: Real-time infrared target tracking based on ℓ<sub>1</sub>minimization and compressive features
- Blog: Greedy Column Subset Selection for Large-scale Data Sets
- Blog: Nearly sharp structured sketching for constrained optimization
- Blog: Fast nearest neighbor search through sparse random projections and voting
- Blog: Sketching Algorithms and Lower Bounds for Ridge Regression
- Blog: Blessing of Dimensionality: High-Dimensional Feature and Its Efficient Compression for Face Verification
- Blog: Efficient Network Representation Learning via Cluster Similarity
- Blog: Uni-LoRA: One Vector is All You Need
- Blog: The Fast Johnson-Lindenstrauss Transform Is Even Faster
- Blog: Pairwise Rotation Hashing for High-dimensional Features
Showing 60 of 225 papers.
History & citation
Current · Permanent link
- Dimensionality Reduction via Sparse Random Matrices merged into this direction (72% overlap)
- Subspace Embeddings in Input Sparsity Time merged into this direction (88% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_sparse_random_projection_b5a2845d,
title = {sparse random projection},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/sparse-random-projection/rdr_b5a2845d39d44b709bbea3cdf2149c62},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_sparse_random_projection_b5a2845d_v1,
title = {sparse random projection},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/sparse-random-projection/rdr_b5a2845d39d44b709bbea3cdf2149c62/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}