SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Algorithms for Differentially Private Multi-Armed Bandits
3 references·6 citing·24 second hop
Algorithms for Differentially Private Multi-Armed Bandits (2016)Algorithms for Differentially Private Mul…Finite-time Analysis of the Multiarmed Bandit Problem (2002)Finite-time Analysis of the M…Optimal Adaptive Policies for Sequential Allocation Problems (1996)Optimal Adaptive Policies for…Some aspects of the sequential design of experiments (1952)Some aspects of the sequentia…Privacy-Preserving Communication-Efficient Federated Multi-Armed Bandits (2022)Privacy-Preserving Communicat…Federated Bandit: A Gossiping Approach (2021)Federated Bandit: A Gossiping…Multi-Armed Bandits with Local Differential Privacy (2020)Multi-Armed Bandits with Loca…Federated Recommendation System via Differential Privacy (2020)Federated Recommendation Syst…Differentially-Private Federated Linear Bandits (2020)Differentially-Private Federa…The Price of Differential Privacy For Online Learning (2017)The Price of Differential Pri…Bandit Problems, Sequential Allocation of Experiments (1987)The Multi-Armed Bandit Problem: Decomposition and Computation (1987)On the Complexity of Best Arm Identification in Multi-Armed Bandit Models (2014)Bandit Algorithms (2020)A Method of Sampling Inspection (1929)Experimental Determination of the Maximum of a Function (1941)A Stochastic Approximation Method (1951)Prediction, Learning, and Games (2006)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Multi-Armed Bandit Allocation Indices (1989)Multi-Armed Bandit Allocation Indices. (1990)Sample mean based index policies by O(log n) regret for the multi-armed bandit problem (1995)The Nonstochastic Multiarmed Bandit Problem (2002)Online Learning and Online Convex Optimization (2011)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Distributed Learning in Multi-Armed Bandit With Multiple Players (2010)Analysis of Thompson Sampling for the multi-armed bandit problem (2011)Federated Multi-armed Bandits with Personalization (2021)Differentially Private Contextual Linear Bandits (2018)Improved Algorithms for Linear Stochastic Bandits (2011)Decentralized Learning for Multiplayer Multiarmed Bandits (2014)Online Context-Aware Recommendation with Time Varying Multi-Armed Bandit (2016)Decentralized Cooperative Stochastic Bandits (2018)Federated Multi-Armed Bandits (2021)
this work references cited by second hop

References

  • 2002Finite-time Analysis of the Multiarmed Bandit Problem6,033 cited
  • 1952Some aspects of the sequential design of experiments2,183 cited
  • 1996Optimal Adaptive Policies for Sequential Allocation Problems219 cited

Cited by

  • 2020Federated Recommendation System via Differential Privacy52 cited
  • 2017The Price of Differential Privacy For Online Learning51 cited
  • 2020Differentially-Private Federated Linear Bandits46 cited
  • 2022Privacy-Preserving Communication-Efficient Federated Multi-Armed Bandits30 cited
  • 2020Multi-Armed Bandits with Local Differential Privacy28 cited
  • 2021Federated Bandit: A Gossiping Approach26 cited

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