跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.24057 · v1

Faster to the Wrong Answer: The Price of Local Updates in Federated Optimization

首次提交 2026-11-18 16:49
版本更新 2026-11-18 16:49
雷达观测 2026-11-19 19:07
arXiv ↗PDF ↗

摘要

Local computation can improve the conditioning of federated updates but may also introduce bias, causing their fixed point to differ from the global minimizer. We characterize the minimum worst-case bias achievable under a prescribed conditioning bound. We consider strongly convex quadratic client objectives with Hessian eigenvalues in [μ,L][μ,L] and local updates represented by a shared positive spectral filter. Client heterogeneity is measured by the root-mean-square gradient at the global minimizer. For a uniform surrogate condition number bounded by χ∈[1,L/μ]χ\in[1,L/μ], we establish the exact worst-case bias per unit heterogeneity, (L−μχ)/(2μLχ)(L-μχ)/(2μL\sqrtχ), and show that local gradient descent with sufficiently small step sizes and proximal updates attain this bound. Our analysis reduces populations of arbitrary dimension, including noncommuting Hessians, to distributions over scalar curvatures. This reduction provides optimality certificates and worst-case constructions involving at most three scalar clients. We further extend the sharp proximal bias bound to smooth strongly convex objectives beyond quadratics and quantify the error introduced by inexact local solves.

作者备注:18 pages, 1 figure; includes supplementary proofs and reproduction code

AI 论文解读

基于摘要 · 非全文审阅

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

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

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

v1 · 2026-11-18 16:49 · 最新观测版本

Faster to the Wrong Answer: The Price of Local Updates in Federated Optimization

Local computation can improve the conditioning of federated updates but may also introduce bias, causing their fixed point to differ from the global minimizer. We characterize the minimum worst-case bias achievable under a prescribed conditioning bound. We consider strongly convex quadratic client objectives with Hessian eigenvalues in [μ,L][μ,L] and local updates represented by a shared positive spectral filter. Client heterogeneity is measured by the root-mean-square gradient at the global minimizer. For a uniform surrogate condition number bounded by χ∈[1,L/μ]χ\in[1,L/μ], we establish the exact worst-case bias per unit heterogeneity, (L−μχ)/(2μLχ)(L-μχ)/(2μL\sqrtχ), and show that local gradient descent with sufficiently small step sizes and proximal updates attain this bound. Our analysis reduces populations of arbitrary dimension, including noncommuting Hessians, to distributions over scalar curvatures. This reduction provides optimality certificates and worst-case constructions involving at most three scalar clients. We further extend the sharp proximal bias bound to smooth strongly convex objectives beyond quadratics and quantify the error introduced by inexact local solves.

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