Pages that link to "Item:Q3189639"
From MaRDI portal
The following pages link to Sparser Johnson-Lindenstrauss Transforms (Q3189639):
Displayed 45 items.
- Toward a unified theory of sparse dimensionality reduction in Euclidean space (Q496171) (← links)
- Real-valued embeddings and sketches for fast distance and similarity estimation (Q508585) (← links)
- High-dimensional model recovery from random sketched data by exploring intrinsic sparsity (Q782446) (← links)
- Dimensionality reduction of SDPs through sketching (Q1713333) (← links)
- On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms (Q1986965) (← links)
- Fast binary embeddings with Gaussian circulant matrices: improved bounds (Q1991343) (← links)
- Randomized LU decomposition using sparse projections (Q2012724) (← links)
- Random projections for conic programs (Q2040548) (← links)
- Dimensionality reduction for \(k\)-distance applied to persistent homology (Q2063202) (← links)
- Fast and memory-optimal dimension reduction using Kac's walk (Q2090615) (← links)
- Distance geometry and data science (Q2192022) (← links)
- Random projections for quadratic programs (Q2196316) (← links)
- Testing and estimating change-points in the covariance matrix of a high-dimensional time series (Q2306269) (← links)
- A simple homotopy proximal mapping algorithm for compressive sensing (Q2425244) (← links)
- Binary random projections with controllable sparsity patterns (Q2676161) (← links)
- The Fast Cauchy Transform and Faster Robust Linear Regression (Q2812147) (← links)
- Frequent Directions: Simple and Deterministic Matrix Sketching (Q2821796) (← links)
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence (Q2967608) (← links)
- Sparser Johnson-Lindenstrauss Transforms (Q3189639) (← links)
- Upper and Lower Bounds for Dynamic Data Structures on Strings (Q3304117) (← links)
- (Q3305358) (← links)
- Compressed and Penalized Linear Regression (Q3391428) (← links)
- Randomized algorithms in numerical linear algebra (Q4594242) (← links)
- Optimal Bounds for Johnson-Lindenstrauss Transformations (Q4614115) (← links)
- (Q4633059) (← links)
- (Q4638108) (← links)
- Estimating Leverage Scores via Rank Revealing Methods and Randomization (Q5006452) (← links)
- Deterministic Heavy Hitters with Sublinear Query Time (Q5009510) (← links)
- ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching (Q5027035) (← links)
- Performance of Johnson--Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering (Q5067443) (← links)
- On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms (Q5136251) (← links)
- Random Projections for Linear Programming (Q5219688) (← links)
- Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. (Q5240430) (← links)
- Indefinite Proximity Learning: A Review (Q5380326) (← links)
- Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares (Q5857850) (← links)
- Tracking the l_2 Norm with Constant Update Time (Q5875453) (← links)
- Towards Optimal Moment Estimation in Streaming and Distributed Models (Q5875483) (← links)
- Scalable subspace methods for derivative-free nonlinear least-squares optimization (Q6038650) (← links)
- PLSS: A Projected Linear Systems Solver (Q6039256) (← links)
- Tighter guarantees for the compressive multi-layer perceptron (Q6049073) (← links)
- Towards Optimal Moment Estimation in Streaming and Distributed Models (Q6051992) (← links)
- Direct Search Based on Probabilistic Descent in Reduced Spaces (Q6071887) (← links)
- M-IHS: an accelerated randomized preconditioning method avoiding costly matrix decompositions (Q6083984) (← links)
- \( \varepsilon \)-isometric dimension reduction for incompressible subsets of \(\ell_p\) (Q6145674) (← links)
- Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers (Q6173264) (← links)