REVIEW 2 cited by
Statistical Queries and Statistical Algorithms: Foundations and Applications
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We give a survey of the foundations of statistical queries and their many applications to other areas. We introduce the model, give the main definitions, and we explore the fundamental theory statistical queries and how how it connects to various notions of learnability. We also give a detailed summary of some of the applications of statistical queries to other areas, including to optimization, to evolvability, and to differential privacy.
Forward citations
Cited by 2 Pith papers
-
Multiple Planted Structures Below $\sqrt{n}$: An SoS Integrality Gap and an SQ Lower Bound
Sum-of-Squares and statistical query algorithms cannot efficiently refute or detect multiple disjoint planted cliques or bicliques below the sqrt(n) total-size threshold.
-
LLM Priors for ERM over Programs
LLM-ERM uses LLM-proposed candidate programs plus validation-based selection to learn short program rules (parity, primality, palindromes) from about 200 examples, while SGD-trained transformers overfit.
Discussion (0). Sign in to comment.