跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+1958新增论文
+1549其中 AI 相关
+212已有论文修订
+95新增 AI 导读

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

统计口径与数据新鲜度

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

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

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

25,785 已收录论文21,490 AI 相关7,724 有修订112 HF 社区发现

浏览论文库

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

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-17 19:14(北京时间)
首次观测 · 记录 #1CVF · CVPR 2026:cvf:bc00d8850bbc884ff73c61cc441de6aeCVF · CVPR 2026

OS-Fed: One Snapshot Is All You Need

Qian, Xuwei, Zhang, Jinghui, Tan, Yuchuan, Huang, Wenbo, Wu, Zhen, Zhou, Shen, Gao, LiSha, Ding, Ding 等 9 位作者

原文摘要

Reducing communication overhead in federated learning (FL) is challenging but crucial for large-scale distributed privacy-preserving machine learning. Unfortunately, directly compressing model updates often leads to sub-optimal convergence due to information loss, while increasing local computation can cause model divergence. Hence, this paper proposes a drastically different approach that adheres to the maxim that "a picture is worth a thousand words". We observe that the entire gradient information from local training can be effectively reconstructed from a compact, image-like representation. Based on this observation, we propose a novel approach, OS-Fed, which performs One-Shot Federated Learning by transmitting only a single, compact snapshot (comprising an image and a set of learnable labels) per round. To realize this approach, OS-Fed presents new snapshot synthesis techniques to (1) target the accumulated update of a trajectory segment to tackle gradient noise, (2) design a multi-grid snapshot that decouples conflicting gradient directions, and (3) incorporate error compensation to maintain training stability under extreme compression. Extensive experiments on CV and NLP benchmarks show that OS-Fed reduces communication costs by 1.5-16xcompared to state-of-the-art algorithms , resulting in 18-45% faster convergence.

cs.CV

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition · 2026 · 正式发表