跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1171新增论文
+938其中 AI 相关
+130已有论文修订
+94新增 AI 导读

arXiv 最近完成扫描:2026-11-19 06:59 · 全站最近入库:2026-11-19 17:46各信源进度 →

统计口径与数据新鲜度

统计 2026-11-18 18:56 — 2026-11-19 18:56(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-19 06:59最近发现新增版本:2026-11-19 17:46库内论文最新更新时间:2026-11-19 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

27,410 已收录论文22,788 AI 相关8,343 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-19 06:57(北京时间)
版本更新 · v2arXiv:2611.05546

FedSharp: Byzantine Robust Decentralized Federated Learning Under Noisy Channel

Ojaswi Sinha, Amin Farajzadeh, Animesh Yadav, Melike Erol-Kantarci

原文摘要

Decentralized federated learning (DFL) eliminates the central aggregation server but remains vulnerable to non-independent and identically distributed (non-IID) data, Byzantine attacks, and channel noise. We show that channel noise accumulates as models propagate across nodes and becomes increasingly significant as the learning rate decays. Moreover, accumulated noise enables Byzantine attackers to exploit loss-based model selection by mimicking the average of the honest models. To address these challenges, we propose FedSharp (screened, hop-aware, averaged, ranked, proximal), a robust DFL framework. In FedSharp, each node keeps the latest models received from its 2b predecessors, which guarantees at least b honest candidates when at most b nodes are Byzantine. FedSharp screens suspicious models using their deviations from the coordinate-wise median, averages the b lowest-loss candidates to reduce the fresh channel-noise variance by a factor of b, and applies hop-aware gradient-norm regularization and proximal training to mitigate accumulated noise and non-IID drift. Experiments on a 100-node ring with 33 Byzantine nodes show that FedSharp achieves 93.5 to 94.9 percent accuracy on MNIST, compared with 29.4 to 38.1 percent for a state-of-the-art single-model-selection benchmark, and 32.8 to 48.8 percent on CIFAR-10, compared with 10.0 to 30.5 percent, across Gaussian and hidden attacks under IID and non-IID data. On MNIST, FedSharp comes within 1.3 percentage points of the benchmark operating without channel noise, and exceeds it under the hidden attack.

cs.LG