94 citations · 301 across the 30 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LG2021
Combinatorial Bandits without Total Order for Arms
Shuo Yang, Tongzheng Ren, Inderjit S. Dhillon +1
We consider the combinatorial bandits problem, where at each time step, the online learner selects a size- subset from the arms set , where $\left|\mathcal{A}\r…
cs.LG2021★ 2 cited
Linear Bandit Algorithms with Sublinear Time Complexity
Shuo Yang, Tongzheng Ren, Sanjay Shakkottai +3
We propose two linear bandits algorithms with per-step complexity sublinear in the number of arms . The algorithms are designed for applications where the arm set is extremely l…