Score Attack: A Lower Bound Technique for Optimal Differentially Private
Learning

Score Attack: A Lower Bound Technique for Optimal Differentially Private Learning

13 March 2023

T. Tony Cai

Papers citing "Score Attack: A Lower Bound Technique for Optimal Differentially Private Learning"

11 / 11 papers shown

Title
Differentially Private Sliced Inverse Regression: Minimax Optimality and Algorithm Xintao Xia Linjun Zhang Zhanrui Cai 47 0 0 16 Jan 2024
Ranking Differential Privacy Shi Xu W. Sun Guang Cheng 64 1 0 02 Jan 2023
Distributed Differentially Private Ranking Aggregation Baobao Song Qiujun Lan Yang Li Gang Li FedML 31 3 0 07 Feb 2022
Differentially Private Assouad, Fano, and Le Cam Jayadev Acharya Ziteng Sun Huanyu Zhang FedML 52 58 0 14 Apr 2020
Private Mean Estimation of Heavy-Tailed Distributions Gautam Kamath Vikrant Singhal Jonathan R. Ullman 57 99 0 21 Feb 2020
Tight Lower Bounds for Differentially Private Selection Thomas Steinke Jonathan R. Ullman 70 73 0 10 Apr 2017
Membership Inference Attacks against Machine Learning Models Reza Shokri M. Stronati Congzheng Song Vitaly Shmatikov SLR MIALM MIACV 221 4,075 0 18 Oct 2016
Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence Nihar B. Shah Sivaraman Balakrishnan Joseph K. Bradley Abhay K. Parekh Kannan Ramchandran Martin J. Wainwright 126 164 0 06 May 2015
Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima Po-Ling Loh Martin J. Wainwright 216 516 0 10 May 2013
Rank Centrality: Ranking from Pair-wise Comparisons S. Negahban Sewoong Oh Devavrat Shah 86 223 0 08 Sep 2012
A Unified Framework for High-Dimensional Analysis of M-Estimators with Decomposable Regularizers S. Negahban Pradeep Ravikumar Martin J. Wainwright Bin Yu 312 1,377 0 13 Oct 2010

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.