most citedOn the Complexity of Differentially Private Best-Arm Identification with Fixed Confidence

2 citations · 4 across the 4 of their papers we have counts for

collaborators
Showing stat.MLShow all

2 papers · 1 filter

stat.ML2023

CRIMED: Lower and Upper Bounds on Regret for Bandits with Unbounded Stochastic Corruption

Shubhada Agrawal, Timothée Mathieu, Debabrota Basu +1

We investigate the regret-minimisation problem in a multi-armed bandit setting with arbitrary corruptions. Similar to the classical setup, the agent receives rewards generated inde…

stat.ML2023★ 2 cited

On the Complexity of Differentially Private Best-Arm Identification with Fixed Confidence

Achraf Azize, Marc Jourdan, Aymen Al Marjani +1

Best Arm Identification (BAI) problems are progressively used for data-sensitive applications, such as designing adaptive clinical trials, tuning hyper-parameters, and conducting u…