Efficient and Adaptive Posterior Sampling Algorithms for Bandits

no code implementations • 2 May 2024 • Bingshan Hu, Zhiming Huang, Tianyue H. Zhang, Mathias Lécuyer, Nidhi Hegde

We study Thompson Sampling-based algorithms for stochastic bandits with bounded rewards.

Thompson Sampling

Near-Optimal Algorithms for Differentially Private Online Learning in a Stochastic Environment

no code implementations • 16 Feb 2021 • Bingshan Hu, Zhiming Huang, Nishant A. Mehta, Nidhi Hegde

In this paper, we study differentially private online learning problems in a stochastic environment under both bandit and full information feedback.

Thompson Sampling for Combinatorial Semi-bandits with Sleeping Arms and Long-Term Fairness Constraints

no code implementations • 14 May 2020 • Zhiming Huang, Yifan Xu, Bingshan Hu, QiPeng Wang, Jianping Pan

We study the combinatorial sleeping multi-armed semi-bandit problem with long-term fairness constraints~(CSMAB-F).

Fairness Movie Recommendation +1

Uncertainty measurement with belief entropy on interference effect in Quantum-Like Bayesian Networks

no code implementations • 8 Sep 2017 • Zhiming Huang, Lin Yang, Wen Jiang

Social dilemmas have been regarded as the essence of evolution game theory, in which the prisoner's dilemma game is the most famous metaphor for the problem of cooperation.