Online Lewis weight sampling
From MaRDI portal
Cites work
- _p row sampling by Lewis weights
- A unified framework for approximating and clustering data
- Analytical properties of generalized Gaussian distributions
- Approximation of zonoids by zonotopes
- Computing Lewis weights to high precision
- Embedding Subspaces of L 1 into l N 1
- Embedding subspaces on \(L_p\) into \(\ell_p^N, 0<p<1\)
- Fast approximation of matrix coherence and statistical leverage
- Finite dimensional subspaces of $L_{p}$
- Freedman's inequality for matrix martingales
- Graph sparsification by effective resistances
- High-dimensional geometric streaming in polynomial space
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 4078003 (Why is no real title available?)
- scientific article; zbMATH DE number 49190 (Why is no real title available?)
- scientific article; zbMATH DE number 775040 (Why is no real title available?)
- Improved iteration complexities for overconstrained p -norm regression
- Improved sliding window algorithms for clustering and coverage via bucketing-based sketches
- L1 Regression with Lewis Weights Subsampling
- Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
- Near optimal linear algebra in the online and sliding window models
- New subset selection algorithms for low rank approximation: offline and online
- On the Construction of Binary Sequence Families With Low Correlation and Large Sizes
- Online row sampling
- Sampling Algorithms and Coresets for \ell_p Regression
- Subspace embeddings for the L 1 -norm with applications
- Symmetrization approach to concentration inequalities for empirical processes.
- Tight bounds for _p oblivious subspace embeddings
- Tight bounds for the subspace sketch problem with applications
- Tight embedding of subspaces of 𝐿_{𝑝} in ℓ_{𝑝}ⁿ for even 𝑝
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- Twice-Ramanujan sparsifiers
- Uniform sampling for matrix approximation
- Universal \({\epsilon}\)-approximators for integrals
This page was built for publication: Online Lewis weight sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6907352)
