Computational Barriers to Estimation from Low-Degree Polynomials

5 August 2020

Papers citing "Computational Barriers to Estimation from Low-Degree Polynomials"

9 / 9 papers shown

Title
Computational lower bounds for multi-frequency group synchronization Anastasia Kireeva Afonso S. Bandeira Dmitriy Kunisky 44 1 0 05 Jun 2024
Low-degree phase transitions for detecting a planted clique in sublinear time Jay Mardia K. A. Verchand Alexander S. Wein 24 1 0 08 Feb 2024
SQ Lower Bounds for Random Sparse Planted Vector Problem Jingqiu Ding Yiding Hua 19 4 0 26 Jan 2023
Learning and Testing Latent-Tree Ising Models Efficiently Davin Choo Y. Dagan C. Daskalakis Anthimos Vardis Kandiros 22 8 0 23 Nov 2022
Tensor-on-Tensor Regression: Riemannian Optimization, Over-parameterization, Statistical-computational Gap, and Their Interplay Yuetian Luo Anru R. Zhang 23 19 0 17 Jun 2022
Reconstruction on Trees and Low-Degree Polynomials Frederic Koehler Elchanan Mossel 22 9 0 14 Sep 2021
Optimal Low-Degree Hardness of Maximum Independent Set Alexander S. Wein 30 44 0 13 Oct 2020
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent Matthew Brennan Guy Bresler Samuel B. Hopkins J. Li T. Schramm 19 62 0 13 Sep 2020
Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits Yuetian Luo Anru R. Zhang 24 44 0 21 May 2020