Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio

26 July 2019

Papers citing "Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio"

23 / 23 papers shown

Title
LLM Watermarking Using Mixtures and Statistical-to-Computational Gaps Pedro Abdalla Roman Vershynin WaLM 32 0 0 02 May 2025
Low degree conjecture implies sharp computational thresholds in stochastic block model Jingqiu Ding Yiding Hua Lucas Slot David Steurer 72 1 0 20 Feb 2025
On the phase diagram of extensive-rank symmetric matrix denoising beyond rotational invariance Jean Barbier Francesco Camilli Justin Ko Koki Okajima 21 5 0 04 Nov 2024
Information-Theoretic Thresholds for the Alignments of Partially Correlated Graphs Dong Huang Xianwen Song Pengkun Yang 24 1 0 08 Jun 2024
Computational lower bounds for multi-frequency group synchronization Anastasia Kireeva Afonso S. Bandeira Dmitriy Kunisky 39 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 18 1 0 08 Feb 2024
Smoothing the Landscape Boosts the Signal for SGD: Optimal Sample Complexity for Learning Single Index Models Alexandru Damian Eshaan Nichani Rong Ge Jason D. Lee MLT 29 33 0 18 May 2023
SQ Lower Bounds for Random Sparse Planted Vector Problem Jingqiu Ding Yiding Hua 16 4 0 26 Jan 2023
Learning and Testing Latent-Tree Ising Models Efficiently Davin Choo Y. Dagan C. Daskalakis Anthimos Vardis Kandiros 6 8 0 23 Nov 2022
Statistical limits of correlation detection in trees Luca Ganassali Laurent Massoulié G. Semerjian 30 16 0 27 Sep 2022
Near-optimal fitting of ellipsoids to random points Aaron Potechin Paxton Turner Prayaag Venkat Alexander S. Wein 20 8 0 19 Aug 2022
Optimal Clustering by Lloyd Algorithm for Low-Rank Mixture Model Zhongyuan Lyu Dong Xia 27 3 0 11 Jul 2022
Tensor-on-Tensor Regression: Riemannian Optimization, Over-parameterization, Statistical-computational Gap, and Their Interplay Yuetian Luo Anru R. Zhang 16 19 0 17 Jun 2022
Lattice-Based Methods Surpass Sum-of-Squares in Clustering Ilias Zadik M. Song Alexander S. Wein Joan Bruna 9 35 0 07 Dec 2021
Testing network correlation efficiently via counting trees Cheng Mao Yihong Wu Jiaming Xu Sophie H. Yu 19 32 0 22 Oct 2021
Inferring Hidden Structures in Random Graphs Wasim Huleihel 9 7 0 05 Oct 2021
Reconstruction on Trees and Low-Degree Polynomials Frederic Koehler Elchanan Mossel 8 9 0 14 Sep 2021
On Support Recovery with Sparse CCA: Information Theoretic and Computational Limits Nilanjana Laha Rajarshi Mukherjee 17 4 0 14 Aug 2021
Algorithmic Obstructions in the Random Number Partitioning Problem D. Gamarnik Eren C. Kizildaug 11 21 0 02 Mar 2021
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
Computationally efficient sparse clustering Matthias Löffler Alexander S. Wein Afonso S. Bandeira 22 14 0 21 May 2020
Reducibility and Statistical-Computational Gaps from Secret Leakage Matthew Brennan Guy Bresler 19 85 0 16 May 2020
Subexponential-Time Algorithms for Sparse PCA Yunzi Ding Dmitriy Kunisky Alexander S. Wein Afonso S. Bandeira 20 57 0 26 Jul 2019