mlsanityData to 7 Oct 2026

Federated X-armed Bandit with Flexible Personalisation

arXiv 2409.07251 ↗First posted 11 Sep 2024stat.ML cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

This paper introduces a novel approach to personalised federated learning within the 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.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 11 of its 28 references that are in the map. First posted on arXiv 11 Sep 2024.

Builds on

11 of 28 references.

References · 11

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  2. 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,461
  3. 2018A Tutorial on Bayesian Optimizationcited by 734
  4. 2017Federated Multi-Task Learningcited by 669
  5. 2020Federated Learning of a Mixture of Global and Local Modelscited by 208
  6. 2021Federated Multi-armed Bandits with Personalizationcited by 62
  7. 2021Federated Linear Contextual Banditscited by 61
  8. 2016AIDE: Fast and Communication Efficient Distributed Optimizationcited by 42
  9. 2018A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumptioncited by 22
  10. 2022Near-Optimal Collaborative Learning in Banditscited by 18
  11. 2014Online Stochastic Optimization under Correlated Bandit Feedbackcited by 11

Built on by

Not cited yet.