SparseStack是最优的无感知子空间嵌入
SparseStack Is an Optimal Oblivious Subspace Embedding
浏览论文内容
中文总结 AI 辅助
本文证明SparseStack是最优无感知子空间嵌入，参数符合Nelson等的猜想，证明用条件期望耦合等方法，定理已在Lean 4中形式验证，证明借助AI系统完成。
中文摘要 AI 辅助
完全独立的SparseStack sketch是s个独立的CountSketch矩阵的垂直堆叠，缩放因子为s^{-1/2}，使得每列恰好有s个非零元素。我们证明，当m=O((d+log(1/δ))/ε²)且s=O(log(d/δ)/ε)时，它是d维子空间的无感知子空间嵌入，具有失真ε和失败概率δ，且带有显式常数。这些参数是Nelson和Nguyen（FOCS 2013）对该构造的猜想，根据他们的下界，行数是最优的。该证明对Gram误差的偶阶矩进行了界定。条件期望耦合将每个带符号的独热列选择器替换为具有独立三点项的向量，代价是每阶矩增加一个常数因子。三点法则具有三维L₂空间，因此乘以一个元素是一个3×3雅可比矩阵，2q阶矩成为有限张量积上确定性算子的真空矩阵元，该算子按总占据度分级。该算子有三个分级带，我们在分级ν扇区上对每个带的界定为C(√((d+ν+1)/m)+(d+ν+1)/m+(ν+1)/s)，其中C=3+√2。关键步骤是共享因子不等式：附着于一个张量槽的正算子的每个行块秩为1且迹为d，当ℓ个槽共享相同外部因子时，其范数至多为d+ℓ-1。2q步展开和马尔可夫不等式完成了论证，该论证是有限维的，未使用高斯比较。该定理已在Lean 4中得到形式验证。如论文中所述，证明是在作者指导下借助AI系统完成的。
英文摘要
We prove that fully independent SparseStack achieves the oblivious subspace embedding parameters conjectured by Nelson and Nguyen (FOCS 2013): $m=O((d+\log(1/δ))/\varepsilon^2)$ rows and $s=O(\log(d/δ)/\varepsilon)$ nonzero entries per column for distortion $\varepsilon$ and failure probability $δ$ on any fixed $d$-dimensional subspace, with explicit constants. The proof turns random-matrix concentration into a problem in finite-dimensional linear algebra. A coupling first reduces the moment estimates to a model with independent finite-valued entries. We represent these variables by multiplication operators, so their matrix moments become exact matrix elements of a deterministic operator on a finite tensor product. The central estimate bounds the contribution of $\ell\ge1$ occupied sites sharing the external factor $\mathbb{R}^d$ by $d+\ell-1$ rather than $d\ell$, yielding additive dependence on the dimension and the moment order. This approach controls both spectral edges without Gaussian comparison. The main theorem has been formally verified in Lean 4.
