1 citations · 3 across the 4 of their papers we have counts for
4 papers · 1 filter
Adversarial Linear Contextual Bandits with Graph-Structured Side Observations
Lingda Wang, Bingcong Li, Huozhi Zhou +3
This paper studies the adversarial graphical contextual bandits, a variant of adversarial multi-armed bandits that leverage two categories of the most common side information: \emp…
Nearly Optimal Algorithms for Piecewise-Stationary Cascading Bandits
Lingda Wang, Huozhi Zhou, Bingcong Li +2
Cascading bandit (CB) is a popular model for web search and online advertising, where an agent aims to learn the most attractive items out of a ground set of size during th…
A Near-Optimal Change-Detection Based Algorithm for Piecewise-Stationary Combinatorial Semi-Bandits
Huozhi Zhou, Lingda Wang, Lav R. Varshney +1
We investigate the piecewise-stationary combinatorial semi-bandit problem. Compared to the original combinatorial semi-bandit problem, our setting assumes the reward distributions…
Almost Tune-Free Variance Reduction
Bingcong Li, Lingda Wang, Georgios B. Giannakis
The variance reduction class of algorithms including the representative ones, SVRG and SARAH, have well documented merits for empirical risk minimization problems. However, they re…