Fetching the paper…
Reading the bibliography…
Finding efficient, easily implementable differentially private (DP) algorithms that offer strong excess risk bounds is an important problem in modern machine learning.
On general minimax theorems
Maurice Sion · 1958
Earlier work this paper cites.
A new penalty function method for constrained minimization
Barry W. Kort and Dimitri P. Bertsekas · 1972
Earlier work this paper cites.
Stability and generalization
Olivier Bousquet and Andre Elisseeff · 2002
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
Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith · 2006
Earlier work this paper cites.
Solving strongly monotone variational and quasi-variational inequalities
Yurii Nesterov and Laura Scrimali · 2007
Earlier work this paper cites.
Differentially private empirical risk minimization
Kamalika Chaudhuri, Claire Monteleoni, and Anand Sarwate · 2011
Earlier work this paper cites.
On solving large-scale finite minimax problems using exponential smoothing
E.Y. Pee and J. O. Royset · 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.
Differentially private empirical risk minimization: Efficient algorithms and tight error bounds
Raef Bassily, Adam Smith, and Abhradeep Thakurta · 2014
Earlier work this paper cites.
Simnets: A generalization of convolutional networks
Nadav Cohen and Amnon Shashua · 2014
Earlier work this paper cites.
The Algorithmic Foundations of Differential Privacy
Cynthia Dwork and Aaron Roth · 2014
Earlier work this paper cites.
Beyond the regret minimization barrier: Optimal algorithms for stochastic strongly-convex optimization
Elad Hazan and Satyen Kale · 2014
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course
Yurii Nesterov · 2014
Earlier work this paper cites.
Intriguing properties of neural networks
Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian Goodfellow, and Rob Fergus · 2014
Cited alongside, same era.
Convex optimization: Algorithms and complexity
Sebastian Bubeck · 2015
Cited alongside, same era.
Automated experiments on ad privacy settings: A tale of opacity, choice, and discrimination
Amit Datta, Michael Carl Tschantz, and Anupam Datta · 2015
Cited alongside, same era.
Explaining and harnessing adversarial examples
Ian Goodfellow, Jonathon Shlens, and Christian Szegedy · 2015
Cited alongside, same era.
A universal catalyst for first-order optimization
Hongzhou Lin, Julien Mairal, and Zaid Harchaoui · 2015
Cited alongside, same era.
Deep simnets
Nadav Cohen, Or Sharir, and Amnon Shashua · 2016
Cited alongside, same era.
Robust physical-world attacks on deep learning visual classification
Kevin Eykholt, Ivan Evtimov, Earlance Fernandes, Bo Li, Amir Rahmati, Chaowei Xiao, Atul Prakash, Tadayoshi Kohno, and Dawn Song · 2018
Later among the works it cites.
Towards deep learning models resistant to adversarial attacks
Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu · 2018
Later among the works it cites.
Private stochastic convex optimization with optimal rates
Raef Bassily, Vitaly Feldman, Kunal Talwar, and Abhradeep Guha Thakurta · 2019
Later among the works it cites.
Solving a class of non-convex min-max games using iterative first order methods
Maher Nouiehed, Maziar Sanjabi, Tianjian Huang, Jason D Lee, and Meisam Razaviyayn · 2019
Later among the works it cites.
Reviewing and improving the gaussian mechanism for differential privacy
Jun Zhao, Teng Wang, Tao Bai, Kwok-Yan Lam, Zhiying Xu, Shuyu Shi, Xuebin Ren, Xinyu Yang, Yang Liu, and Han Yu · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Train faster, generalize better: Stability of stochastic gradient descent
Moritz Hardt, Benjamin Recht, and Yoram Singer · 2016
Cited alongside, same era.
Deepfool: A simple and accurate method to fool deep neural networks
Seyed-Mohsen Moosavi-Dezfooli, Alhussein Fawzi, and Pascal Frossard · 2016
Cited alongside, same era.
The limitations of deep learning in adversarial settings
Nicolas Papernot, Patrick McDaniel, Somesh Jha, Matt Fredrikson, Z. Berkay Celik, and Ananthram Swami · 2016
Cited alongside, same era.
Biased importance sampling for deep neural network training
Angelos Katharopoulos and François Fleuret · 2017
Cited alongside, same era.
Differentially private empirical risk minimization revisited: Faster and more general
Di Wang, Minwei Ye, and Jinhui Xu · 2017
Cited alongside, same era.
Efficient private erm for smooth objectives
Jiaqi Zhang, Kai Zheng, Wenlong Mou, and Liwei Wang · 2017
Cited alongside, same era.
Theoretically principled trade-off between robustness and accuracy
Hongyang Zhang, Yaodong Yu, Jiantao Jiao, Eric Xing, Laurent El Ghaoui, and Michael Jordan · 2019
Later among the works it cites.
Accelerated methods for composite non-bilinear saddle point problem, 2020
Mohammad Alkousa, Darina Dvinskikh, Fedor Stonyakin, Alexander Gasnikov, and Dmitry Kovalev · 2020
Later among the works it cites.
Private stochastic convex optimization: Efficient algorithms for non-smooth objectives
Raman Arora, Teodor V. Marinov, and Enayat Ullah · 2020
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.
Tilted empirical risk minimization
Tian Li, Ahmad Beirami, Maziar Sanjabi, and Virginia Smith · 2020
Later among the works it cites.
Near-optimal algorithms for minimax optimization
Tianyi Lin, Chi Jin, and Michael I. Jordan · 2020
Later among the works it cites.
Scalable differential privacy with certified robustness in adversarial learning
Hai Phan, My T Thai, Han Hu, Ruoming Jin, Tong Sun, and Dejing Dou · 2020
Later among the works it cites.
Nonconvex min-max optimization: Applications, challenges, and recent theoretical advances
M. Razaviyayn, T. Huang, S. Lu, M. Nouiehed, M. Sanjabi, and M. Hong · 2020
Later among the works it cites.