Fetching the paper…
Reading the bibliography…
The traditional notion of generalization---i.e., learning a hypothesis whose empirical error is close to its true error---is surprisingly brittle.
On the uniform convergence of relative frequencies of events to their probabilities
Vladimir N Vapnik and A Ya Chervonenkis · 1971
Earlier work this paper cites.
Relating data compression and learnability
Nick Littlestone and Manfred Warmuth · 1986
Earlier work this paper cites.
Occam’s razor
Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, and Manfred K Warmuth · 1990
Earlier work this paper cites.
An introduction to computational learning theory
Michael J Kearns and Umesh Virkumar Vazirani · 1994
Earlier work this paper cites.
A decision-theoretic generalization of on-line learning and an application to boosting
Yoav Freund and Robert E Schapire · 1997
Earlier work this paper cites.
Stability and generalization
Olivier Bousquet and André Elisseeff · 2002
Earlier work this paper cites.
Compressing to VC Dimension Many Points
Manfred K. Warmuth · 2003
Earlier work this paper cites.
General conditions for predictivity in learning theory
Tomaso Poggio, Ryan Rifkin, Sayan Mukherjee, and Partha Niyogi · 2004
Earlier work this paper cites.
Advances in Cryptology - EUROCRYPT 2006: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques. Proceedings
Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, and Moni Naor · 2006
Earlier work this paper cites.
Calibrating noise to sensitivity in private data analysis
Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith · 2006
Cited alongside, same era.
Mechanism design via differential privacy
Frank McSherry and Kunal Talwar · 2007
Cited alongside, same era.
A learning theory approach to noninteractive database privacy
Avrim Blum, Katrina Ligett, and Aaron Roth · 2008
Cited alongside, same era.
Learnability, stability and uniform convergence
Shai Shalev-Shwartz, Ohad Shamir, Nathan Srebro, and Karthik Sridharan · 2010
Cited alongside, same era.
What can we learn privately?
Shiva Prasad Kasiviswanathan, Homin K Lee, Kobbi Nissim, Sofya Raskhodnikova, and Adam Smith · 2011
Cited alongside, same era.
The algorithmic foundations of differential privacy
Cynthia Dwork and Aaron Roth · 2014
Cited alongside, same era.
Differentially private release and learning of threshold functions
Mark Bun, Kobbi Nissim, Uri Stemmer, and Salil P. Vadhan · 2015
Later among the works it cites.
Generalization in adaptive data analysis and holdout reuse
Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toni Pitassi, Omer Reingold, and Aaron Roth · 2015
Later among the works it cites.
Preserving statistical 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.
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.
Typicality-based stability and privacy
Raef Bassily and Yoav Freund · 2016
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Understanding Machine Learning: From Theory to Algorithms
S. Shalev-Shwartz and S. Ben-David · 2014
Cited alongside, same era.
The ladder: A reliable leaderboard for machine learning competitions
Avrim Blum and Moritz Hardt · 2015
Cited alongside, same era.
Raef Bassily, Kobbi Nissim, Adam D. Smith, Thomas Steinke, Uri Stemmer, and Jonathan Ullman · 2016
Closest in time.
Supervised learning through the lens of compression
Ofir David, Shay Moran, and Amir Yehudayof · 2016
Closest in time.
Controlling bias in adaptive data analysis using information theory
Daniel Russo and James Zou · 2016
Closest in time.