Home > Research > Publications & Outputs > Federated $\mathcal{X}$-armed Bandit with Flexi...

Electronic data

  • 2409.07251v1

    Submitted manuscript, 562 KB, PDF document

    Available under license: CC BY: Creative Commons Attribution 4.0 International License

Links

Keywords

View graph of relations

Federated $\mathcal{X}$-armed Bandit with Flexible Personalisation

Research output: Working paperPreprint

Published
Publication date11/09/2024
PublisherArxiv
<mark>Original language</mark>English

Abstract

This paper introduces a novel approach to personalised federated learning within the $\mathcal{X}$-armed bandit framework, addressing the challenge of optimising both local and global objectives in a highly heterogeneous environment. Our method employs a surrogate objective function that combines individual client preferences with aggregated global knowledge, allowing for a flexible trade-off between personalisation and collective learning. We propose a phase-based elimination algorithm that achieves sublinear regret with logarithmic communication overhead, making it well-suited for federated settings. Theoretical analysis and empirical evaluations demonstrate the effectiveness of our approach compared to existing methods. Potential applications of this work span various domains, including healthcare, smart home devices, and e-commerce, where balancing personalisation with global insights is crucial.