Papers
Topics
Authors
Recent
Search
2000 character limit reached

Lower Bounds for Sparse Oblivious Subspace Embeddings

Published 21 Dec 2021 in cs.DS, cs.CG, and cs.DM | (2112.10987v1)

Abstract: An oblivious subspace embedding (OSE), characterized by parameters m,n,d,ϵ,δm,n,d,\epsilon,\delta, is a random matrix Π∈Rm×n\Pi\in \mathbb{R}^{m\times n} such that for any dd-dimensional subspace T⊆RnT\subseteq \mathbb{R}^n, Pr⁡Π[∀x∈T,(1−ϵ)∥x∥2≤∥Πx∥2≤(1+ϵ)∥x∥2]≥1−δ\Pr_\Pi[\forall x\in T, (1-\epsilon)\|x\|_2 \leq \|\Pi x\|_2\leq (1+\epsilon)\|x\|_2] \geq 1-\delta. For ϵ\epsilon and δ\delta at most a small constant, we show that any OSE with one nonzero entry in each column must satisfy that m=Ω(d2/(ϵ2δ))m = \Omega(d^2/(\epsilon^2\delta)), establishing the optimality of the classical Count-Sketch matrix. When an OSE has 1/(9ϵ)1/(9\epsilon) nonzero entries in each column, we show it must hold that m=Ω(ϵO(δ)d2)m = \Omega(\epsilon^{O(\delta)} d^2), improving on the previous Ω(ϵ2d2)\Omega(\epsilon^2 d^2) lower bound due to Nelson and Nguyen (ICALP 2014).

Authors (2)
Citations (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.