TY - JOUR
T1 - Differentially private empirical risk minimization for AUC maximization
AU - Wang, Puyu
AU - Yang, Zhenhuan
AU - Lei, Yunwen
AU - Ying, Yiming
AU - Zhang, Hai
N1 - Funding Information:
This work was done while Puyu Wang was a visiting student at SUNY Albany. The corresponding author is Yiming Ying, whose work is supported by NSF IIS-1816227 and IIS-2103450. The work of Hai Zhang is supported by NSFC U1811461 and the Open Research Fund of Key Laboratory of Advanced Theory and Application in Statistics and Data Science (East China Normal University), Ministry of Education.
Publisher Copyright:
© 2021 Elsevier B.V.
PY - 2021/10/21
Y1 - 2021/10/21
N2 - Area under the ROC curve (AUC) is a widely used performance measure for imbalanced classification. Oftentimes, the ubiquitous imbalanced data such as financial records from fraud detection or genomic data from cancer diagnosis contains sensitive information, and therefore it is of practical and theoretical importance to develop privacy-preserving AUC maximization algorithms. In this paper, we propose differentially private empirical risk minimization (ERM) for AUC maximization, and systematically study their privacy and utility guarantees. In particular, we establish guarantees on the generalization (utility) performance of the proposed algorithms with fast rates. The technical novelty contains fast rates for the regularized ERM in AUC maximization, which is established using the peeling techniques for Rademacher averages [1] and properties of U-Statistics [2,3] to handle statistically non-independent pairs of examples in the objective function, and a new error decomposition to handle strongly smooth losses (e.g. least square loss). In addition, we revisit the private ERM with pointwise loss [4,5] and show optimal rates can be obtained using the uniform convergence approach.
AB - Area under the ROC curve (AUC) is a widely used performance measure for imbalanced classification. Oftentimes, the ubiquitous imbalanced data such as financial records from fraud detection or genomic data from cancer diagnosis contains sensitive information, and therefore it is of practical and theoretical importance to develop privacy-preserving AUC maximization algorithms. In this paper, we propose differentially private empirical risk minimization (ERM) for AUC maximization, and systematically study their privacy and utility guarantees. In particular, we establish guarantees on the generalization (utility) performance of the proposed algorithms with fast rates. The technical novelty contains fast rates for the regularized ERM in AUC maximization, which is established using the peeling techniques for Rademacher averages [1] and properties of U-Statistics [2,3] to handle statistically non-independent pairs of examples in the objective function, and a new error decomposition to handle strongly smooth losses (e.g. least square loss). In addition, we revisit the private ERM with pointwise loss [4,5] and show optimal rates can be obtained using the uniform convergence approach.
KW - AUC maximization
KW - Differential privacy
KW - Empirical risk minimization
KW - Imbalanced classification
UR - http://www.scopus.com/inward/record.url?scp=85111973022&partnerID=8YFLogxK
U2 - 10.1016/j.neucom.2021.07.001
DO - 10.1016/j.neucom.2021.07.001
M3 - Journal article
AN - SCOPUS:85111973022
SN - 0925-2312
VL - 461
SP - 419
EP - 437
JO - Neurocomputing
JF - Neurocomputing
ER -