On the public citation graph

New lower bounds for statistical query learning

0 signed · 45 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/0471200611openalex-snapshot
Elements of Information Theory
inferredcites →https://doi.org/10.1007/3-540-45583-3_7openalex-snapshot
On Learning Correlated Boolean Functions Using Statistical Queries (Extended Abstract)
inferredcites →https://doi.org/10.1007/978-1-4899-3184-9openalex-snapshot
Introduction to Multivariate Analysis
inferredcites →https://doi.org/10.1007/978-3-0348-8645-1_7openalex-snapshot
Elements of Information Theory
inferredcites →https://doi.org/10.1007/bf00993593openalex-snapshot
Sample Compression, Learnability, and the Vapnik-Chervonenkis Dimension
inferredcites →https://doi.org/10.1016/0016-0032(59)90368-0openalex-snapshot
Information theory and statistics
inferredcites →https://doi.org/10.1016/0378-4754(89)90164-xopenalex-snapshot
Linear algebra and its applications
inferredcites →https://doi.org/10.1017/cbo9780511810817openalex-snapshot
Matrix Analysis
inferredcites →https://doi.org/10.1023/a:1024697502780openalex-snapshot
On the Efficiency of Noise-Tolerant PAC Algorithms Derived from Statistical Queries
inferredcites →https://doi.org/10.1080/00401706.1983.10487903openalex-snapshot
Introduction to Multivariate Analysis
inferredcites →https://doi.org/10.1145/167088.167200openalex-snapshot
Efficient noise-tolerant learning from statistical queries
inferredcites →https://doi.org/10.1145/195058.195147openalex-snapshot
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
inferredcites →https://doi.org/10.1145/225298.225351openalex-snapshot
Specification and simulation of statistical query algorithms for efficiency and noise tolerance
inferredcites →https://doi.org/10.1145/3749740.3749746openalex-snapshot
A Theory of the Learnable
inferredcites →https://doi.org/10.1214/aoms/1177729694openalex-snapshot
On Information and Sufficiency
inferredcites →https://doi.org/10.2307/2309734openalex-snapshot
Information Theory and Statistics.
inferredcites →https://doi.org/10.5860/choice.31-5500openalex-snapshot
Neural networks for pattern recognition

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cpa.22121openalex-snapshot
Polynomial‐time universality and limitations of deep learning
inferred← citeshttps://doi.org/10.1007/11893318_5openalex-snapshot
Spectral Norm in Learning Theory: Some Selected Topics
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_401openalex-snapshot
Statistical Query Learning
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_34openalex-snapshot
A Characterization of Strong Learnability in the Statistical Query Model
inferred← citeshttps://doi.org/10.1007/978-3-642-04414-4_18openalex-snapshot
Characterizing Statistical Query Learning: Simplified Notions and Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_401-2openalex-snapshot
Statistical Query Learning (1998; Kearns)
inferred← citeshttps://doi.org/10.1007/s00037-008-0242-4openalex-snapshot
Halfspace Matrices
inferred← citeshttps://doi.org/10.1007/s10994-007-5010-1openalex-snapshot
Unconditional lower bounds for learning intersections of halfspaces
inferred← citeshttps://doi.org/10.1007/s12559-023-10219-3openalex-snapshot
Machine Un-learning: An Overview of Techniques, Applications, and Future Directions
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.12.024openalex-snapshot
A complete characterization of statistical query learning with applications to evolvability
inferred← citeshttps://doi.org/10.1038/s41467-025-68097-2openalex-snapshot
Quantum advantage for learning shallow neural networks with natural data distributions
inferred← citeshttps://doi.org/10.1109/ccc.2003.1214420openalex-snapshot
On statistical query sampling and NMR quantum computing
inferred← citeshttps://doi.org/10.1109/ccc.2007.11openalex-snapshot
Halfspace Matrices
inferred← citeshttps://doi.org/10.1109/focs.2008.27openalex-snapshot
What Can We Learn Privately?
inferred← citeshttps://doi.org/10.1109/focs.2009.35openalex-snapshot
A Complete Characterization of Statistical Query Learning with Applications to Evolvability
inferred← citeshttps://doi.org/10.1137/090756090openalex-snapshot
What Can We Learn Privately?
inferred← citeshttps://doi.org/10.1145/1374376.1374465openalex-snapshot
Evolvability from learning algorithms
inferred← citeshttps://doi.org/10.1145/2488608.2488692openalex-snapshot
Statistical algorithms and a lower bound for detecting planted cliques
inferred← citeshttps://doi.org/10.1145/3046674openalex-snapshot
Statistical Algorithms and a Lower Bound for Detecting Planted Cliques
inferred← citeshttps://doi.org/10.48550/arxiv.0803.0924openalex-snapshot
What Can We Learn Privately?
inferred← citeshttps://doi.org/10.48550/arxiv.1201.1214openalex-snapshot
Statistical Algorithms and a Lower Bound for Detecting Planted Clique
inferred← citeshttps://doi.org/10.48550/arxiv.1512.08861openalex-snapshot
Sharp Computational-Statistical Phase Transitions via Oracle Computational Model
inferred← citeshttps://doi.org/10.48550/arxiv.1608.02198openalex-snapshot
A General Characterization of the Statistical Query Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.1808.06996openalex-snapshot
Curse of Heterogeneity: Computational Barriers in Sparse Mixture Models and Phase Retrieval
inferred← citeshttps://doi.org/10.48550/arxiv.2004.00557openalex-snapshot
Statistical Queries and Statistical Algorithms: Foundations and Applications
inferred← citeshttps://doi.org/10.48550/arxiv.2108.04190openalex-snapshot
On the Power of Differentiable Learning versus PAC and SQ Learning
inferred← citeshttps://doi.org/10.7916/d8251gb1openalex-snapshot
Analytic Methods in Concrete Complexity
inferred← citeshttps://doi.org/10.7916/d8w66sm1openalex-snapshot
On the Learnability of Monotone Functions
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.