PCE-FedAvg：面向异构约束个性化联邦学习的局部惩罚交叉估计方法

View PDF HTML (experimental)

Abstract:Federated learning (FL) is a communication-efficient framework for solving distributed optimization problems. Standard FL methods aggregate local updates into a single global model that is shared by all agents, effectively imposing consensus. Under heterogeneous local constraints, however, a common feasible model may be overly restrictive or may not exist. Existing constrained FL methods largely retain this shared-model structure and therefore do not directly address personalization under heterogeneous agent-specific feasible sets. We study a constrained personalized FL problem that assigns a distinct feasible model to each agent while coupling the models through a collaborative objective. We propose Locally Penalized Cross-Estimate Federated Averaging (PCE-FedAvg), where each agent maintains a multi-block vector containing its own model and estimates of the other agents' models while applying the feasibility penalty only locally to its own block. The server aggregates corresponding blocks separately, thereby preserving personalization without requiring agents to explicitly disclose their local constraint sets. For any $\epsilon>0$, we establish finite-time upper and lower suboptimality bounds and agent-wise squared infeasibility bounds, yielding communication complexities of $\mathcal{O}(\epsilon^{-2})$ and $\mathcal{O}(\epsilon^{-1})$, respectively. Experiments on MNIST and CIFAR-10 support our theoretical results.

Subjects:	Machine Learning (cs.LG); Optimization and Control (math.OC)
Cite as:	arXiv:2603.19617 [cs.LG]
	(or arXiv:2603.19617v2 [cs.LG] for this version)
	https://doi.org/10.48550/arXiv.2603.19617 arXiv-issued DOI via DataCite

Submission history

From: Mohammadjavad Ebrahimi [view email]
[v1] Fri, 20 Mar 2026 03:49:28 UTC (221 KB)
[v2] Fri, 2 Oct 2026 06:17:46 UTC (481 KB)