General
On Sparsity and Sub-Gaussianity in the Johnson-Lindenstrauss Lemma
arXiv stat.TH0 views
arXiv:2409.06275v3 Announce Type: replace Abstract: We provide a simple proof of the Johnson-Lindenstrauss lemma for sub-Gaussian variables. We extend the analysis to identify how sparse projections can be, and what the cost of sparsity is on the target dimension. The Johnson-Lindenstrauss lemma is the theoretical core of the dimensionality reduction methods based on random projections. While its original formulation involves matrices with Gaussian entries, the computational cost of random projections can be drastically reduced by the use of simpler variables, especially if they vanish with a high probability. In this paper, we propose a simple and elementary analysis of random projections under classical assumptions that emphasizes the key role of sub-Gaussianity. Furthermore, we show how to extend it to sparse projections, emphasizing the limits induced by the sparsity of the data itself.
Source:https://arxiv.org/abs/2409.06275PreviousTesting the equality of the copulas of two multivariate populations with Bernstein polynomialsNextSelf-Normalized Bounds for Time Series with Sample Variance Only and Their Application to Forecasting
Related posts
Joint Optimization of Antenna Partitioning and Distortion-Aware Precoding for Massive MIMO-OFDM with Peak Cancellation and In-Band Distortion Compensation
0arXiv eess.SP
Smoothed estimation of Wasserstein barycenters
0arXiv stat.TH
Applications of QR-based Vector-Valued Rational Approximation
0arXiv cs.NA
A Superfast Direct Solver for Type-III Inverse Nonuniform Discrete Fourier Transform
0arXiv cs.NA
Fully implicit timestepping methods for the rotating shallow water equations
0arXiv cs.NA
An iterative tangential interpolation algorithm for model reduction of MIMO systems
0arXiv eess.SY