Linear bandit algorithms with sublinear time complexity (Conference Paper) | NSF PAGES

skip to main content

Citation Details

Linear bandit algorithms with sublinear time complexity

Award ID(s):: 1751040

NSF-PAR ID:: 10435412

Author(s) / Creator(s):: Yang, S; Ren, T; Shakkottai, S; Price, E; Dhillon, IS; Sanghavi, S

Date Published:: 2022-01-01

Journal Name:: International Conference in Machine Learning

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript1.0
Conference Paper:
The DOI is not currently available.