Showing math.STShow all
2 papers · 1 filter
math.ST2025
An Optimized Franz-Parisi Criterion and its Equivalence with SQ Lower Bounds
Siyu Chen, Theodor Misiakiewicz, Ilias Zadik +1
Bandeira et al. (2022) introduced the Franz-Parisi (FP) criterion for characterizing the computational hard phases in statistical detection problems. The FP criterion, based on an…
math.ST2024
Counting Stars is Constant-Degree Optimal For Detecting Any Planted Subgraph
Xifan Yu, Ilias Zadik, Peiyuan Zhang
We study the computational limits of the following general hypothesis testing problem. Let H=H_n be an \emph{arbitrary} undirected graph on n vertices. We study the detection task…