Fetching the paper…
Reading the bibliography…
We give a survey of the foundations of statistical queries and their many applications to other areas.
A stochastic approximation method
Herbert Robbins and Sutton Monro · 1951
Earlier work this paper cites.
Maximum likelihood from incomplete data via the em algorithm
A. P. Dempster, N. M. Laird, and D. B. Rubin · 1977
Earlier work this paper cites.
Optimization by simulated annealing
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi · 1983
Earlier work this paper cites.
A theory of the learnable
Leslie G. Valiant · 1984
Earlier work this paper cites.
Learning disjunction of conjunctions
Leslie G. Valiant · 1985
Earlier work this paper cites.
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
V. Černý · 1985
Earlier work this paper cites.
Learning from noisy examples
Dana Angluin and Philip D. Laird · 1987
Earlier work this paper cites.
The calculation of posterior distributions by data augmentation (with discussion)
M Tanner and W Wong · 1987
Earlier work this paper cites.
Sampling based approaches to calculating marginal densities
A. E. Gelfand and A. F. M. Smith · 1990
Earlier work this paper cites.
The strength of weak learnability
Robert E. Schapire · 1990
Earlier work this paper cites.
Large cliques elude the metropolis process
Mark Jerrum · 1992
Earlier work this paper cites.
Weakly learning DNF and characterizing statistical query learning using fourier analysis
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, Michael J. Kearns, Yishay Mansour, and Steven Rudich · 1994
Earlier work this paper cites.
Learning by distances
Shai Ben-David, Alon Itai, and Eyal Kushilevitz · 1995
Earlier work this paper cites.
Support-vector networks
Corinna Cortes and Vladimir Vapnik · 1995
Earlier work this paper cites.
Finding a large hidden clique in a random graph
Noga Alon, Michael Krivelevich, and Benny Sudakov · 1998
Earlier work this paper cites.
Efficient noise-tolerant learning from statistical queries
Michael J. Kearns · 1998
Earlier work this paper cites.
On using extended statistical queries to avoid membership queries
Nader H. Bshouty and Vitaly Feldman · 2002
Earlier work this paper cites.
Noise-tolerant learning, the parity problem, and the statistical query model
Avrim Blum, Adam Kalai, and Hal Wasserman · 2003
Cited alongside, same era.
A probabilistic active support vector learning algorithm
Pabitra Mitra, C. A. Murthy, and Sankar K. Pal · 2004
Cited alongside, same era.
Practical privacy: the sulq framework
Avrim Blum, Cynthia Dwork, Frank McSherry, and Kobbi Nissim · 2005
Cited alongside, same era.
New lower bounds for statistical query learning
Ke Yang · 2005
Cited alongside, same era.
Map-reduce for machine learning on multicore
Cheng-Tao Chu, Sang Kyun Kim, Yi-An Lin, YuanYuan Yu, Gary R. Bradski, Andrew Y. Ng, and Kunle Olukotun · 2006
Cited alongside, same era.
Calibrating noise to sensitivity in private data analysis
Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam D. Smith · 2006
Cited alongside, same era.
What can we learn privately?
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, and Adam D. Smith · 2011
Later among the works it cites.
A complete characterization of statistical query learning with applications to evolvability
Vitaly Feldman · 2012
Later among the works it cites.
Preventing false discovery in interactive data analysis is hard
Moritz Hardt and Jonathan Ullman · 2014
Later among the works it cites.
Analysis of boolean functions
Ryan O’Donnell · 2014
Later among the works it cites.
Lattice cryptography for the internet
Chris Peikert · 2014
Later among the works it cites.
The reusable holdout: Preserving validity in adaptive data analysis
Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, and Aaron Roth · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A characterization of strong learnability in the statistical query model
Hans Ulrich Simon · 2007
Cited alongside, same era.
A simple polynomial-time rescaling algorithm for solving linear programs
John Dunagan and Santosh Vempala · 2008
Cited alongside, same era.
Evolvability from learning algorithms
Vitaly Feldman · 2008
Cited alongside, same era.
Halfspace matrices
Alexander A. Sherstov · 2008
Cited alongside, same era.
On evolvability: The swapping algorithm, product distributions, and covariance
Dimitrios I. Diochnos and György Turán · 2009
Cited alongside, same era.
Characterizing statistical query learning: Simplified notions and proofs
Balázs Szörényi · 2009
Cited alongside, same era.
On the complexity of random satisfiability problems with planted solutions
Vitaly Feldman, Will Perkins, and Santosh Vempala · 2015
Later among the works it cites.
Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem
Gregory Valiant · 2015
Later among the works it cites.
On the uniform convergence of relative frequencies of events to their probabilities
Vladimir N Vapnik and A Ya Chervonenkis · 2015
Later among the works it cites.
Algorithmic stability for adaptive data analysis
Raef Bassily, Kobbi Nissim, Adam D. Smith, Thomas Steinke, Uri Stemmer, and Jonathan Ullman · 2016
Later among the works it cites.
Memory, communication, and statistical queries
Jacob Steinhardt, Gregory Valiant, and Stefan Wager · 2016
Later among the works it cites.
A general characterization of the statistical query complexity
Vitaly Feldman · 2017
Later among the works it cites.
Statistical algorithms and a lower bound for detecting planted cliques
Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh Srinivas Vempala, and Ying Xiao · 2017
Later among the works it cites.
Algorithmic Learning Theory, ALT 2018, 7-9 April 2018, Lanzarote, Canary Islands, Spain , volume 83 of Proceedings of Machine Learning Research , 2018. PMLR
Firdaus Janoos, Mehryar Mohri, and Karthik Sridharan, editors · 2018
Later among the works it cites.
Compressing interactive communication under product distributions
Alexander A. Sherstov · 2018
Later among the works it cites.
Sampling without compromising accuracy in adaptive data analysis
Benjamin Fish, Lev Reyzin, and Benjamin I. P. Rubinstein · 2020
Closest in time.
Exponential separations in local differential privacy
Matthew Joseph, Jieming Mao, and Aaron Roth · 2020
Closest in time.