{"title":"具有灵活个性化功能的联合 $mathcal{X}$-armed Bandit","authors":"Ali Arabzadeh, James A. Grant, David S. Leslie","doi":"arxiv-2409.07251","DOIUrl":null,"url":null,"abstract":"This paper introduces a novel approach to personalised federated learning\nwithin the $\\mathcal{X}$-armed bandit framework, addressing the challenge of\noptimising both local and global objectives in a highly heterogeneous\nenvironment. Our method employs a surrogate objective function that combines\nindividual client preferences with aggregated global knowledge, allowing for a\nflexible trade-off between personalisation and collective learning. We propose\na phase-based elimination algorithm that achieves sublinear regret with\nlogarithmic communication overhead, making it well-suited for federated\nsettings. Theoretical analysis and empirical evaluations demonstrate the\neffectiveness of our approach compared to existing methods. Potential\napplications of this work span various domains, including healthcare, smart\nhome devices, and e-commerce, where balancing personalisation with global\ninsights is crucial.","PeriodicalId":501340,"journal":{"name":"arXiv - STAT - Machine Learning","volume":"71 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Federated $\\\\mathcal{X}$-armed Bandit with Flexible Personalisation\",\"authors\":\"Ali Arabzadeh, James A. Grant, David S. Leslie\",\"doi\":\"arxiv-2409.07251\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper introduces a novel approach to personalised federated learning\\nwithin the $\\\\mathcal{X}$-armed bandit framework, addressing the challenge of\\noptimising both local and global objectives in a highly heterogeneous\\nenvironment. Our method employs a surrogate objective function that combines\\nindividual client preferences with aggregated global knowledge, allowing for a\\nflexible trade-off between personalisation and collective learning. We propose\\na phase-based elimination algorithm that achieves sublinear regret with\\nlogarithmic communication overhead, making it well-suited for federated\\nsettings. Theoretical analysis and empirical evaluations demonstrate the\\neffectiveness of our approach compared to existing methods. Potential\\napplications of this work span various domains, including healthcare, smart\\nhome devices, and e-commerce, where balancing personalisation with global\\ninsights is crucial.\",\"PeriodicalId\":501340,\"journal\":{\"name\":\"arXiv - STAT - Machine Learning\",\"volume\":\"71 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - STAT - Machine Learning\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.07251\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - STAT - Machine Learning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.07251","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Federated $\mathcal{X}$-armed Bandit with Flexible Personalisation
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.