arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1804.03644cs.DSmath.FA
收藏

利用广义Krivine舍入逼近算子范数

Approximating Operator Norms via Generalized Krivine Rounding

Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani

摘要:

我们考虑$(\ell_p,\ell_r)$问题,它寻求最大化双线性形式$y^T A x$的输入矩阵$A$在向量$x,y$与$\|x\|_p=\|y\|_r=1$ .这个问题等价于计算$A$的$p \to r^*$算子范数。$p=r=\infty$的情况下对应于经典的格罗滕迪克问题。我们的主要结果是一个算法的任意$p,r \ge 2$的逼近比$(1+ε_0)/(\sinh^{-1}(1)\cdot γ_{p^*} \,γ_{r^*})$的一些固定的$ε_0 \le 0.00863$。与Krivine的$(π/2)/\sinh^{-1}(1)$的原始Grothendieck问题的近似比相比,我们的保证是从$(γ_{p^*} γ_{r^*})^{-1}$的最佳已知的硬度因子的问题的一个类似Krivine的缺陷。我们的近似如下由边界的自然向量松弛的问题,这是凸时$p,r \ge 2$的值。我们给出了随机超平面舍入的推广,并将此舍入的性能与某些超几何函数相关联,这些超几何函数规定了在舍入之前对向量解进行必要的变换。不像Krivine的四舍五入的相关超几何函数$\arcsin$,我们必须研究一个家庭的超几何函数。然后,我们的大部分技术工作涉及复分析方法,以获得有关这些超几何函数的逆的泰勒级数系数的详细信息,然后决定我们的近似因子。我们的结果还意味着改进的边界“因子分解通过$\ell_{2}^{\,n}$“的运营商从$\ell_{p}^{\,n}$到$\ell_{q}^{\,m}$(当$p\geq 2 \geq q$)-这样的界限是显着的兴趣在功能分析和我们的工作提供了适度的补充证据之间的一个有趣的平行因子分解,和常数因子逼近。

英文摘要:

We consider the $(\ell_p,\ell_r)$-Grothendieck problem, which seeks to maximize the bilinear form $y^T A x$ for an input matrix $A$ over vectors $x,y$ with $\|x\|_p=\|y\|_r=1$. The problem is equivalent to computing the $p \to r^*$ operator norm of $A$. The case $p=r=\infty$ corresponds to the classical Grothendieck problem. Our main result is an algorithm for arbitrary $p,r \ge 2$ with approximation ratio $(1+ε_0)/(\sinh^{-1}(1)\cdot γ_{p^*} \,γ_{r^*})$ for some fixed $ε_0 \le 0.00863$. Comparing this with Krivine's approximation ratio of $(π/2)/\sinh^{-1}(1)$ for the original Grothendieck problem, our guarantee is off from the best known hardness factor of $(γ_{p^*} γ_{r^*})^{-1}$ for the problem by a factor similar to Krivine's defect. Our approximation follows by bounding the value of the natural vector relaxation for the problem which is convex when $p,r \ge 2$. We give a generalization of random hyperplane rounding and relate the performance of this rounding to certain hypergeometric functions, which prescribe necessary transformations to the vector solution before the rounding is applied. Unlike Krivine's Rounding where the relevant hypergeometric function was $\arcsin$, we have to study a family of hypergeometric functions. The bulk of our technical work then involves methods from complex analysis to gain detailed information about the Taylor series coefficients of the inverses of these hypergeometric functions, which then dictate our approximation factor. Our result also implies improved bounds for "factorization through $\ell_{2}^{\,n}$" of operators from $\ell_{p}^{\,n}$ to $\ell_{q}^{\,m}$ (when $p\geq 2 \geq q$)--- such bounds are of significant interest in functional analysis and our work provides modest supplementary evidence for an intriguing parallel between factorizability, and constant-factor approximability.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑