An Optimized Franz-Parisi Criterion and its Equivalence with SQ Lower Bounds

NeurIPSOral2025

Authors
Siyu Chen, Theodor Misiakiewicz, Ilias Zadik, Peiyuan Zhang
Affiliation
Yale University
Venue
NeurIPS 2025
Track
Oral

TL;DR

We propose a refined Franz-Parisi criterion, and show that it is equivalent to Statistical Query lower bounds under a mild, verifiable assumption satisfied by a broad class of statistical models.

Opening excerpt from the authors’ abstract. source

Read the paper

← All NeurIPS 2025 Oral papers · Browse the whole archive