Random matrices acting on sets: independent columns
From MaRDI portal
Cites work
- A mathematical introduction to compressive sensing
- A simple tool for bounding the deviation of random matrices on geometric sets
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Empirical processes and random projections
- Extensions of Lipschitz mappings into a Hilbert space
- High-dimensional probability. An introduction with applications in data science
- Low rank approximation and regression in input sparsity time
- Mean, Median and Mode in Binomial Distributions
- On variants of the Johnson–Lindenstrauss lemma
- Random embeddings with an almost Gaussian distortion
- Randomized sketches for kernels: fast and optimal nonparametric regression
- Randomized Sketches of Convex Programs With Sharp Guarantees
- Reconstruction and subgaussian operators in asymptotic geometric analysis
- Restricted isometry property of matrices with independent columns and neighborly polytopes by random sampling
- Robust Nonnegative Sparse Recovery and the Nullspace Property of 0/1 Measurements
- Simple analyses of the sparse Johnson-Lindenstrauss transform
- Sparser Johnson-Lindenstrauss transforms
- Sub-Gaussian matrices on sets: optimal tail dependence and applications
- Tail bounds via generic chaining
- The fast Johnson-Lindenstrauss transform and approximate nearest neighbors
- Toward a unified theory of sparse dimensionality reduction in Euclidean space
- Two observations regarding embedding subsets of Euclidean spaces in normed spaces
- Upper and lower bounds for stochastic processes. Modern methods and classical problems
This page was built for publication: Random matrices acting on sets: independent columns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6920598)
