no code implementations • 3 Feb 2024 • Xueqing Liu, Kyra Gan, Esmaeil Keyvanshokooh, Susan Murphy
In the OUA problem, the algorithm is given a budget $b$ and a time horizon $T$, and an adversary then chooses a value $\tau^* \in [b, T]$, which is revealed to the algorithm online.
no code implementations • 29 May 2023 • Kyra Gan, Esmaeil Keyvanshokooh, Xueqing Liu, Susan Murphy
Contextual bandit algorithms are commonly used in digital health to recommend personalized treatments.