Papers
1–3 of 3Research Paper·Mar 10, 2026
What Do We Care About in Bandits with Noncompliance? BRACE: Bandits with Recommendations, Abstention, and Certified Effects
Bandits with noncompliance separate the learner's recommendation from the treatment actually delivered, so the learning target itself must be chosen. A platform may care about recommendation welfare i...
4.0 viability
Research Paper·Mar 11, 2026
On The Complexity of Best-Arm Identification in Non-Stationary Linear Bandits
We study the fixed-budget best-arm identification (BAI) problem in non-stationary linear bandits. Concretely, given a fixed time budget $T\in \mathbb{N}$, finite arm set $\mathcal{X} \subset \mathbb{R...
2.0 viability
Research Paper·Mar 13, 2026
A Reduction Algorithm for Markovian Contextual Linear Bandits
Recent work shows that when contexts are drawn i.i.d., linear contextual bandits can be reduced to single-context linear bandits. This ``contexts are cheap" perspective is highly advantageous, as it a...
2.0 viability