SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Federated Multi-armed Bandits with Personalization
8 references·1 citing·22 second hop
Federated Multi-armed Bandits with Personalization (2021)Federated Multi-armed Bandits with Person…Federated Multi-Armed Bandits (2021)Federated Multi-Armed BanditsFederated Recommendation System via Differential Privacy (2020)Federated Recommendation Syst…Differentially-Private Federated Linear Bandits (2020)Differentially-Private Federa…A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players (2019)A Practical Algorithm for Mul…SIC-MMAB: Synchronisation Involves Communication in Multiplayer Multi-Armed Bandits (2018)SIC-MMAB: Synchronisation Inv…Multi-armed bandits in multi-agent networks (2017)Multi-armed bandits in multi-…Multi-Player Bandits -- a Musical Chairs Approach (2015)Multi-Player Bandits -- a Mus…Distributed Learning in Multi-Armed Bandit With Multiple Players (2010)Distributed Learning in Multi…Privacy-Preserving Communication-Efficient Federated Multi-Armed Bandits (2022)Privacy-Preserving Communicat…Sample mean based index policies by O(log n) regret for the multi-armed bandit problem (1995)Finite-time Analysis of the Multiarmed Bandit Problem (2002)1 1 Online Learning of Rested and Restless Bandits (2012)Learning in a Changing World: Restless Multiarmed Bandit With Unknown Dynamics (2012)Introduction to Multi-Armed Bandits (2019)The Nonstochastic Multiarmed Bandit Problem (2002)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Social Imitation in Cooperative Multiarmed Bandits: Partition-Based Algorithms with Strictly Local Information (2018)Competing Bandits in Matching Markets (2019)Social Learning in Multi Agent Multi Armed Bandits (2019)Some aspects of the sequential design of experiments (1952)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Optimal Algorithms for Multiplayer Multi-Armed Bandits (2019)Multiplayer Bandits Without Observing Collision Information (2021)Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations (2012)Decentralized Learning in Online Queuing Systems (2021)Multiplayer Bandits: A Trekking Approach (2021)Analysis of Thompson Sampling for the multi-armed bandit problem (2011)Improved Algorithms for Linear Stochastic Bandits (2011)Algorithms for Differentially Private Multi-Armed Bandits (2016)Online Context-Aware Recommendation with Time Varying Multi-Armed Bandit (2016)Federated Bandit: A Gossiping Approach (2021)
this work references cited by second hop

References

  • 2010Distributed Learning in Multi-Armed Bandit With Multiple Players386 cited
  • 2015Multi-Player Bandits -- a Musical Chairs Approach117 cited
  • 2021Federated Multi-Armed Bandits71 cited
  • 2018SIC-MMAB: Synchronisation Involves Communication in Multiplayer Multi-Armed Bandits67 cited
  • 2017Multi-armed bandits in multi-agent networks65 cited
  • 2020Federated Recommendation System via Differential Privacy52 cited
  • 2020Differentially-Private Federated Linear Bandits46 cited
  • 2019A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players43 cited

Cited by

  • 2022Privacy-Preserving Communication-Efficient Federated Multi-Armed Bandits30 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work