Fetching the paper…
Reading the bibliography…
Datasets are often used multiple times and each successive analysis may depend on the outcome of previous analyses.
“On a modification of chebyshev’s inequality and of the error formula of laplace”
Sergei Bernstein · 1924
Earlier work this paper cites.
“Efficient noise-tolerant Learning from statistical queries”
M. Kearns · 1998
Earlier work this paper cites.
“PAC-Bayesian Model Averaging”
David. McAllester · 1999
Earlier work this paper cites.
“Stability and generalization”
Olivier Bousquet and Andr\’e Elisseeff · 2002
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.
“Clustering with Bregman divergences”
Arindam Banerjee, Srujana Merugu, Inderjit Dhillon and Joydeep Ghosh · 2005
Earlier work this paper cites.
“Our data, ourselves: Privacy via distributed noise generation”
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”
C. Dwork, F. McSherry, K. Nissim and A. Smith · 2006
Earlier work this paper cites.
“Functional Bregman divergence and Bayesian estimation of distributions”
B\’ela Frigyik, Santosh Srivastava and Maya Gupta · 2008
Earlier work this paper cites.
“Entropy and information theory”
Robert Gray · 2011
Earlier work this paper cites.
“Elements of information theory”
Thomas Cover and Joy Thomas · 2012
Cited alongside, same era.
“Rényi divergence measures for commonly used univariate continuous distributions”
Manuel Gil, Fady Alajaji and Tamas Linder · 2013
Cited alongside, same era.
“A PAC-Bayesian tutorial with a dropout bound”
David McAllester · 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.
“Concentrated differential privacy: Simplifications, extensions, and lower bounds”
Mark Bun and Thomas Steinke · 2016
Later among the works it cites.
“Max-information, differential privacy, and post-selection hypothesis testing”
Ryan Rogers, Aaron Roth, Adam Smith and Om Thakkar · 2016
Later among the works it cites.
“Information-theoretic analysis of stability and bias of learning algorithms”
Maxim Raginsky, Alexander Rakhlin, Matthew Tsao, Yihong Wu and Aolin Xu · 2016
Later among the works it cites.
“Controlling bias in adaptive data analysis using information theory”
Daniel Russo and James Zou · 2016
Later among the works it cites.
“Adaptive Data Analysis” Lecture Notes, 2016
Thomas Steinke · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Tim Van and Peter Harremos · 2014
Cited alongside, same era.
“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.
“Interactive Fingerprinting Codes and the Hardness of Preventing False Discovery”
Thomas Steinke and Jonathan Ullman · 2015
Cited alongside, same era.
“Typicality-Based Stability and Privacy”
Raef Bassily and Yoav Freund · 2016
Cited alongside, same era.
“Algorithmic stability for adaptive data analysis”
Raef Bassily, Kobbi Nissim, Adam. Smith, Thomas Steinke, Uri Stemmer and Jonathan Ullman · 2016
Cited alongside, same era.
“On-Average KL-Privacy and Its Equivalence to Generalization for Max-Entropy Mechanisms”
Yu-Xiang Wang, Jing Lei and Stephen Fienberg · 2016
Later among the works it cites.
“Generalization for Adaptively-chosen Estimators via Stable Median”
Vitaly Feldman and Thomas Steinke · 2017
Closest in time.
“Rényi Differential Privacy”
Ilya Mironov · 2017
Closest in time.
“Information-theoretic analysis of generalization capability of learning algorithms”
Aolin Xu and Maxim Raginsky · 2017
Closest in time.
“Learners that Use Little Information”
Raef Bassily, Shay Moran, Ido Nachum, Jonathan Shafer and Amir Yehudayoff · 2018
Closest in time.