On the public citation graph
A complete characterization of statistical query learning with applications to evolvability
0 signed · 64 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1998.2664openalex-snapshot
General Bounds on Statistical Query Learning and PAC Learning with Noise via Hypothesis Boosting
inferredcites →https://doi.org/10.1006/jcss.1997.1558openalex-snapshot
Specification and Simulation of Statistical Query Algorithms for Efficiency and Noise Tolerance
inferredcites →https://doi.org/10.1007/978-3-540-70918-3_34openalex-snapshot
A Characterization of Strong Learnability in the Statistical Query Model
inferredcites →https://doi.org/10.1007/978-3-642-04414-4_18openalex-snapshot
Characterizing Statistical Query Learning: Simplified Notions and Proofs
inferredcites →https://doi.org/10.1007/bf00993468openalex-snapshot
Toward efficient agnostic learning
inferredcites →https://doi.org/10.1007/s10994-007-5010-1openalex-snapshot
Unconditional lower bounds for learning intersections of halfspaces
inferredcites →https://doi.org/10.1016/0890-5401(92)90010-dopenalex-snapshot
Decision theoretic generalizations of the PAC model for neural net and other learning applications
inferredcites →https://doi.org/10.1016/j.jcss.2004.10.003openalex-snapshot
New lower bounds for statistical query learning
inferredcites →https://doi.org/10.1016/j.jcss.2007.03.003openalex-snapshot
A general dimension for query learning
inferredcites →https://doi.org/10.1023/a:1022949332276openalex-snapshot
Boosting and Hard-Core Set Construction
inferredcites →https://doi.org/10.1109/focs.2009.35openalex-snapshot
A Complete Characterization of Statistical Query Learning with Applications to Evolvability
inferredcites →https://doi.org/10.1109/sfcs.1995.492584openalex-snapshot
Hard-core distributions for somewhat hard problems
inferredcites →https://doi.org/10.1109/sfcs.1998.743491openalex-snapshot
On learning monotone Boolean functions
inferredcites →https://doi.org/10.1137/070684914openalex-snapshot
On Agnostic Learning of Parities, Monomials, and Halfspaces
inferredcites →https://doi.org/10.1137/1.9781611973068.129openalex-snapshot
The Uniform Hardcore Lemma via Approximate Bregman Projections
inferredcites →https://doi.org/10.1145/1007352.1007404openalex-snapshot
A simple polynomial-time rescaling algorithm for solving linear programs
inferredcites →https://doi.org/10.1145/1374376.1374465openalex-snapshot
Evolvability from learning algorithms
inferredcites →https://doi.org/10.1145/174644.174647openalex-snapshot
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
inferredcites →https://doi.org/10.1145/180139.181176openalex-snapshot
Learning linear threshold functions in the presence of classification noise
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/225058.225125openalex-snapshot
On the Fourier spectrum of monotone functions
inferredcites →https://doi.org/10.1145/293347.293351openalex-snapshot
Efficient noise-tolerant learning from statistical queries
inferredcites →https://doi.org/10.1145/792538.792543openalex-snapshot
Noise-tolerant learning, the parity problem, and the statistical query model
inferredcites →https://doi.org/10.7551/mitpress/7503.003.0040openalex-snapshot
Map-Reduce for Machine Learning on Multicore
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_401openalex-snapshot
Statistical Query Learning
inferred← citeshttps://doi.org/10.1007/978-3-030-29414-4_11openalex-snapshot
Computational Complexity Analysis of Genetic Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-46379-7_7openalex-snapshot
On the Evolution of Monotone Conjunctions: Drilling for Best Approximations
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/s00453-014-9954-9openalex-snapshot
Statistical Active Learning Algorithms for Noise Tolerance and Differential Privacy
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.1093/jamia/ocv017openalex-snapshot
A system to build distributed multivariate models and manage disparate data sharing policies: implementation in the scalable national network for effectiveness research
inferred← citeshttps://doi.org/10.1103/prxquantum.2.040337openalex-snapshot
Learnability of Quantum Neural Networks
inferred← citeshttps://doi.org/10.1109/focs.2017.73openalex-snapshot
A Time-Space Lower Bound for a Large Class of Learning Problems
inferred← citeshttps://doi.org/10.1137/1.9781611973730.34openalex-snapshot
Approximate resilience, monotonicity, and the complexity of agnostic learning
inferred← citeshttps://doi.org/10.1137/1.9781611974782.82openalex-snapshot
Statistical Query Algorithms for Stochastic Convex Optimization
inferred← citeshttps://doi.org/10.1137/110857714openalex-snapshot
Privately Releasing Conjunctions and the Statistical Query Barrier
inferred← citeshttps://doi.org/10.1137/16m1078471openalex-snapshot
On the Complexity of Random Satisfiability Problems with Planted Solutions
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/2746539.2746577openalex-snapshot
On the Complexity of Random Satisfiability Problems with Planted Solutions
inferred← citeshttps://doi.org/10.1145/3046674openalex-snapshot
Statistical Algorithms and a Lower Bound for Detecting Planted Cliques
inferred← citeshttps://doi.org/10.1613/jair.1.12050openalex-snapshot
On the Evolvability of Monotone Conjunctions with an Evolutionary Mutation Mechanism
inferred← citeshttps://doi.org/10.22331/q-2022-02-02-640openalex-snapshot
On the Hardness of PAC-learning Stabilizer States with Noise
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2014.793openalex-snapshot
Embedding Hard Learning Problems Into Gaussian Space
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.1304.2079openalex-snapshot
Learning Coverage Functions and Private Release of Marginals
inferred← citeshttps://doi.org/10.48550/arxiv.1405.6791openalex-snapshot
Agnostic Learning of Disjunctions on Symmetric Distributions
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.1704.02708openalex-snapshot
Evolving a Vector Space with any Generating Set
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.2006.15812openalex-snapshot
Statistical-Query Lower Bounds via Functional Gradients
inferred← citeshttps://doi.org/10.48550/arxiv.2008.08059openalex-snapshot
When Hardness of Approximation Meets Hardness of Learning
inferred← citeshttps://doi.org/10.48550/arxiv.2010.11925openalex-snapshot
The Polynomial Method is Universal for Distribution-Free Correlational SQ Learning
inferred← citeshttps://doi.org/10.48550/arxiv.2102.00434openalex-snapshot
The Connection Between Approximation, Depth Separation and Learnability in Neural Networks
inferred← citeshttps://doi.org/10.7916/d8251gb1openalex-snapshot
Analytic Methods in Concrete Complexity
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.