The reviewed record of science sign in
Pith

arxiv: 2402.15070 · v1 · pith:IHHOHUKI · submitted 2024-02-23 · cs.LG

Enhancing One-Shot Federated Learning Through Data and Ensemble Co-Boosting

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:IHHOHUKIrecord.jsonopen to challenge →

classification cs.LG
keywords modelensembleco-boostingdataclientlearningmodelssamples
0
0 comments X
read the original abstract

One-shot Federated Learning (OFL) has become a promising learning paradigm, enabling the training of a global server model via a single communication round. In OFL, the server model is aggregated by distilling knowledge from all client models (the ensemble), which are also responsible for synthesizing samples for distillation. In this regard, advanced works show that the performance of the server model is intrinsically related to the quality of the synthesized data and the ensemble model. To promote OFL, we introduce a novel framework, Co-Boosting, in which synthesized data and the ensemble model mutually enhance each other progressively. Specifically, Co-Boosting leverages the current ensemble model to synthesize higher-quality samples in an adversarial manner. These hard samples are then employed to promote the quality of the ensemble model by adjusting the ensembling weights for each client model. Consequently, Co-Boosting periodically achieves high-quality data and ensemble models. Extensive experiments demonstrate that Co-Boosting can substantially outperform existing baselines under various settings. Moreover, Co-Boosting eliminates the need for adjustments to the client's local training, requires no additional data or model transmission, and allows client models to have heterogeneous architectures.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Demystifying the Optimal Fair Classifier in Multi-Class Classification

    cs.LG 2026-05 unverdicted novelty 6.0

    Derives tractable optimal fair multi-class classifier and supplies in-processing and post-processing algorithms that converge to the accuracy-fairness Pareto frontier.

  2. Provable Sparse Inversion and Token Relabel Enhanced One-shot Federated Learning with ViTs

    cs.LG 2026-05 unverdicted novelty 6.0

    FedMITR uses sparse model inversion and token relabeling to improve one-shot federated learning with ViTs under non-IID conditions, delivering a tighter generalization bound via algorithmic stability analysis and bett...