ملف الباحث

Noa Ben-David

ورقة واحدة في مجموعة PaperMetrix

المنشورات

أوراق هذا المؤلف

  1. A Fast Algorithm for PAC Combinatorial Pure Exploration

    2022 · Proceedings of the AAAI Conference on Artificial Intelligence

    We consider the problem of Combinatorial Pure Exploration (CPE), which deals with finding a combinatorial set of arms with a high reward, when the rewards of individual arms are unknown in advance and must be …