| 2026 | INFOCOM | Bridging the Regret Gap in Combinatorial Thompson Sampling: Worst-Case Guarantees and Algorithmic Refinement. | Zhiming Huang, Bingshan Hu, Jianping Pan |
| 2025 | ICML | Connecting Thompson Sampling and UCB: Towards More Efficient Trade-offs Between Privacy and Regret. | Bingshan Hu, Zhiming Huang, Tianyue H. Zhang, Mathias Lcuyer, Nidhi Hegde |
| 2024 | COLT | Open Problem: Optimal Rates for Stochastic Decision-Theoretic Online Learning Under Differentially Privacy. | Bingshan Hu, Nishant A. Mehta |
| 2023 | UAI | Optimistic Thompson Sampling-based algorithms for episodic reinforcement learning. | Bingshan Hu, Tianyue H. Zhang, Nidhi Hegde, Mark Schmidt |
| 2022 | UAI | Near-optimal Thompson sampling-based algorithms for differentially private stochastic bandits. | Bingshan Hu, Nidhi Hegde |
| 2021 | ICDCS | Poster: Multi-agent Combinatorial Bandits with Moving Arms. | Zhiming Huang, Bingshan Hu, Jianping Pan |
| 2019 | ICDCS | Intelligent Caching Algorithms in Heterogeneous Wireless Networks with Uncertainty. | Bingshan Hu, Yunjin Chen, Zhiming Huang, Nishant A. Mehta, Jianping Pan |
| 2019 | UAI | Problem-dependent Regret Bounds for Online Learning with Feedback Graphs. | Bingshan Hu, Nishant A. Mehta, Jianping Pan |
| 2018 | LCN | Intelligent Caching in Dense Small-Cell Networks with Limited External Resources. | Bingshan Hu, Maryam Tanha, Dawood Sajjadi, Jianping Pan |