Pairwise Learning with Differential Privacy Guarantees
Mengdi Huai, Di Wang, Chenglin Miao, Jinhui Xu, Aidong Zhang
Abstract
Pairwise learning has received much attention recently as it is more capable of modeling the relative relationship between pairs of samples. Many machine learning tasks can be categorized as pairwise learning, such as AUC maximization and metric learning. Existing techniques for pairwise learning all fail to take into consideration a critical issue in their design, i.e., the protection of sensitive information in the training set. Models learned by such algorithms can implicitly memorize the details of sensitive information, which offers opportunity for malicious parties to infer it from the learned models. To address this challenging issue, in this paper, we propose several differentially private pairwise learning algorithms for both online and offline settings. Specifically, for the online setting, we first introduce a differentially private algorithm (called OnPairStrC) for strongly convex loss functions. Then, we extend this algorithm to general convex loss functions and give another differentially private algorithm (called OnPairC). For the offline setting, we also present two differentially private algorithms (called OffPairStrC and OffPairC) for strongly and general convex loss functions, respectively. These proposed algorithms can not only learn the model effectively from the data but also provide strong privacy protection guarantee for sensitive information in the training set. Extensive experiments on real-world datasets are conducted to evaluate the proposed algorithms and the experimental results support our theoretical analysis.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 7c57f850-6690-4c2f-a7c8-6f63d44e45f5Cited by top-tier papers6
- Generalization Guarantee of SGD for Pairwise LearningYunwen Lei, Mingrui Liu, Yiming YingNeurIPS 2021 · 37 citations
- Simple Stochastic and Online Gradient Descent Algorithms for Pairwise LearningZhenhuan Yang, Yunwen Lei, Puyu Wang, Tianbao Yang et al.NeurIPS 2021 · 32 citations
- Data Poisoning Attacks against Conformal PredictionYangyi Li, Aobo Chen, Wei Qian, Chenxu Zhao et al.ICML 2024 · 10 citations
- Improved Rates of Differentially Private Nonconvex-Strongly-Concave Minimax OptimizationRuijia Zhang, Mingxi Lei, Meng Ding, Zihang Xiang et al.AAAI 2025 · 7 citations
- Differentially private optimization for non-decomposable objective functionsWeiwei Kong, Andrés Muñoz Medina, Mónica RiberoICLR 2025
Builds on1
Related papers
- Sharper Generalization Bounds for Pairwise LearningYunwen Lei, Antoine Ledent, Marius KloftNeurIPS 2020 · 50 citations
- Stability-based Generalization Analysis of Randomized Coordinate Descent for Pairwise LearningLiang Wu, Ruixi Hu, Yunwen LeiAAAI 2025
- Task-level Differentially Private Meta LearningXinyu Zhou, Raef BassilyNeurIPS 2022 · 11 citations
- Limited Memory Online Gradient Descent for Kernelized Pairwise Learning with Dynamic AveragingHilal AlQuabeh, William de Vazelhes, Bin GuAAAI 2024 · 1 citation
- Stability-Based Generalization Analysis for Mixtures of Pointwise and Pairwise LearningJiahuan Wang, Jun Chen, Hong Chen, Bin Gu et al.AAAI 2023 · 2 citations
