An optimized Franz-Parisi hardness criterion is proven equivalent to statistical query lower bounds under a verifiable correlation assumption, yielding new average-case hardness results for mixed sparse regression and convex truncation.
Algorithmic thresholds for tensor pca
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.ST 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
An Optimized Franz-Parisi Criterion and its Equivalence with SQ Lower Bounds
An optimized Franz-Parisi hardness criterion is proven equivalent to statistical query lower bounds under a verifiable correlation assumption, yielding new average-case hardness results for mixed sparse regression and convex truncation.