关于 Johnson-Lindenstrauss 引理中的稀疏性与次高斯性
On Sparsity and Sub-Gaussianity in the Johnson-Lindenstrauss Lemma
AI总结:
本文为次高斯变量提供了 Johnson-Lindenstrauss 引理的简单证明,分析了稀疏投影的稀疏程度及其对目标维度的代价,强调了次高斯性的关键作用及数据稀疏性带来的限制。
摘要:
我们为次高斯变量提供了 Johnson-Lindenstrauss 引理的一个简单证明。我们扩展了分析以确定稀疏投影能达到何种稀疏程度,以及稀疏性对目标维度的代价。Johnson-Lindenstrauss 引理是基于随机投影的降维方法的理论核心。虽然其原始表述涉及具有高斯项的矩阵,但通过使用更简单的变量可以大幅降低随机投影的计算成本,特别是当这些变量以高概率为零时。在本文中,我们在经典假设下提出了一种简单且基础的分析,强调了次高斯性的关键作用。此外,我们展示了如何将其扩展至稀疏投影,强调了由数据本身的稀疏性所引发的限制。
英文摘要:
The Johnson-Lindenstrauss lemma is the theoretical core of the dimensionality reduction methods based on random projections. While a standard probabilistic proof uses 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 an elementary analysis of random projections under classical assumptions that emphasizes the key role of sub-Gaussianity: any 1-sub-Gaussian distribution with variance 1 yields the same sufficient target dimension as the Gaussian distribution. We then extend the analysis to sparse projections, with data-dependent sparsity conditions on the pairwise differences of the points, and we quantify the cost of sparsity on the target dimension. A complementary lower bound shows the limits induced by the sparsity of the data itself.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。