Bypassing the monster : a faster and simpler optimal algorithm for contextual bandits under realizability
Year of publication: |
2022
|
---|---|
Authors: | Simchi-Levi, David ; Xu, Yunzong |
Published in: |
Mathematics of operations research. - Hanover, Md. : INFORMS, ISSN 1526-5471, ZDB-ID 2004273-5. - Vol. 47.2022, 3, p. 1904-1931
|
Subject: | computational efficiency | contextual bandit | offline regression | online-to-offline reduction | statistical learning |
-
Dynamic assortment personalization in high dimensions
Kallus, Nathan, (2020)
-
Mostly exploration-free algorithms for contextual bandits
Bastani, Hamsa, (2021)
-
Alban, Andres, (2024)
- More ...
-
Blind Network Revenue Management and Bandits with Knapsacks under Limited Switches
Simchi-Levi, David, (2021)
-
Phase Transitions and Cyclic Phenomena in Bandits with Switching Constraints
Simchi-Levi, David, (2020)
-
Online Pricing with Offline Data : Phase Transition and Inverse Square Law
Bu, Jinzhi, (2020)
- More ...