首页|期刊导航|山东理工大学学报(自然科学版)|考虑隐私保护的在线单点反馈无投影去中心化联邦学习算法

考虑隐私保护的在线单点反馈无投影去中心化联邦学习算法OA

Privacy-preserving online bandit projection-free decentralized federated learning algorithm

中文摘要英文摘要

研究一类考虑客户端隐私保护的去中心化联邦学习算法,目标是保护各客户端隐私信息不被暴露,且保证模型收敛至全局最优解.提出一种基于差分隐私的Frank-Wolfe无投影去中心化联邦学习算法,结合在线单点反馈技术,避免了高维约束集下的复杂投影计算,并通过函数值近似梯度,解决了梯度信息不可访问的问题.在无中心服务器的场景下,算法可实现客户端隐私保护,同时理论分析表明算法可收敛至全局最优解.最后,通过数据集仿真实验验证了算法的有效性.

This study investigates a decentralized federated learning(DFL)algorithm that considers client privacy protection,with the objective of safeguarding private information of each client from expo-sure while ensuring the model converges to the global optimal solution.First,a Frank-Wolfe projection-free decentralized federated learning algorithm based on differential privacy is proposed for the iterative process.The algorithm is integrated with online single-point feedback technology to avoid complex projec-tion calculations under high-dimensional constraint sets,and solves the problem of inaccessible gradient information by approximating gradients with function values.In scenarios without a centralized server,the algorithm achieves client privacy protection.Theoretical analysis demonstrates that the algorithm can con-verge to the global optimal solution.Finally,the effectiveness of the algorithm is verified through simula-tion experiments on a dataset.

王燕;邓志良;赵中原

南京信息工程大学 自动化学院,江苏 南京 210044南京信息工程大学 自动化学院,江苏 南京 210044南京信息工程大学 自动化学院,江苏 南京 210044

信息技术与安全科学

去中心化联邦学习Frank-Wolfe差分隐私单点反馈

decentralized federated learningFrank-Wolfedifferential privacyone-point bandit feed-back

《山东理工大学学报(自然科学版)》 2026 (3)

50-58,9

国家自然科学基金项目(U23B2061)

评论