arXiv:2503.15210stat.MLcs.LG2025-03

提出在线联邦学习框架,高效处理多客户端流数据分类。

Online federated learning framework for classification

  • 基于极大化极小原理设计优化算法,支持模型增量更新
  • 理论证明估计器一致且渐近正态,实现贝叶斯风险一致性
  • 融合差分隐私,兼顾隐私保护与分类性能,适合实时场景

本文提出一种新型在线联邦学习框架用于分类任务,能够处理来自多个客户端的流式数据,同时保障数据隐私和计算效率。方法采用广义距离加权判别技术,对客户端间同质与异质数据分布均具鲁棒性。我们设计了一种基于极大化极小原理的新优化算法,并结合可更新的估计机制,实现无需全量重训练的高效模型更新。理论上证明了估计器的一致性和渐近正态性,在标准正则条件下成立。进一步证明该方法具备贝叶斯风险一致性,确保在联邦环境下的分类可靠性。此外,集成差分隐私机制,在保护客户端信息的同时维持模型性能。在模拟和真实数据集上的大量实验表明,相比现有方法,本方案在分类准确率、计算效率和存储节省方面均有显著优势。

原文摘要 · Abstract (English)

In this paper, we develop a novel online federated learning framework for classification, designed to handle streaming data from multiple clients while ensuring data privacy and computational efficiency. Our method leverages the generalized distance-weighted discriminant technique, making it robust to both homogeneous and heterogeneous data distributions across clients. In particular, we develop a new optimization algorithm based on the Majorization-Minimization principle, integrated with a renewable estimation procedure, enabling efficient model updates without full retraining. We provide a theoretical guarantee for the convergence of our estimator, proving its consistency and asymptotic normality under standard regularity conditions. In addition, we establish that our method achieves Bayesian risk consistency, ensuring its reliability for classification tasks in federated environments. We further incorporate differential privacy mechanisms to enhance data security, protecting client information while maintaining model performance. Extensive numerical experiments on both simulated and real-world datasets demonstrate that our approach delivers high classification accuracy, significant computational efficiency gains, and substantial savings in data storage requirements compared to existing methods.

联邦学习在线学习隐私保护分类

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。