Federated Learning (FL) is a distributed machine learning technique that allows model training among multiple devices or organizations by sharing training parameters instead of raw data. However, adversaries can still infer individual information through inference attacks (e.g. differential attacks) on these training parameters. As a result, Differential Privacy (DP) has been widely used in FL to prevent such attacks. We consider differentially private federated learning in a resource-constrained scenario, where both privacy budget and communication rounds are constrained. By theoretically analyzing the convergence, we can find the optimal number of local DPSGD iterations for clients between any two sequential global updates. Based on this, we design an algorithm of Differentially Private Federated Learning with Adaptive Local Iterations (ALI-DPFL). We experiment our algorithm on the MNIST, FashionMNIST and Cifar10 datasets, and demonstrate significantly better performances than previous work in the resource-constraint scenario. Code is available at https://anonymous.4open.science/r/ALI-DPFL-5347.

翻译：联邦学习（FL）是一种分布式机器学习技术，允许在多个设备或组织间通过共享训练参数而非原始数据来进行模型训练。然而，攻击者仍可能通过针对这些训练参数的推理攻击（如差分攻击）推断个体信息。为此，差分隐私（DP）被广泛用于联邦学习以抵御此类攻击。我们考虑在资源受限场景下进行差分隐私联邦学习，其中隐私预算和通信轮数均受约束。通过理论收敛性分析，我们找到了两个连续全局更新之间客户端执行本地差分隐私随机梯度下降（DPSGD）迭代的最优次数。基于此，我们设计了自适应本地迭代的差分隐私联邦学习算法（ALI-DPFL）。我们在MNIST、FashionMNIST和Cifar10数据集上验证了该算法，并证明在资源受限场景下其性能显著优于此前工作。代码已开源：https://anonymous.4open.science/r/ALI-DPFL-5347。