Pages that link to "Item:Q3097486"
From MaRDI portal
The following pages link to New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property (Q3097486):
Displaying 50 items.
- Derandomizing restricted isometries via the Legendre symbol (Q295815) (← links)
- A unified framework for linear dimensionality reduction in L1 (Q310869) (← links)
- Restricted isometries for partial random circulant matrices (Q412402) (← links)
- The restricted isometry property for random block diagonal matrices (Q466970) (← links)
- Near-optimal encoding for sigma-delta quantization of finite frame expansions (Q485203) (← 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)
- A strong restricted isometry property, with an application to phaseless compressed sensing (Q905910) (← links)
- On principal components regression, random projections, and column subsampling (Q1616329) (← links)
- Improved bounds for sparse recovery from subsampled random convolutions (Q1634177) (← links)
- Robustness properties of dimensionality reduction with Gaussian random matrices (Q1703873) (← links)
- Kernel conjugate gradient methods with random projections (Q1979923) (← links)
- On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms (Q1986965) (← links)
- On orthogonal projections for dimension reduction and applications in augmented target loss functions for learning problems (Q1988352) (← links)
- Fast binary embeddings with Gaussian circulant matrices: improved bounds (Q1991343) (← links)
- Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs (Q2036421) (← links)
- Optimal fast Johnson-Lindenstrauss embeddings for large data sets (Q2059797) (← links)
- Dimensionality reduction for \(k\)-distance applied to persistent homology (Q2063202) (← links)
- Fast and memory-optimal dimension reduction using Kac's walk (Q2090615) (← links)
- GenMod: a generative modeling approach for spectral representation of PDEs with random inputs (Q2099749) (← links)
- Spectral estimation from simulations via sketching (Q2133499) (← links)
- The Hanson-Wright inequality for random tensors (Q2164658) (← links)
- Iterative hard thresholding for compressed data separation (Q2190470) (← links)
- Signal separation under coherent dictionaries and \(\ell_p\)-bounded noise (Q2223572) (← links)
- Convergence of projected Landweber iteration for matrix rank minimization (Q2252213) (← links)
- Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO (Q2252508) (← links)
- Compressed dictionary learning (Q2310825) (← links)
- Sparse reconstruction with multiple Walsh matrices (Q2317908) (← links)
- Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery (Q2360780) (← links)
- Low rank tensor recovery via iterative hard thresholding (Q2400255) (← links)
- Greedy-like algorithms for the cosparse analysis model (Q2437331) (← links)
- On deterministic sketching and streaming for sparse recovery and norm estimation (Q2437337) (← links)
- Fast and RIP-optimal transforms (Q2514234) (← links)
- Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery (Q2515314) (← links)
- Structure dependent sampling in compressed sensing: theoretical guarantees for tight frames (Q2627887) (← links)
- Generalized notions of sparsity and restricted isometry property. II: Applications (Q2657397) (← links)
- On randomized trace estimates for indefinite matrices with an application to determinants (Q2671299) (← links)
- Side effects of learning from low-dimensional data embedded in a Euclidean space (Q2687305) (← links)
- Compressed sensing of low-rank plus sparse matrices (Q2689144) (← links)
- Compressive Sensing (Q2789803) (← links)
- Theory and applications of compressed sensing (Q2864809) (← links)
- Suprema of Chaos Processes and the Restricted Isometry Property (Q2929397) (← links)
- Fast Phase Retrieval from Local Correlation Measurements (Q3179618) (← links)
- Sparser Johnson-Lindenstrauss Transforms (Q3189639) (← links)
- Classification Scheme for Binary Data with Extensions (Q3296178) (← links)
- Tighter Fourier Transform Lower Bounds (Q3448770) (← links)
- A Novel Compressed Sensing Scheme for Photoacoustic Tomography (Q3452594) (← links)
- Compressive Sensing with Redundant Dictionaries and Structured Measurements (Q3455237) (← links)
