BARA: Efficient Incentive Mechanism with Online Reward Budget Allocation in Cross-Silo Federated Learning

Yunchao Yang, Yipeng Zhou, Miao Hu, Di Wu, Quan Z. Sheng

Introduction

In cross-silo Federated Learning (FL), organizations (clients) collaborate to train a global model without sharing raw data. To compensate for computational costs and privacy risks, these clients require incentives. While existing research often focuses on splitting rewards among participants within a single round, the temporal allocation of a fixed total budget across multiple communication rounds remains largely unexplored.

This presents a "Goldilocks" challenge: spending too much per round recruits high-quality clients but exhausts the budget prematurely; spending too little allows for more rounds but results in slow progress and lower final accuracy. Because the relationship between budget, participant count, and model utility is often opaque and dataset-dependent, finding the optimal allocation strategy is difficult.

The BARA Framework

The authors propose BARA (Budget Allocation for Reverse Auction), an online algorithm that dynamically learns the optimal budget strategy during training. BARA acts as a manager for existing incentive mechanisms, determining the ideal number of participants for each round to maximize final model utility. Its architecture is built on three pillars:

  1. Newton’s Polynomial Interpolation: To overcome the limitation of observing only one outcome per round, BARA uses interpolation to synthesize "artificial" training records, creating a richer dataset for optimization.
  2. Gaussian Process (GP) Modeling: BARA models the complex, noisy relationship between participant count and model utility using a GP with a composite kernel that prioritizes recent observations.
  3. Bayesian Optimization (GP-UCB): Using the Upper Confidence Bound algorithm, BARA balances exploring new participant counts with exploiting known high-performing ones.

Experimental Evaluation

BARA was evaluated on four standard benchmarks—MNIST, Fashion-MNIST (FMNIST), CIFAR-10, and CIFAR-100—distributed among 20 clients in a non-IID manner to simulate real-world data heterogeneity.

Key Results

BARA consistently outperformed several baselines, including Even Allocation (EA), Monotonically Increasing/Decreasing (MIA/MDA), and Random Allocation (RA).

BARA achieves the highest final test accuracy compared to baseline allocation strategies on the FMNIST dataset.

Experimental results demonstrate that BARA achieves superior accuracy and efficiency. For instance, on MNIST, BARA reached approximately 90% accuracy, significantly higher than the 87% achieved by the standard Even Allocation strategy. Furthermore, BARA reached these higher accuracy levels using the same total reward budget, proving its cost-effectiveness.

Stability and Convergence

A critical feature of BARA is its ability to identify the optimal "sweet spot" for participant counts. As shown in the figures below, after an initial exploration phase, the algorithm's selection for the number of participants stabilizes across all datasets.

The number of participants selected by BARA stabilizes across all datasets after an initial exploration phase, indicating convergence to an optimal strategy.

Conclusion and Future Work

BARA demonstrates that treating training duration as a variable dependent on budget allocation can significantly improve FL performance. While highly effective, the current framework assumes a fixed total budget and may face computational bottlenecks in the GP update as communication rounds scale into the thousands. Future research could address dynamic budget environments and more complex client heterogeneity involving varying hardware capabilities and bidding behaviors.

Summary updated

Abstract

Federated learning (FL) is a prospective distributed machine learning framework that can preserve data privacy. In particular, cross-silo FL can complete model training by making isolated data islands of different organizations collaborate with a parameter server (PS) via exchanging model parameters for multiple communication rounds. In cross-silo FL, an incentive mechanism is indispensable for motivating data owners to contribute their models to FL training. However, how to allocate the reward budget among different rounds is an essential but complicated problem largely overlooked by existing works. The challenge of this problem lies in the opaque feedback between reward budget allocation and model utility improvement of FL, making the optimal reward budget allocation complicated. To address this problem, we design an online reward budget allocation algorithm using Bayesian optimization named BARA (Budget Allocation for Reverse Auction). Specifically, BARA can model the complicated relationship between reward budget allocation and final model accuracy in FL based on historical training records so that the reward budget allocated to each communication round is dynamically optimized so as to maximize the final model utility. We further incorporate the BARA algorithm into reverse auction-based incentive mechanisms to illustrate its effectiveness. Extensive experiments are conducted on real datasets to demonstrate that BARA significantly outperforms competitive baselines by improving model utility with the same amount of reward budget.
BibTeX
@inproceedings{yang2023bara,
  author = {Yunchao Yang and Yipeng Zhou and Miao Hu and Di Wu and Quan Z. Sheng},
  title = {{BARA: Efficient Incentive Mechanism with Online Reward Budget Allocation in Cross-Silo Federated Learning}},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year = {2023},
  doi = {10.24963/ijcai.2023/498},
}
Figure