Pages that link to "Item:Q5189547"
From MaRDI portal
The following pages link to The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors (Q5189547):
Displaying 50 items.
- Random design analysis of ridge regression (Q404306) (← links)
- 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)
- Compressed sensing with coherent and redundant dictionaries (Q544040) (← links)
- A variant of the Johnson-Lindenstrauss lemma for circulant matrices (Q629700) (← links)
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma (Q639988) (← links)
- User-friendly tail bounds for sums of random matrices (Q695625) (← links)
- High-dimensional model recovery from random sketched data by exploring intrinsic sparsity (Q782446) (← links)
- Matrix sketching for supervised classification with imbalanced classes (Q832649) (← links)
- Randomized LU decomposition (Q1690696) (← links)
- Forecasting using random subspace methods (Q1740303) (← 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)
- Fast randomized matrix and tensor interpolative decomposition using countsketch (Q2025436) (← links)
- Multiplicative perturbation bounds for multivariate multiple linear regression in Schatten \(p\)-norms (Q2029823) (← links)
- Correlations between random projections and the bivariate normal (Q2036781) (← links)
- Stochastic quasi-gradient methods: variance reduction via Jacobian sketching (Q2039235) (← links)
- An efficient randomized algorithm for computing the approximate Tucker decomposition (Q2049079) (← links)
- Dimensionality reduction for \(k\)-distance applied to persistent homology (Q2063202) (← links)
- Fast and memory-optimal dimension reduction using Kac's walk (Q2090615) (← links)
- Near-neighbor preserving dimension reduction via coverings for doubling subsets of \(\ell_1\) (Q2110372) (← links)
- Spectral estimation from simulations via sketching (Q2133499) (← links)
- Filament plots for data visualization (Q2155802) (← links)
- An efficient algorithm for computing the approximate t-URV and its applications (Q2162323) (← links)
- Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument (Q2185843) (← links)
- Linear dimension reduction approximately preserving a function of the $1$-norm (Q2219215) (← links)
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003) (← links)
- Dimension reduction by random hyperplane tessellations (Q2250053) (← links)
- Paraunitary matrices, entropy, algebraic condition number and Fourier computation (Q2304569) (← links)
- Compressed dictionary learning (Q2310825) (← links)
- Randomized partition trees for nearest neighbor search (Q2345949) (← links)
- Binary vectors for fast distance and similarity estimation (Q2362826) (← links)
- On the convergence to equilibrium of Kac's random walk on matrices (Q2389608) (← links)
- On deterministic sketching and streaming for sparse recovery and norm estimation (Q2437337) (← links)
- Paved with good intentions: analysis of a randomized block Kaczmarz method (Q2437339) (← links)
- Binary random projections with controllable sparsity patterns (Q2676161) (← links)
- An efficient superpostional quantum Johnson-Lindenstrauss lemma via unitary \(t\)-designs (Q2685613) (← links)
- Compressed sensing of low-rank plus sparse matrices (Q2689144) (← links)
- The Fast Cauchy Transform and Faster Robust Linear Regression (Q2812147) (← links)
- Stochastic iterative projection methods for large linear systems (Q3068189) (← links)
- Stochastic Algorithms in Linear Algebra - beyond the Markov Chains and von Neumann - Ulam Scheme (Q3075261) (← links)
- Almost Optimal Explicit Johnson-Lindenstrauss Families (Q3088132) (← links)
- Johnson-Lindenstrauss lemma for circulant matrices** (Q3094609) (← links)
- Sparser Johnson-Lindenstrauss Transforms (Q3189639) (← links)
- (Q4638108) (← links)
- On Geometric Prototype and Applications (Q5009580) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
- On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms (Q5136251) (← links)
- Dominance Product and High-Dimensional Closest Pair under L_infty (Q5136258) (← links)
