Personalized Federated Learning via Variance-Aware Nonparametric Empirical Bayes

TL;DR

Proposes VANEB framework, integrating heteroskedastic parameter-dependent EB for personalized federated learning, achieving superior performance on MNIST and CIFAR-10.

stat.ML 🔴 Advanced 2026-08-10 84 views
Jae Ho Chang Arnab Auddy Subhadeep Paul
Federated Learning Empirical Bayes Nonparametric Maximum Likelihood Heteroskedastic Variance Deep Neural Networks

Key Findings

Methodology

This paper introduces a Variance-Aware Nonparametric Empirical Bayes (VANEB) framework that leverages the asymptotic normality of local M-estimators, modeling their estimates as noisy observations with parameter-dependent heteroskedastic variances. The core innovation lies in deriving a generalized Tweedie formula that accounts for heteroskedasticity, enabling adaptive shrinkage of client-specific estimates. The approach involves constructing a likelihood function incorporating the parameter-dependent covariance matrices, then applying a pseudo-EM algorithm that alternates between fixing the covariance structure to optimize the support points of the prior and updating the covariance estimates based on the current support. The prior distribution is learned nonparametrically via maximum likelihood, which guides the posterior mean estimation for each client. The framework is extended to deep neural network settings, where the last fully connected layer is personalized via an NPEB step, utilizing an approximate diagonal variance estimator. Theoretical guarantees include non-asymptotic density estimation error bounds and oracle inequalities, ensuring the method's robustness and optimality in large-sample regimes.

Key Results

  • Empirical evaluation on MNIST and CIFAR-10 datasets demonstrates that VANEB-FT outperforms existing federated learning approaches such as FedAvg, FedPer, and SCAFFOLD, achieving accuracy improvements of 3-5 percentage points. Specifically, VANEB-FT reaches 98.2% accuracy on MNIST and 87.5% on CIFAR-10 under heterogeneous label and covariate distributions, surpassing FedAvg’s 94.7% and 83.2%, respectively.
  • The method effectively captures complex prior distributions, including multimodal and skewed structures, leading to enhanced personalization and generalization, especially in low-sample or high-heterogeneity scenarios. The number of support points influences performance, with around 50 points providing a good balance between accuracy and computational cost.
  • Theoretical analysis confirms that the density estimation converges at near-parametric rates, and the oracle denoising inequality bounds the excess mean squared error relative to an ideal posterior mean, providing strong guarantees for practical deployment.

Significance

This work advances the theoretical foundation of empirical Bayes methods in heteroskedastic environments, addressing a critical gap in applying NPEB to federated learning with parameter-dependent variances. By integrating heteroskedasticity into the prior estimation process, VANEB significantly improves personalization accuracy and robustness, facilitating the deployment of adaptive models in privacy-sensitive, heterogeneous data settings. The approach bridges the gap between classical statistical theory and modern deep learning applications, enabling scalable, data-driven prior learning for complex models. Its ability to perform one-shot personalized inference with minimal communication overhead makes it highly suitable for real-world federated systems, including mobile devices, healthcare, and industrial IoT.

Technical Contribution

The main technical contributions include: • Derivation of a generalized Tweedie formula accommodating heteroskedastic, parameter-dependent covariance matrices, providing an explicit correction term for adaptive shrinkage. • Development of a pseudo-EM algorithm that iteratively optimizes the nonparametric prior and updates covariance estimates, with convergence guarantees under mild regularity conditions. • Theoretical establishment of non-asymptotic density estimation bounds in the squared Hellinger distance, and an oracle inequality bounding the excess risk of the VANEB estimator relative to the ideal Bayesian posterior mean. • Extension of the framework to deep neural network models, particularly in the last-layer personalization, demonstrating practical feasibility and superior empirical performance.

Novelty

This research is the first to incorporate parameter-dependent heteroskedastic variances into a nonparametric empirical Bayes framework for federated learning. Unlike prior works assuming fixed, known variances, VANEB models the covariance as a function of the unknown parameters, deriving a generalized Tweedie formula that adaptively accounts for local noise levels. The algorithm employs an alternating pseudo-EM scheme to jointly learn the prior and covariance structure, enabling flexible modeling of complex client heterogeneity. Its application to deep neural networks’ last layer for personalization is novel, providing a scalable, theoretically grounded approach that outperforms existing methods in heterogeneous environments.

Limitations

  • The theoretical analysis relies on the Gaussian approximation of local M-estimators, which may deviate in highly non-linear deep models, potentially impacting the accuracy of the heteroskedastic correction.
  • Current implementation assumes a diagonal covariance structure, which may be insufficient in highly correlated feature spaces; extending to full covariance matrices remains a challenge.
  • Computational complexity increases with the number of support points and clients, necessitating efficient support point selection and approximation strategies for large-scale deployment.
  • Performance may degrade under extreme heterogeneity or very small local sample sizes, requiring further robustness enhancements.

Future Work

Future research will focus on extending VANEB to full covariance models, incorporating more sophisticated covariance estimation techniques, and exploring adaptive support point selection algorithms. Additionally, integrating privacy-preserving mechanisms such as differential privacy and federated averaging with Bayesian updates will be prioritized to ensure data security. Further, applying VANEB to other deep learning components beyond the last layer, such as feature extractors, and testing on larger, real-world federated systems will be key directions to enhance its practical impact.

AI Executive Summary

In the rapidly evolving landscape of machine learning, federated learning (FL) has emerged as a pivotal paradigm, enabling collaborative model training across distributed devices or institutions without compromising data privacy. Since McMahan et al.'s seminal 2017 work on Federated Averaging (FedAvg), researchers have strived to improve optimization efficiency, robustness, and adaptability to data heterogeneity. Despite these advances, a persistent challenge remains: client data often exhibit significant heterogeneity, leading to suboptimal global models that fail to capture individual client nuances.

This heterogeneity problem is especially pronounced in applications like personalized recommendation systems, medical diagnostics, and industrial IoT, where each client’s data distribution can be markedly different. Existing solutions, such as meta-learning, multi-task learning, and representation-based methods, attempt to address this by training separate or partially shared models. However, these approaches often rely on strong assumptions, lack rigorous theoretical guarantees, or require complex optimization routines.

Recognizing these limitations, the authors propose a novel framework rooted in empirical Bayes (EB) principles, termed Variance-Aware Nonparametric Empirical Bayes (VANEB). This approach models each client’s estimated parameters as noisy observations with heteroskedastic variances that depend on the unknown true parameters. The core innovation lies in deriving a generalized Tweedie formula that explicitly incorporates these parameter-dependent variances, enabling adaptive shrinkage of client estimates based on their uncertainty levels.

The methodology involves constructing a likelihood function that accounts for heteroskedasticity, then employing a pseudo-EM algorithm to iteratively estimate the shared prior distribution and the covariance functions. The prior is learned nonparametrically via maximum likelihood, allowing the model to adapt to complex, multimodal distributions without restrictive parametric assumptions. This process results in personalized posterior means that effectively borrow strength across clients while respecting individual heterogeneity.

Empirically, the authors demonstrate the efficacy of VANEB in deep neural network settings, particularly in the last fully connected layer. They introduce two variants, VANEB-head and VANEB-FT, which personalize the classification head by applying the NPEB step with an approximate diagonal variance estimator. Extensive experiments on MNIST and CIFAR-10 datasets show that VANEB-FT consistently outperforms state-of-the-art federated learning methods such as FedAvg, FedPer, and SCAFFOLD, achieving accuracy improvements of 3-5 percentage points across various heterogeneity scenarios.

Theoretically, the paper establishes non-asymptotic density estimation bounds in the squared Hellinger distance and an oracle denoising inequality, providing rigorous guarantees for the estimator’s performance. These results confirm that the proposed method converges at near-parametric rates under moderate to large local sample sizes, making it suitable for real-world large-scale federated systems.

Overall, this work bridges classical statistical theory with modern deep learning, offering a flexible, theoretically grounded, and computationally feasible solution for personalized federated learning in heterogeneous environments. Its ability to incorporate parameter-dependent heteroskedasticity marks a significant step forward, opening avenues for further research in scalable, privacy-preserving, and highly adaptive distributed AI systems.

Deep Analysis

Background

随着数据规模的不断扩大,分布式机器学习逐渐成为研究热点。传统的集中式学习方式面临数据隐私保护和传输瓶颈,促使联邦学习(FL)应运而生。自2017年McMahan等提出FedAvg算法以来,FL在优化效率、通信成本和系统异质性方面取得了显著进展。然而,实际应用中,客户端数据的异质性极大地影响模型性能,导致全局模型难以满足个性化需求。现有方法如元学习、多任务学习和表示学习等,虽能部分缓解问题,但多依赖复杂优化和假设,缺乏强有力的理论保障。近年来,贝叶斯方法逐步引入个性化联邦学习,试图通过层级推断实现个性化,但多依赖参数假设和固定噪声结构,难以应对参数依赖的异方差和多模态分布。本文在此背景下,提出了VANEB框架,结合异方差参数依赖的理论推导和深度学习实践,为异质性和隐私保护提供了新思路。

Core Problem

在联邦学习中,客户端数据的异质性导致模型性能显著下降。尤其在数据分布差异较大时,单一的全局模型难以满足每个客户端的个性化需求。传统方法多假设数据同质或采用简单的模型融合策略,忽略了客户端估计的不确定性和异方差结构。这造成模型偏差大、泛化差,难以在实际场景中应用。此外,现有贝叶斯方法多依赖已知的固定方差,无法应对参数依赖的异方差变化,限制了其在复杂模型中的适用性。如何在保证理论性能的同时,充分利用客户端的统计信息,解决异方差参数依赖带来的挑战,成为当前的核心难题。这不仅关系到模型的准确性,也影响到数据隐私和系统的扩展性。

Innovation

本研究的核心创新包括:• 推导出异方差参数依赖的广义Tweede公式,解决了传统非参数经验贝叶斯(NPEB)在异方差环境下的局限性,为密度估计提供了理论基础;• 设计了支持点与协方差交替优化的伪EM算法,有效应对参数依赖的异方差结构,确保算法收敛;• 将非参数最大似然估计(NPMLE)引入深度神经网络的最后一层,实现个性化调整,提升模型适应性;• 理论上证明了密度估计的非渐近收敛率和oracle去噪不等式,为模型性能提供坚实保障。这些创新使VANEB在复杂、多模态和高维场景中表现出优越性,突破了现有方法的限制。

Methodology

  • �� 以局部M估计器的渐近正态性为基础,建立异方差模型,定义局部参数的渐近分布;
  • �� 构建参数依赖的似然函数,推导广义Tweede公式,表达后验均值的修正项,适应异方差结构;
  • �� 设计伪EM算法:
  • �� E步:固定协方差,优化支持点位置,最大化支持点的非参数最大似然;
  • �� M步:在支持点固定的条件下,更新协方差矩阵,考虑参数依赖的异方差结构;
  • �� 利用非参数最大似然估计(NPMLE)学习先验分布,结合支持点和协方差更新,逐步逼近最优后验估计;
  • �� 将该框架应用到深度神经网络最后一层,通过VANEB-head和VANEB-FT实现个性化,利用近似对角方差估计器进行支持点调整。

Experiments

  • �� 数据集:MNIST和CIFAR-10,涵盖手写数字和自然图像;• 模型:卷积神经网络(CNN),最后一层为全连接层;• 比较方法:FedAvg、FedPer、FedRep、FedBABU、LG-FedAvg、Per-FedAvg、SCAFFOLD、Ditto和本地训练;• 评估指标:准确率、误差、泛化能力,特别关注平衡测试和客户端匹配测试;• 超参数:支持点数、正则化参数、学习率等通过交叉验证确定;• 通过消融实验验证VANEB-FT在不同异质性场景下的优越性,分析支持点数对性能的影响。

Results

  • �� VANEB-FT在MNIST和CIFAR-10上,标签和协变量异质性条件下,准确率分别达98.2%和87.5%,优于FedAvg(94.7%、83.2%)和FedPer(97.1%、85.4%);• 在样本少或异质性强的场景中,误差显著降低,泛化能力增强,尤其在少样本环境中,误差降低超过15%;• 支持点数量的增加带来性能提升,但过多会增加计算成本,本文在支持点为50时达到了良好的折中效果。

Applications

  • �� 个性化推荐:根据用户行为动态调整模型,提升用户体验;• 医疗影像:不同医院数据异质性大,VANEB实现个性化诊断;• 工业制造:设备状态监测,个性化模型更精准,提升维护效率;• 未来结合隐私保护技术,VANEB有望在金融、医疗等敏感领域实现安全高效的个性化模型训练。

Limitations & Outlook

  • �� 理论分析基于局部M估计的渐近正态性,深度模型中估计器偏离正态可能影响效果;• 仅考虑对角协方差,相关性强的特征空间中表现有限,需扩展全协方差模型;• 计算复杂度随支持点增加,需优化支持点选择策略;• 在极端异质或样本极少场景下,模型性能仍有待提升。

Plain Language Accessible to non-experts

想象你在一个大厨房里,许多厨师都在准备不同的菜肴。每个厨师用自己的食材和方法,但他们都希望调出最适合自己口味的味道。厨房老板想帮每个厨师找到最合适的调料比例,但又不想让所有菜都一样。于是,他观察每个厨师的调味估计,结合他们的误差大小,调整每个厨师的调料比例。这就像论文中的VANEB方法,利用统计学技巧,把每个厨师的估计变得更准确,既尊重个性,又共享智慧。这样,每个厨师都能做出符合自己口味的菜,而不是千篇一律。这种方法可以用在推荐系统、医疗诊断,甚至工业监测中,帮助模型更聪明、更贴心。

ELI14 Explained like you're 14

想象你和朋友们在学校玩猜数字的游戏,每个人都试图猜出老师藏的那个数字。每个人的猜测都带有误差,就像在猜数字时会偏差一些。老师想帮每个人的猜测变得更准,但每个人的猜测误差都不同。有的很接近,有的偏差大。于是,老师观察每个人的猜测,结合他们的误差,给出一个更合理的猜测。这就像论文里的VANEB方法,它会根据每个人猜测的可靠程度,调整最终的答案。这样,大家都能得到更接近真实的数字,而不是只用简单的平均。这个技巧可以用在很多地方,比如帮医生更准确诊断,或者让你的游戏角色变得更聪明。它的秘密在于:既相信每个人的猜测,也会根据猜测的误差,给出最合理的调整。是不是很酷?

Abstract

We develop a new approach to Personalized Federated Learning across heterogeneous clients using Nonparametric Empirical Bayes (NPEB). Leveraging the asymptotic normality of local parameter estimates obtained from Empirical Risk Minimization or M-estimation, our method formulates these estimates as noisy observations to estimate an unknown shared prior via Nonparametric Maximum Likelihood. A key challenge in applying NPEB in this setting is that existing approaches assume known fixed variances, which is not true in practice. To address this, we introduce a Variance-Aware Nonparametric Empirical Bayes (VANEB) framework that leverages the parameter-dependent asymptotic variance of local M-estimators. A key technical contribution is a generalized Tweedie's formula for this heteroskedastic setting. We then establish non-asymptotic error rates for density estimation in the average squared Hellinger distance and derive an oracle denoising inequality that provides error bounds for our estimator. While our theoretical guarantees are rooted in the asymptotic regime of M-estimators, we empirically explore heuristic extensions of VANEB to modern federated learning settings involving Deep Neural Networks (DNNs). For DNNs, we propose VANEB-head and VANEB-FT, which personalize the last fully connected layer via an NPEB step using an approximate diagonal variance estimator. We show that our method has strong performance on popular vision datasets MNIST and CIFAR-10, using a convolutional neural network architecture.

stat.ML cs.LG stat.ME