FedDive: escaping local minima through divergence-rewarded exploration in federated learning: a robust approach with gated divergence rewards
摘要
Federated learning (FL) confronts a fundamental paradox: conventional aggregation strategies enforce consensus that stifles the diversity making federated systems powerful. This consensus-driven approach degrades the performance in non-IID environments, where conflicting client updates drive the global model into suboptimal local minima. We introduce Federated Diversity Exploration (FedDive), which rewards divergence instead of penalizing it. FedDive maintains a momentum-guided trajectory representing global consensus and then amplifies the influence of clients whose updates diverge from this path. This exploration-rewarding mechanism enables escape from shallow local minima, transforming client diversity into an optimization asset. This claim is validated on the MNIST dataset, given the model architecture’s and the hyperparameters’ dependence on the dataset, with extensions to more complex data environments identified as a key direction for future work. Experiments demonstrate FedDive’s effectiveness: maintaining performance on IID data at 97.78% (versus FedAvg’s 97.92%), achieving 88.50% accuracy under extreme heterogeneity (