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 | Theorie | Theory | Regressionsanalyse | Regression analysis | Algorithmus | Algorithm | Lernprozess | Learning process |
-
Can machine learning algorithms deliver superior models for rental guides?
Trinkaus, Oliver, (2023)
-
Asset return prediction via machine learning
Zhang, Liangliang, (2019)
-
Imbalanced learning for insurance using modified loss functions in tree-based models
Hu, Changyue, (2022)
- More ...
-
Online Pricing with Offline Data : Phase Transition and Inverse Square Law
Bu, Jinzhi, (2020)
-
Phase Transitions and Cyclic Phenomena in Bandits with Switching Constraints
Simchi-Levi, David, (2020)
-
Phase transitions in bandits with switching constraints
Simchi-Levi, David, (2023)
- More ...