Search Results for author:
Found 9 papers, 4 papers with code
Stochastic Gradient Succeeds for Bandits
We show that the \emph{stochastic gradient} bandit algorithm converges to a \emph{globally optimal} policy at an $O(1/t)$ rate, even with a \emph{constant} step size.
Probably Anytime-Safe Stochastic Combinatorial Semi-Bandits
Under this constraint, we design and analyze an algorithm {\sc PASCombUCB} that minimizes the regret over the horizon of time $T$.
Fast Beam Alignment via Pure Exploration in Multi-armed Bandits
The beam alignment (BA) problem consists in accurately aligning the transmitter and receiver beams to establish a reliable communication link in wireless communication systems.
Optimal Clustering with Bandit Feedback
This paper considers the problem of online clustering with bandit feedback.
Almost Optimal Variance-Constrained Best Arm Identification
We design and analyze VA-LUCB, a parameter-free algorithm, for identifying the best arm under the fixed-confidence setup and under a stringent constraint that the variance of the chosen arm is strictly smaller than a given threshold.
Achieving the Pareto Frontier of Regret Minimization and Best Arm Identification in Multi-Armed Bandits
We study the Pareto frontier of two archetypal objectives in multi-armed bandits, namely, regret minimization (RM) and best arm identification (BAI) with a fixed horizon.
Probabilistic Sequential Shrinking: A Best Arm Identification Algorithm for Stochastic Bandits with Corruptions
When the amount of corruptions per step (CPS) is below a threshold, PSS($u$) identifies the best arm or item with probability tending to $1$ as $T\rightarrow \infty$.
Best Arm Identification for Cascading Bandits in the Fixed Confidence Setting
Finally, extensive numerical simulations corroborate the efficacy of CascadeBAI as well as the tightness of our upper bound on its time complexity.
Thompson Sampling Algorithms for Cascading Bandits
While Thompson sampling (TS) algorithms have been shown to be empirically superior to Upper Confidence Bound (UCB) algorithms for cascading bandits, theoretical guarantees are only known for the latter.
