z-logo
open-access-imgOpen Access
Regret Bounds for Batched Bandits
Author(s) -
Hossein Esfandiari,
Amin Karbasi,
Abbas Mehrabian,
Vahab Mirrokni
Publication year - 2021
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - Uncategorized
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v35i8.16901
Subject(s) - regret , logarithm , mathematical optimization , simple (philosophy) , computer science , multi armed bandit , mathematics , algorithm , machine learning , mathematical analysis , philosophy , epistemology

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom