11 citations · 46 across the 18 of their papers we have counts for
Showing 2019 · cs.LGShow all
3 papers · 2 filters
cs.LG2019★ 11 cited
Bandit Convex Optimization in Non-stationary Environments
Peng Zhao, Guanghui Wang, Lijun Zhang +1
Bandit Convex Optimization (BCO) is a fundamental framework for modeling sequential decision-making with partial information, where the only feedback available to the player is the…
cs.LG2019★ 6 cited
Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive Regret of Convex Functions
Lijun Zhang, Guanghui Wang, Wei-Wei Tu +1
To deal with changing environments, a new performance measure -- adaptive regret, defined as the maximum static regret over any interval, was proposed in online learning. Under the…
cs.LG2019★ 5 cited
Multi-Objective Generalized Linear Bandits
Shiyin Lu, Guanghui Wang, Yao Hu +1
In this paper, we study the multi-objective bandits (MOB) problem, where a learner repeatedly selects one arm to play and then receives a reward vector consisting of multiple objec…