Fetching the paper…
Reading the bibliography…
Excessive reuse of holdout data can lead to overfitting.
“Problem E 1399”
H.. Shapiro · 1960
Earlier work this paper cites.
“On two problems of information theory”
Paul Erdos and Alfr“’ed R“’enyi · 1963
Earlier work this paper cites.
“Mastermind”
Vasek Chv“’atal · 1983
Earlier work this paper cites.
“A decision-theoretic generalization of on-line learning and an application to boosting”
Y. Freund and R. Schapire · 1997
Earlier work this paper cites.
“Revealing information while preserving privacy”
I. Dinur and K. Nissim · 2003
Earlier work this paper cites.
“Calibrating noise to sensitivity in private data analysis”
C. Dwork, F. McSherry, K. Nissim and A. Smith · 2006
Earlier work this paper cites.
“The price of privacy and the limits of LP decoding”
Cynthia Dwork, Frank McSherry and Kunal Talwar · 2007
Earlier work this paper cites.
“Optimal Algorithms for the Coin Weighing Problem with a Spring Scale”
Nader. Bshouty · 2009
Earlier work this paper cites.
“Multi-class adaboost”
Trevor Hastie, Saharon Rosset, Ji Zhu and Hui Zou · 2009
Earlier work this paper cites.
“The price of privately releasing contingency tables and the spectra of random matrices with correlated rows”
Shiva Kasiviswanathan, Mark Rudelson, Adam Smith and Jonathan Ullman · 2010
Cited alongside, same era.
“The power of linear reconstruction attacks”
Shiva Kasiviswanathan, Mark Rudelson and Adam Smith · 2013
Cited alongside, same era.
“Preserving Statistical Validity in Adaptive Data Analysis” Extended abstract in STOC 2015
Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold and Aaron Roth · 2014
Cited alongside, same era.
“Preventing False Discovery in Interactive Data Analysis Is Hard”
M. Hardt and J. Ullman · 2014
Cited alongside, same era.
“The Ladder: A Reliable Leaderboard for Machine Learning Competitions”
Avrim Blum and Moritz Hardt · 2015
Cited alongside, same era.
“Interactive Fingerprinting Codes and the Hardness of Preventing False Discovery”
Thomas Steinke and Jonathan Ullman · 2015
Later among the works it cites.
“Estimation in high dimensions: a geometric perspective”
Roman Vershynin · 2015
Later among the works it cites.
“Algorithmic stability for adaptive data analysis”
Raef Bassily, Kobbi Nissim, Adam. Smith, Thomas Steinke, Uri Stemmer and Jonathan Ullman · 2016
Later among the works it cites.
“Playing mastermind with many colors”
Benjamin Doerr, Carola Doerr, Reto Sp“”ohel and Henning Thomas · 2016
Later among the works it cites.
“A short note on Poisson tail bounds” https://github.com/ccanonne/probabilitydistributiontoolbox/blob/master/poissonconcentration.pdf , 2017
C. Canonne · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Generalization in Adaptive Data Analysis and Holdout Reuse” Extended abstract in NIPS 2015
Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold and Aaron Roth · 2015
Cited alongside, same era.
“The reusable holdout: Preserving validity in adaptive data analysis”
Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold and Aaron Roth · 2015
Cited alongside, same era.
“Imagenet large scale visual recognition challenge”
Olga Russakovsky, Jia Deng, Hao Su, Jonathan Krause, Sanjeev Satheesh, Sean Ma, Zhiheng Huang, Andrej Karpathy, Aditya Khosla and Michael Bernstein · 2015
Cited alongside, same era.
“Mastermind (board game)”
Wikipedia
Cited in the paper.
Moritz Hardt · 2017
Later among the works it cites.
“Do CIFAR-10 Classifiers Generalize to CIFAR-10?”
Benjamin Recht, Rebecca Roelofs, Ludwig Schmidt and Vaishaal Shankar · 2018
Later among the works it cites.
“Do ImageNet Classifiers Generalize to ImageNet?”
Benjamin Recht, Rebecca Roelofs, Ludwig Schmidt and Vaishaal Shankar · 2019
Closest in time.