Search Results for author:
Found 1 papers, 0 papers with code
Counterexamples to the Low-Degree Conjecture
A conjecture of Hopkins (2018) posits that for certain high-dimensional hypothesis testing problems, no polynomial-time algorithm can outperform so-called "simple statistics", which are low-degree polynomials in the data.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
