论文标题
用于证明认证问题的规模级别的机械
Machinery for Proving Sum-of-Squares Lower Bounds on Certification Problems
论文作者
论文摘要
在本文中，我们通过概括Barak等人使用的技术来构建通用机械，以证明认证问题的下限。 [FOCS 2016]证明了种植集团的平方和下限。使用这种机械，我们证明了张量PCA的$ n^ε$的下限，稀疏PCA的WishArt模型以及种植的群集的一种变体，我们称其为植物略有较密集的子分类。
In this paper, we construct general machinery for proving Sum-of-Squares lower bounds on certification problems by generalizing the techniques used by Barak et al. [FOCS 2016] to prove Sum-of-Squares lower bounds for planted clique. Using this machinery, we prove degree $n^ε$ Sum-of-Squares lower bounds for tensor PCA, the Wishart model of sparse PCA, and a variant of planted clique which we call planted slightly denser subgraph.
