Bounded-norm strengthening of the bipartite inner-product compression theorem

Let a1,a2,,an,b1,b2,,bnRna_1,a_2,\ldots,a_n,b_1,b_2,\ldots,b_n\in\mathbb{R}^n have Euclidean norm at most 11, let 0<ε<10<\varepsilon<1, and set

t=Clog(2+ε2n)ε2,t=\left\lfloor C\frac{\log(2+\varepsilon^2 n)}{\varepsilon^2}\right\rfloor,

where CC is the absolute constant from Theorem

. Suppose there are vectors $x_1,x_2,\ldots,x_n,y_1,y_2,\ldots,y_n\in\mathbb{R}^t$ satisfying $|\langle x_i,y_j\rangle-\langle a_i,b_j\rangle|\leq\varepsilon$ for all $i,j$. **The bounded-norm strengthening.** Under the assumptions of Theorem

, the conclusion holds together with the further requirement that

xiO(1)andyiO(1)\|x_i\|\leq O(1)\quad\text{and}\quad\|y_i\|\leq O(1)

for all 1in1\leq i\leq n. This conjecture strengthens the bipartite version of approximate inner-product compression by requiring uniformly bounded norms for the compressed vectors; it remains open, although the paper establishes two supporting results.

Sources & referencesView supporting material

Primary source

Noga Alon and Bo'az Klartag, “Optimal compression of approximate inner products and dimension reduction”, arXiv:1610.00239 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.