论文标题
垂直联合学习的理想伴侣:新的零阶梯度算法
Desirable Companion for Vertical Federated Learning: New Zeroth-Order Gradient Based Algorithm
论文作者
论文摘要
垂直联合学习(VFL)由于多方协作建模和隐私泄漏的关注而引起的越来越多的关注。评估VFL算法的指标列表应包括模型适用性,隐私安全性,通信成本和计算效率,而隐私安全对VFL尤为重要。但是,据我们所知,没有很好地满足所有这些标准的VFL算法。为了解决这个具有挑战性的问题,在本文中,我们揭示了零订单优化(ZOO)是VFL的理想伴侣。具体而言,动物园可以1)提高VFL框架的模型适用性,2)防止在好奇,勾结和恶意威胁模型下,VFL框架泄漏的VFL框架,3)支持便宜的通信和有效的计算。基于此,我们提出了一个具有黑盒模型的新颖而实用的VFL框架,该框架与动物园的有前途的特性密不可分。我们认为,在设计一个符合所有标准的实用VFL框架方面需要大步向前。在这个框架下,我们为{\ bf v}精细的f {\ bf v} oth-eartical f {\ bf v} deratiques derated {\ bf v} derated {\ bf e} derated {\ bf l} eran(\ bf l} er(as as as as as as as asyere veliques for Secameique)撰写了两本小说{\ bf asy} nChronous ze {\ bf r} oth-ord {\ bf e} r算法。从理论上讲,我们在非凸条件下驱动Asyrevel算法的收敛速率。更重要的是,我们在现有的VFL攻击下在不同级别上证明了我们提出的框架的隐私安全。基准数据集上的广泛实验证明了良好的模型适用性,满意的隐私安全性,廉价的通信,有效的计算,可扩展性和我们框架的无损性。
Vertical federated learning (VFL) attracts increasing attention due to the emerging demands of multi-party collaborative modeling and concerns of privacy leakage. A complete list of metrics to evaluate VFL algorithms should include model applicability, privacy security, communication cost, and computation efficiency, where privacy security is especially important to VFL. However, to the best of our knowledge, there does not exist a VFL algorithm satisfying all these criteria very well. To address this challenging problem, in this paper, we reveal that zeroth-order optimization (ZOO) is a desirable companion for VFL. Specifically, ZOO can 1) improve the model applicability of VFL framework, 2) prevent VFL framework from privacy leakage under curious, colluding, and malicious threat models, 3) support inexpensive communication and efficient computation. Based on that, we propose a novel and practical VFL framework with black-box models, which is inseparably interconnected to the promising properties of ZOO. We believe that it takes one stride towards designing a practical VFL framework matching all the criteria. Under this framework, we raise two novel {\bf asy}nchronous ze{\bf r}oth-ord{\bf e}r algorithms for {\bf v}ertical f{\bf e}derated {\bf l}earning (AsyREVEL) with different smoothing techniques. We theoretically drive the convergence rates of AsyREVEL algorithms under nonconvex condition. More importantly, we prove the privacy security of our proposed framework under existing VFL attacks on different levels. Extensive experiments on benchmark datasets demonstrate the favorable model applicability, satisfied privacy security, inexpensive communication, efficient computation, scalability and losslessness of our framework.