Differentially Private Empirical Risk Minimization: Efficient Algorithms and Tight Error Bounds
暂无分享,去创建一个
Raef Bassily | Adam D. Smith | Abhradeep Thakurta | Raef Bassily | Adam D. Smith | Abhradeep Thakurta
[1] J. Czipszer,et al. Extension of functions satisfying a Lipschitz condition , 1955 .
[2] S. Cobzas,et al. Norm-preserving extension of convex Lipschitz functions , 1978 .
[3] John Darzentas,et al. Problem Complexity and Method Efficiency in Optimization , 1983 .
[4] David Applegate,et al. Sampling and integration of near log-concave functions , 1991, STOC '91.
[5] Y. Peres,et al. Evolving sets, mixing and heat kernel bounds , 2003, math/0305349.
[6] Irit Dinur,et al. Revealing information while preserving privacy , 2003, PODS.
[7] Santosh S. Vempala,et al. Simulated annealing in convex bodies and an O*(n/sup 4/) volume algorithm , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[8] Cynthia Dwork,et al. Privacy-Preserving Datamining on Vertically Partitioned Databases , 2004, CRYPTO.
[9] Adam Tauman Kalai,et al. Online convex optimization in the bandit setting: gradient descent without a gradient , 2004, SODA '05.
[10] Cynthia Dwork,et al. Practical privacy: the SuLQ framework , 2005, PODS.
[11] Moni Naor,et al. Our Data, Ourselves: Privacy Via Distributed Noise Generation , 2006, EUROCRYPT.
[12] Santosh S. Vempala,et al. Simulated annealing in convex bodies and an O*(n4) volume algorithm , 2006, J. Comput. Syst. Sci..
[13] Cynthia Dwork,et al. Differential Privacy , 2006, ICALP.
[14] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[15] Cynthia Dwork,et al. Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.
[16] Santosh S. Vempala,et al. The geometry of logconcave functions and sampling algorithms , 2007, Random Struct. Algorithms.
[17] Daniel A. Spielman,et al. Spectral Graph Theory and its Applications , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[18] Kunal Talwar,et al. Mechanism Design via Differential Privacy , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[19] Adam D. Smith,et al. A Note on Differential Privacy: Defining Resistance to Arbitrary Side Information , 2008, IACR Cryptol. ePrint Arch..
[20] Sofya Raskhodnikova,et al. What Can We Learn Privately? , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[21] Kamalika Chaudhuri,et al. Privacy-preserving logistic regression , 2008, NIPS.
[22] Nathan Srebro,et al. Fast Rates for Regularized Objectives , 2008, NIPS.
[23] Ohad Shamir,et al. Stochastic Convex Optimization , 2009, COLT.
[24] Kunal Talwar,et al. On the geometry of differential privacy , 2009, STOC '10.
[25] Guy N. Rothblum,et al. A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[26] Frank McSherry,et al. Probabilistic Inference and Differential Privacy , 2010, NIPS.
[27] Guy N. Rothblum,et al. Boosting and Differential Privacy , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[28] Kamalika Chaudhuri,et al. Sample Complexity Bounds for Differentially Private Learning , 2011, COLT.
[29] Anand D. Sarwate,et al. Differentially Private Empirical Risk Minimization , 2009, J. Mach. Learn. Res..
[30] Ling Huang,et al. Learning in a Large Function Space: Privacy-Preserving Mechanisms for SVM Learning , 2009, J. Priv. Confidentiality.
[31] Anindya De,et al. Lower Bounds in Differential Privacy , 2011, TCC.
[32] Ashwin Machanavajjhala,et al. A rigorous and customizable framework for privacy , 2012, PODS.
[33] Daniel Kifer,et al. Private Convex Empirical Risk Minimization and High-dimensional Regression , 2012, COLT 2012.
[34] Pravesh Kothari,et al. 25th Annual Conference on Learning Theory Differentially Private Online Learning , 2022 .
[35] Martin J. Wainwright,et al. Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization , 2010, IEEE Transactions on Information Theory.
[36] Ohad Shamir,et al. Stochastic Gradient Descent for Non-smooth Optimization: Convergence Results and Optimal Averaging Schemes , 2012, ICML.
[37] Martin J. Wainwright,et al. Local privacy and statistical minimax rates , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[38] Amos Beimel,et al. Private Learning and Sanitization: Pure vs. Approximate Differential Privacy , 2013, APPROX-RANDOM.
[39] Adam D. Smith,et al. (Nearly) Optimal Algorithms for Private Online Learning in Full-information and Bandit Settings , 2013, NIPS.
[40] Anand D. Sarwate,et al. A near-optimal algorithm for differentially-private principal components , 2012, J. Mach. Learn. Res..
[41] Amos Beimel,et al. Characterizing the sample complexity of private learners , 2013, ITCS '13.
[42] Amos Beimel,et al. Bounds on the sample complexity for private learning and private data release , 2010, Machine Learning.
[43] Adam D. Smith,et al. The Power of Linear Reconstruction Attacks , 2012, SODA.
[44] Kunal Talwar,et al. On differentially private low rank approximation , 2013, SODA.
[45] Aleksandar Nikolov,et al. The geometry of differential privacy: the sparse and approximate cases , 2012, STOC '13.
[46] Adam D. Smith,et al. Differentially Private Feature Selection via Stability Arguments, and the Robustness of the Lasso , 2013, COLT.
[47] Prateek Jain,et al. Differentially Private Learning with Kernels , 2013, ICML.
[48] Anand D. Sarwate,et al. Stochastic gradient descent with differentially private updates , 2013, 2013 IEEE Global Conference on Signal and Information Processing.
[49] Prateek Jain,et al. (Near) Dimension Independent Risk Bounds for Differentially Private Learning , 2014, ICML.