支持向量机
差别隐私
计算机科学
边距(机器学习)
机器学习
构造(python库)
人工智能
数据挖掘
二元分类
信息隐私
二进制数
样品(材料)
结构化支持向量机
趋同(经济学)
最大化
排序支持向量机
差速器(机械装置)
稳健性(进化)
实证研究
保护
灵敏度(控制系统)
二进制数据
隐私保护
数据建模
私人信息检索
作者
J.-G. Park,Yujin Choi,Jaewook Lee
标识
DOI:10.48550/arxiv.2510.04027
摘要
With the increasing need to safeguard data privacy in machine learning models, differential privacy (DP) is one of the major frameworks to build privacy-preserving models. Support Vector Machines (SVMs) are widely used traditional machine learning models due to their robust margin guarantees and strong empirical performance in binary classification. However, applying DP to multi-class SVMs is inadequate, as the standard one-versus-rest (OvR) and one-versus-one (OvO) approaches repeatedly query each data sample when building multiple binary classifiers, thus consuming the privacy budget proportionally to the number of classes. To overcome this limitation, we explore all-in-one SVM approaches for DP, which access each data sample only once to construct multi-class SVM boundaries with margin maximization properties. We propose a novel differentially Private Multi-class SVM (PMSVM) with weight and gradient perturbation methods, providing rigorous sensitivity and convergence analyses to ensure DP in all-in-one SVMs. Empirical results demonstrate that our approach surpasses existing DP-SVM methods in multi-class scenarios.
科研通智能强力驱动
Strongly Powered by AbleSci AI