paper-with-me

홈 › Papers

Connecting Thompson Sampling and UCB: Towards More Efficient Trade-offs Between Privacy and Regret

2025-05-05 · Bingshan Hu, Zhiming Huang, Tianyue H. Zhang, Mathias Lécuyer, Nidhi Hegde

We address differentially private stochastic bandit problems from the angles of exploring the deep connections among Thompson Sampling with Gaussian priors, Gaussian mechanisms, and Gaussian differential privacy (GDP). We propose DP-TS-UCB, a novel parametrized private bandit algorithm that enables to trade off privacy and regret. DP-TS-UCB satisfies $ \tilde{O} \left(T^{0.25(1-\alpha)}\right)$-GDP and enjoys an $O \left(K\ln^{\alpha+1}(T)/\Delta \right)$ regret bound, where $\alpha \in [0,1]$ controls the trade-off between privacy and regret. Theoretically, our DP-TS-UCB relies on anti-concentration bounds of Gaussian distributions and links exploration mechanisms in Thompson Sampling-based algorithms and Upper Confidence Bound-based algorithms, which may be of independent interest.

📄 PDF Abstract BibTeX arXiv:2505.02383

Code (0)

등록된 구현이 없습니다.

Tasks

Thompson Sampling

Similar Papers 제목 키워드 기반

Batched Thompson Sampling for Multi-Armed Bandits

2021-08-15 · Nikolai Karpov, Qin Zhang

We study Thompson Sampling algorithms for stochastic multi-armed bandits in the batched setting, in which we want to minimize the regret over a sequence of arm pulls using a small number of policy changes (or, batches). …

Multi-Armed BanditsThompson Sampling

An Empirical Evaluation of Thompson Sampling

2011-12-01 · NeurIPS 2011 12 · Olivier Chapelle, Lihong Li

Thompson sampling is one of oldest heuristic to address the exploration / exploitation trade-off, but it is surprisingly not very popular in the literature. We present here some empirical results using Thompson sampling …

Multi-Armed BanditsThompson Sampling

Efficient and Adaptive Posterior Sampling Algorithms for Bandits

2024-05-02 · Bingshan Hu, Zhiming Huang, Tianyue H. Zhang, Mathias Lécuyer 외

We study Thompson Sampling-based algorithms for stochastic bandits with bounded rewards. As the existing problem-dependent regret bound for Thompson Sampling with Gaussian priors [Agrawal and Goyal, 2017] is vacuous when…

Thompson Sampling

Deep Bandits Show-Off: Simple and Efficient Exploration with Deep Networks

2021-05-10 · NeurIPS 2021 12 · Rong Zhu, Mattia Rigotti

Designing efficient exploration is central to Reinforcement Learning due to the fundamental problem posed by the exploration-exploitation dilemma. Bayesian exploration strategies like Thompson Sampling resolve this trade…

Efficient ExplorationMulti-Armed BanditsThompson Sampling

Preferential Multi-Objective Bayesian Optimization

2024-06-20 · Raul Astudillo, Kejun Li, Maegan Tucker, Chu Xin Cheng 외

Preferential Bayesian optimization (PBO) is a framework for optimizing a decision-maker's latent preferences over available design choices. While preferences often involve multiple conflicting objectives, existing work i…

Autonomous DrivingBayesian OptimizationThompson Sampling