Fetching the paper…
Reading the bibliography…
A central issue in machine learning is how to train models on sensitive user data.
Probability with martingales
David Williams · 1991
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course , volume 87
Yurii Nesterov · 2003
Earlier work this paper cites.
Calibrating noise to sensitivity in private data analysis
Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith · 2006
Earlier work this paper cites.
Mechanism design via differential privacy
Frank McSherry and Kunal Talwar · 2007
Earlier work this paper cites.
Stochastic convex optimization
Shai Shalev-Shwartz, Ohad Shamir, Nathan Srebro, and Karthik Sridharan · 2009
Earlier work this paper cites.
Differentially private empirical risk minimization
Kamalika Chaudhuri, Claire Monteleoni, and Anand D. Sarwate · 2011
Earlier work this paper cites.
What can we learn privately?
Shiva Prasad Kasiviswanathan, Homin K Lee, Kobbi Nissim, Sofya Raskhodnikova, and Adam Smith · 2011
Earlier work this paper cites.
Bayesian learning via stochastic gradient Langevin dynamics
Max Welling and Yee Whye Teh · 2011
Earlier work this paper cites.
Private convex empirical risk minimization and high-dimensional regression
Daniel Kifer, Adam Smith, and Abhradeep Thakurta · 2012
Earlier work this paper cites.
Private empirical risk minimization: Efficient algorithms and tight error bounds
Raef Bassily, Adam Smith, and Abhradeep Thakurta · 2014
Earlier work this paper cites.
RAPPOR: Randomized aggregatable privacy-preserving ordinal response
Úlfar Erlingsson, Vasyl Pihur, and Aleksandra Korolova · 2014
Earlier work this paper cites.
(Near) dimension independent risk bounds for differentially private learning
Prateek Jain and Abhradeep Guha Thakurta · 2014
Earlier work this paper cites.
Rényi divergence and Kullback-Leibler divergence
Tim Van Erven and Peter Harremos · 2014
Earlier work this paper cites.
Convex optimization: Algorithms and complexity
Sébastien Bubeck · 2015
Earlier work this paper cites.
Nearly optimal private Lasso
Kunal Talwar, Abhradeep Thakurta, and Li Zhang · 2015
Earlier work this paper cites.
Concentrated differential privacy
Cynthia Dwork and Guy N Rothblum · 2016
Cited alongside, same era.
Train faster, generalize better: Stability of stochastic gradient descent
Moritz Hardt, Ben Recht, and Yoram Singer · 2016
Cited alongside, same era.
Differential privacy without sensitivity
Kentaro Minami, Hitomi Arai, Issei Sato, and Hiroshi Nakagawa · 2016
Cited alongside, same era.
Apple previews IOS 10, the biggest IOS release ever, 2016
Apple Press · 2016
Cited alongside, same era.
Theoretical guarantees for approximate sampling from smooth and log-concave densities
Arnak Dalalyan · 2017
Cited alongside, same era.
Collecting telemetry data privately
Bolin Ding, Janardhan Kulkarni, and Sergey Yekhanin · 2017
Rényi differential privacy of the Sampled Gaussian Mechanism
Ilya Mironov, Kunal Talwar, and Li Zhang · 2019
Later among the works it cites.
Rapid convergence of the unadjusted Langevin algorithm: Isoperimetry suffices
Santosh Vempala and Andre Wibisono · 2019
Later among the works it cites.
Private stochastic convex optimization: optimal rates in linear time
Vitaly Feldman, Tomer Koren, and Kunal Talwar · 2020
Later among the works it cites.
Faster differentially private samplers via Rényi divergence analysis of discretized Langevin MCMC
Arun Ganesh and Kunal Talwar · 2020
Later among the works it cites.
LinkedIn’s audience engagements API: A privacy preserving data analytics system at scale
Ryan Rogers, Subbu Subramaniam, Sean Peng, David Durfee, Seunghyun Lee, Santosh Kumar Kancha, Shraddha Sahay, and Parvez Ahammad · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Rényi differential privacy
Ilya Mironov · 2017
Cited alongside, same era.
Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis
Michael Mitzenmacher and Eli Upfal · 2017
Cited alongside, same era.
JAX: composable transformations of Python+NumPy programs, 2018
James Bradbury, Roy Frostig, Peter Hawkins, Matthew James Johnson, Chris Leary, Dougal Maclaurin, George Necula, Adam Paszke, Jake VanderPlas, Skye Wanderman-Milne, and Qiao Zhang · 2018
Cited alongside, same era.
Sampling from a log-concave distribution with Projected Langevin Monte Carlo
Sébastien Bubeck, Ronen Eldan, and Joseph Lehec · 2018
Cited alongside, same era.
Privacy amplification by iteration
Vitaly Feldman, Ilya Mironov, Kunal Talwar, and Abhradeep Thakurta · 2018
Cited alongside, same era.
Private stochastic convex optimization with optimal rates
Raef Bassily, Vitaly Feldman, Kunal Talwar, and Abhradeep Thakurta · 2019
Cited alongside, same era.
Non-Euclidean differentially private stochastic convex optimization
Raef Bassily, Cristobal Guzman, and Anupama Nandi · 2021
Later among the works it cites.
Differential privacy dynamics of Langevin diffusion and noisy gradient descent
Rishav Chourasia, Jiayuan Ye, and Reza Shokri · 2021
Later among the works it cites.
Evading the curse of dimensionality in unconstrained private GLMs
Shuang Song, Thomas Steinke, Om Thakkar, and Abhradeep Thakurta · 2021
Later among the works it cites.
For the U.S. census, keeping your data anonymous and useful is a tricky balance
Hansi Wang · 2021
Later among the works it cites.
Opacus: User-friendly differential privacy library in PyTorch
Ashkan Yousefpour, Igor Shilov, Alexandre Sablayrolles, Davide Testuggine, Karthik Prasad, Mani Malek, John Nguyen, Sayan Ghosh, Akash Bharadwaj, Jessica Zhao, et al · 2021
Later among the works it cites.
Langevin diffusion: An almost universal algorithm for private Euclidean (convex) optimization
Arun Ganesh, Abhradeep Thakurta, and Jalaj Upadhyay · 2022
Closest in time.
Private convex optimization via exponential mechanism
Sivakanth Gopi, Yin Tat Lee, and Daogao Liu · 2022
Closest in time.
Differential privacy guarantees for stochastic gradient Langevin dynamics
Theo Ryffel, Francis Bach, and David Pointcheval · 2022
Closest in time.
Differentially private learning needs hidden state (or much faster convergence)
Jiayuan Ye and Reza Shokri · 2022
Closest in time.