ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2006.06792
  4. Cited By
Quantile Multi-Armed Bandits: Optimal Best-Arm Identification and a
  Differentially Private Scheme

Quantile Multi-Armed Bandits: Optimal Best-Arm Identification and a Differentially Private Scheme

11 June 2020
Konstantinos E. Nikolakakis
Dionysios S. Kalogerias
Or Sheffet
Anand D. Sarwate
ArXivPDFHTML

Papers citing "Quantile Multi-Armed Bandits: Optimal Best-Arm Identification and a Differentially Private Scheme"

3 / 3 papers shown
Title
CRIMED: Lower and Upper Bounds on Regret for Bandits with Unbounded
  Stochastic Corruption
CRIMED: Lower and Upper Bounds on Regret for Bandits with Unbounded Stochastic Corruption
Shubhada Agrawal
Timothée Mathieu
D. Basu
Odalric-Ambrym Maillard
30
2
0
28 Sep 2023
On the Complexity of Differentially Private Best-Arm Identification with
  Fixed Confidence
On the Complexity of Differentially Private Best-Arm Identification with Fixed Confidence
Achraf Azize
Marc Jourdan
Aymen Al Marjani
D. Basu
44
3
0
05 Sep 2023
Sample Complexity Bounds on Differentially Private Learning via
  Communication Complexity
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity
Vitaly Feldman
David Xiao
175
72
0
25 Feb 2014
1