Fetching the paper…
Reading the bibliography…
In this paper, we study private optimization problems for non-smooth convex functions $F(x)=\mathbb{E}_i f_i(x)$ on $\mathbb{R}^d$.
On measures of entropy and information
Alfréd Rényi · 1961
Earlier work this paper cites.
Gibbs sampling approach for generation of truncated multivariate gaussian random variables
Jayesh H Kotecha and Petar M Djuric · 1999
Earlier work this paper cites.
Concentration of measure and logarithmic sobolev inequalities
Michel Ledoux · 1999
Earlier work this paper cites.
Generalization of an inequality by talagrand and links with the logarithmic sobolev inequality
Felix Otto and Cédric Villani · 2000
Earlier work this paper cites.
Stability and generalization
Olivier Bousquet and André 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.
Simulated annealing for convex optimization
Adam Tauman Kalai and Santosh Vempala · 2006
Earlier work this paper cites.
Mechanism design via differential privacy
Frank McSherry and Kunal Talwar · 2007
Earlier work this paper cites.
Privacy-preserving logistic regression
Kamalika Chaudhuri and Claire Monteleoni · 2008
Earlier work this paper cites.
Stochastic convex optimization
Shai Shalev-Shwartz, Ohad Shamir, Nathan Srebro, and Karthik Sridharan · 2009
Earlier work this paper cites.
On the geometry of differential privacy
Moritz Hardt and Kunal Talwar · 2010
Earlier work this paper cites.
Probabilistic inference and differential privacy
Oliver Williams and Frank McSherry · 2010
Earlier work this paper cites.
A statistical framework for differential privacy
Larry Wasserman and Shuheng Zhou · 2010
Earlier work this paper cites.
Differentially private empirical risk minimization
Kamalika Chaudhuri, Claire Monteleoni, and Anand D Sarwate · 2011
Earlier work this paper cites.
On the fundamental limits of adaptive sensing
Ery Arias-Castro, Emmanuel J Candes, and Mark A Davenport · 2012
Earlier work this paper cites.
The exponential mechanism for social welfare: Private, truthful, and nearly optimal
Zhiyi Huang and Sampath Kannan · 2012
Earlier work this paper cites.
Learning in a large function space: Privacy-preserving mechanisms for svm learning
Benjamin IP Rubinstein, Peter L Bartlett, Ling Huang, and Nina Taft · 2012
Earlier work this paper cites.
Private learning and sanitization: Pure vs. approximate differential privacy
Amos Beimel, Kobbi Nissim, and Uri Stemmer · 2013
Earlier work this paper cites.
A near-optimal algorithm for differentially-private principal components
Kamalika Chaudhuri, Anand D Sarwate, and Kaushik Sinha · 2013
Earlier work this paper cites.
On differentially private low rank approximation
Michael Kapralov and Kunal Talwar · 2013
Earlier work this paper cites.
Differentially private feature selection via stability arguments, and the robustness of the lasso
Abhradeep Guha Thakurta and Adam Smith · 2013
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.
Optimal rates for zero-order convex optimization: The power of two function evaluations
John C Duchi, Michael I Jordan, Martin J Wainwright, and Andre Wibisono · 2015
Cited alongside, same era.
The challenge of scientific reproducibility and privacy protection for statistical agencies
John M. Abowd · 2016
Cited alongside, same era.
Generalization of erm in stochastic convex optimization: The dimension strikes back
Vitaly Feldman · 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.
Efficient private empirical risk minimization for high-dimensional learning
Shiva Prasad Kasiviswanathan and Hongxia Jin · 2016
Cited alongside, same era.
Differential privacy without sensitivity
Kentaro Minami, HItomi Arai, Issei Sato, and Hiroshi Nakagawa · 2016
Gaussian differential privacy
Jinshuo Dong, Aaron Roth, and Weijie J Su · 2019
Later among the works it cites.
Towards practical differentially private convex optimization
Roger Iyengar, Joseph P Near, Dawn Song, Om Thakkar, Abhradeep Thakurta, and Lun Wang · 2019
Later among the works it cites.
Private selection from private candidates
Jingcheng Liu and Kunal Talwar · 2019
Later among the works it cites.
The randomized midpoint method for log-concave sampling
Ruoqi Shen and Yin Tat Lee · 2019
Later among the works it cites.
Applying differential privacy mechanism in artificial intelligence
Tianqing Zhu and S Yu Philip · 2019
Later among the works it cites.
Stability of stochastic gradient descent on nonsmooth convex losses
Raef Bassily, Vitaly Feldman, Cristóbal Guzmán, and Kunal Talwar · 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.
Lipschitz extensions for node-private graph statistics and the generalized exponential mechanism
Sofya Raskhodnikova and Adam Smith · 2016
Cited alongside, same era.
Learning with privacy at scale
Differential Privacy Team Apple · 2017
Cited alongside, same era.
Prochlo: Strong privacy for analytics in the crowd
Andrea Bittau, Úlfar Erlingsson, Petros Maniatis, Ilya Mironov, Ananth Raghunathan, David Lie, Mitch Rudominer, Ushasree Kode, Julien Tinnes, and Bernhard Seefeld · 2017
Cited alongside, same era.
Theoretical guarantees for approximate sampling from smooth and log-concave densities
Arnak S Dalalyan · 2017
Cited alongside, same era.
Collecting telemetry data privately
Bolin Ding, Janardhan Kulkarni, and Sergey Yekhanin · 2017
Cited alongside, same era.
Differentially private empirical risk minimization with input perturbation
Kazuto Fukuchi, Quang Khai Tran, and Jun Sakuma · 2017
Cited alongside, same era.
Langevin monte carlo without smoothness
Niladri Chatterji, Jelena Diakonikolas, Michael I Jordan, and Peter Bartlett · 2020
Later among the works it cites.
Fast mixing of metropolized hamiltonian monte carlo: Benefits of multi-step gradients
Yuansi Chen, Raaz Dwivedi, Martin J Wainwright, and Bin Yu · 2020
Later among the works it cites.
The discrete gaussian for differential privacy
Clément L Canonne, Gautam Kamath, and Thomas Steinke · 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.
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.
Logsmooth gradient concentration and tighter runtimes for metropolized hamiltonian monte carlo
Yin Tat Lee, Ruoqi Shen, and Kevin Tian · 2020
Later among the works it cites.
Private stochastic convex optimization: Optimal rates in l1 geometry
Hilal Asi, Vitaly Feldman, Tomer Koren, and Kunal Talwar · 2021
Later among the works it cites.
Non-euclidean differentially private stochastic convex optimization
Raef Bassily, Cristóbal Guzmán, and Anupama Nandi · 2021
Later among the works it cites.
An almost constant lower bound of the isoperimetric coefficient in the kls conjecture
Yuansi Chen · 2021
Later among the works it cites.
Reducing isotropy and volume to kls: an o ( n 3 ψ 2 ) o(n^{3}\psi^{2}) volume algorithm
He Jia, Aditi Laddha, Yin Tat Lee, and Santosh Vempala · 2021
Later among the works it cites.
Private non-smooth erm and sco in subquadratic steps
Janardhan Kulkarni, Yin Tat Lee, and Daogao Liu · 2021
Later among the works it cites.
A proximal algorithm for sampling from non-smooth potentials
Jiaming Liang and Yongxin Chen · 2021
Later among the works it cites.
Curse of dimensionality in unconstrained private convex erm
Daogao Liu and Zhou Lu · 2021
Later among the works it cites.
Structured logconcave sampling with a restricted gaussian oracle
Yin Tat Lee, Ruoqi Shen, and Kevin Tian · 2021
Later among the works it cites.
Differentially private coordinate descent for composite empirical risk minimization
Paul Mangold, Aurélien Bellet, Joseph Salmon, and Marc Tommasi · 2021
Later among the works it cites.
High-order langevin diffusion yields an accelerated mcmc algorithm
Wenlong Mou, Yi-An Ma, Martin J Wainwright, Peter L Bartlett, and Michael I Jordan · 2021
Later among the works it cites.
Oren Mangoubi and Nisheeth K Vishnoi · 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.
Langevin diffusion: An almost universal algorithm for private euclidean (convex) optimization
Arun Ganesh, Abhradeep Thakurta, and Jalaj Upadhyay · 2022
Closest in time.