7 citations · 25 across the 24 of their papers we have counts for
6 papers · 1 filter
Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed Rewards
Bo Xue, Yimu Wang, Yuanyu Wan +2
This paper investigates the problem of generalized linear bandits with heavy-tailed rewards, whose -th moment is bounded for some . Although there exist methods…
Adversarial Erasing with Pruned Elements: Towards Better Graph Lottery Ticket
Yuwen Wang, Shunyu Liu, Kaixuan Chen +5
Graph Lottery Ticket (GLT), a combination of core subgraph and sparse subnetwork, has been proposed to mitigate the computational cost of deep Graph Neural Networks (GNNs) on large…
Improved Projection-free Online Continuous Submodular Maximization
Yucheng Liao, Yuanyu Wan, Chang Yao +1
We investigate the problem of online learning with monotone and continuous DR-submodular reward functions, which has received great attention recently. To efficiently handle this p…
Non-stationary Projection-free Online Learning with Dynamic and Adaptive Regret Guarantees
Yibo Wang, Wenhao Yang, Wei Jiang +5
Projection-free online learning has drawn increasing interest due to its efficiency in solving high-dimensional problems with complicated constraints. However, most existing projec…
Non-stationary Delayed Online Convex Optimization: From Full-information to Bandit Setting
Yuanyu Wan, Chang Yao, Yitao Ma +2
Although online convex optimization (OCO) under arbitrary delays has received increasing attention recently, previous studies focus on stationary environments with the goal of mini…
Improved Dynamic Regret for Online Frank-Wolfe
Yuanyu Wan, Lijun Zhang, Mingli Song
To deal with non-stationary online problems with complex constraints, we investigate the dynamic regret of online Frank-Wolfe (OFW), which is an efficient projection-free algorithm…