Fetching the paper…
Reading the bibliography…
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets.
A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
Chernoff, H · 1952
Earlier work this paper cites.
Probability inequalities for sums of bounded random variables
Hoeffding, W · 1963
Earlier work this paper cites.
Randomized response: A survey technique for eliminating evasive answer bias
Warner, S. L · 1965
Earlier work this paper cites.
Fast probabilistic algorithms for hamiltonian circuits and matchings
Angluin, D., and Valiant, L. G · 1979
Earlier work this paper cites.
Distribution-free performance bounds for potential function rules
Devroye, L., and Wagner, T · 1979
Earlier work this paper cites.
A theory of the learnable
Valiant, L. G · 1984
Earlier work this paper cites.
Occam’s razor
Blumer, A., Ehrenfeucht, A., Haussler, D., and Warmuth, M. K · 1987
Earlier work this paper cites.
On learning ring-sum-expansions
Fischer, P., and Simon, H.-U · 1992
Earlier work this paper cites.
Decision theoretic generalizations of the PAC model for neural net and other learning applications
Haussler, D · 1992
Earlier work this paper cites.
Learning integer lattices
Helmbold, D., Sloan, R., and Warmuth, M. K · 1992
Earlier work this paper cites.
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
Blum, A., Furst, M. L., Jackson, J., Kearns, M. J., Mansour, Y., and Rudich, S · 1994
Earlier work this paper cites.
Toward efficient agnostic learning
Kearns, M. J., Schapire, R. E., and Sellie, L. M · 1994
Earlier work this paper cites.
An Introduction to Computational Learning Theory
Kearns, M. J., and Vazirani, U. V · 1994
Earlier work this paper cites.
Efficient noise-tolerant learning from statistical queries
Kearns, M · 1998
Earlier work this paper cites.
Algorithmic stability and sanity-check bounds for leave-one-out cross-validation
Kearns, M., and Ron, D · 1999
Earlier work this paper cites.
Privacy-preserving data mining
Agrawal, R., and Srikant, R · 2000
Earlier work this paper cites.
On the design and quantification of privacy preserving data mining algorithms
Agrawal, D., and Aggarwal, C. C · 2001
Earlier work this paper cites.
Secure human identification protocols
Hopper, N. J., and Blum, M · 2001
Earlier work this paper cites.
Stability and generalization
Bousquet, O., and Elisseeff, A · 2002
Earlier work this paper cites.
On using extended statistical queries to avoid membership queries
Bshouty, N. H., and Feldman, V · 2002
Cited alongside, same era.
Almost-everywhere algorithmic stability and generalization error
Kutin, S., and Niyogi, P · 2002
Cited alongside, same era.
Randomized response, statistical disclosure control and misclassification: A review
van den Hout, A., and van der Heijden, P · 2002
Cited alongside, same era.
More on average case vs approximation complexity
Alekhnovich, M · 2003
Cited alongside, same era.
Noise-tolerant learning, the parity problem, and the statistical query model
Blum, A., Kalai, A., and Wasserman, H · 2003
Cited alongside, same era.
Revealing information while preserving privacy
Dinur, I., and Nissim, K · 2003
Cited alongside, same era.
Privacy via pseudorandom sketches
Mishra, N., and Sandler, M · 2006
Later among the works it cites.
Polling with physical envelopes: A rigorous analysis of a human-centric protocol
Moran, T., and Naor, M · 2006
Later among the works it cites.
Privacy, accuracy, and consistency too: a holistic solution to contingency table release
Barak, B., Chaudhuri, K., Dwork, C., Kale, S., McSherry, F., and Talwar, K · 2007
Later among the works it cites.
Stability of k k -means clustering
Ben-David, S., Pál, D., and Simon, H.-U · 2007
Later among the works it cites.
The price of privacy and the limits of lp decoding
Dwork, C., McSherry, F., and Talwar, K · 2007
Later among the works it cites.
Mechanism design via differential privacy
McSherry, F., and Talwar, K · 2007
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Limiting privacy breaches in privacy preserving data mining
Evfimievski, A., Gehrke, J., and Srikant, R · 2003
Cited alongside, same era.
Cryptographic randomized response techniques
Ambainis, A., Jakobsson, M., and Lipmaa, H · 2004
Cited alongside, same era.
Privacy-preserving datamining on vertically partitioned databases
Dwork, C., and Nissim, K · 2004
Cited alongside, same era.
Generalization bounds for averaged classifiers
Freund, Y., Mansour, Y., and Schapire, R. E · 2004
Cited alongside, same era.
A framework for high-accuracy privacy-preserving mining
Agrawal, S., and Haritsa, J. R · 2005
Cited alongside, same era.
Practical privacy: The SuLQ framework
Blum, A., Dwork, C., McSherry, F., and Nissim, K · 2005
Cited alongside, same era.
Smooth sensitivity and sampling in private data analysis
Nissim, K., Raskhodnikova, S., and Smith, A · 2007
Later among the works it cites.
The boundary between privacy and utility in data publishing
Rastogi, V., Hong, S., and Suciu, D · 2007
Later among the works it cites.
A learning theory approach to non-interactive database privacy
Blum, A., Ligett, K., and Roth, A · 2008
Closest in time.
On lower bounds for noise in private analysis of statistical databases
Dwork, C., and Yekahnin, S · 2008
Closest in time.
Statistical Methods in eCommerce Research
Jank, W., and Shmueli, G · 2008
Closest in time.
What can we learn privately?
Kasiviswanathan, S. P., Lee, H. K., Nissim, K., Raskhodnikova, S., and Smith, A · 2008
Closest in time.
A note on differential privacy: Defining resistance to arbitrary side information
Kasiviswanathan, S. P., and Smith, A · 2008
Closest in time.
Efficient, differentially private point estimators
Smith, A · 2008
Closest in time.
A statistical framework for differential privacy
Wasserman, L., and Zhou, S · 2008
Closest in time.
Differential privacy and robust statistics
Dwork, C., and Lei, J · 2009
Closest in time.
Differential privacy with compression
Zhou, S., Ligett, K., and Wasserman, L · 2009
Closest in time.
Bounds on the sample complexity for private learning and private data release
Beimel, A., Kasiviswanathan, S. P., and Nissim, K · 2010
Closest in time.