Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Readability
Mathematics of operations research, 2022-08, Vol.47 (3), p.1904 [Peer Reviewed Journal]COPYRIGHT 2022 Institute for Operations Research and the Management Sciences ;ISSN: 0364-765X ;EISSN: 1526-5471 ;DOI: 10.1287/moor.2021.1193
Digital Resources/Online E-Resources
|
||||
 |
INSPIRE LIBRARY - TON DUC THANG UNIVERSITY |  |
(84-028) 37 755 057 | Feedback |
| 19 Nguyen Huu Tho St. Dist.7, HCM |  |
thuvien@tdtu.edu.vn | ||