5 citations · 6 across the 3 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2021★ 1 cited
Near-Optimal Algorithms for Differentially Private Online Learning in a Stochastic Environment
Bingshan Hu, Zhiming Huang, Nishant A. Mehta +1
In this paper, we study differentially private online learning problems in a stochastic environment under both bandit and full information feedback. For differentially private stoc…
cs.LG2020★ 5 cited
Thompson Sampling for Combinatorial Semi-bandits with Sleeping Arms and Long-Term Fairness Constraints
Zhiming Huang, Yifan Xu, Bingshan Hu +2
We study the combinatorial sleeping multi-armed semi-bandit problem with long-term fairness constraints~(CSMAB-F). To address the problem, we adopt Thompson Sampling~(TS) to maximi…