跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2606.11480 · v2

FedRAN: Accurate and Efficient Analytic Federated Continual Learning

首次提交 2026-06-10 06:14
版本更新 2026-11-18 06:39
雷达观测 2026-11-19 19:08
arXiv ↗PDF ↗

摘要

Federated continual learning (FCL) enables distributed clients to learn from evolving data streams while retaining knowledge from previously observed tasks. Existing optimization-based FCL methods often rely on repeated local training, incurring communication overhead and feature drift across clients. Analytic alternatives avoid iterative training, but high-dimensional random features used to improve accuracy require communicating a Gram matrix whose cost grows quadratically with feature dimension. Communication-efficient alternatives reduce this cost by statistically reconstructing the Gram matrix from first-order summaries. We propose FedRAN, a low-rank analytic FCL framework that instead compresses the required second-order structure directly through spectral summaries that are merged across clients and tasks. The retained rank explicitly controls the tradeoff between approximation fidelity and communication, reducing second-order communication from quadratic to linear in feature dimension for a fixed rank. FedRAN further supports label scarcity through prototype-based pseudo-labeling. Across CIFAR-100, ImageNet-R, and VTAB, FedRAN improves average accuracy by up to 4.8 percentage points over the strongest baseline, uses 30.6-121.8x less per-client communication, and is 190.3x faster than optimization-based baselines.

作者备注:Accepted at WACV 2027

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-18 06:39 · 最新观测版本

FedRAN: Accurate and Efficient Analytic Federated Continual Learning

Federated continual learning (FCL) enables distributed clients to learn from evolving data streams while retaining knowledge from previously observed tasks. Existing optimization-based FCL methods often rely on repeated local training, incurring communication overhead and feature drift across clients. Analytic alternatives avoid iterative training, but high-dimensional random features used to improve accuracy require communicating a Gram matrix whose cost grows quadratically with feature dimension. Communication-efficient alternatives reduce this cost by statistically reconstructing the Gram matrix from first-order summaries. We propose FedRAN, a low-rank analytic FCL framework that instead compresses the required second-order structure directly through spectral summaries that are merged across clients and tasks. The retained rank explicitly controls the tradeoff between approximation fidelity and communication, reducing second-order communication from quadratic to linear in feature dimension for a fixed rank. FedRAN further supports label scarcity through prototype-based pseudo-labeling. Across CIFAR-100, ImageNet-R, and VTAB, FedRAN improves average accuracy by up to 4.8 percentage points over the strongest baseline, uses 30.6-121.8x less per-client communication, and is 190.3x faster than optimization-based baselines.

查看此版本解读 →查看此版本原文 ↗