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.