bandit problem

TGDPO: Harnessing Token-Level Reward Guidance for Enhancing Direct Preference Optimization ICML 2025 Bandits with Preference Feedback: A Stackelberg Game Perspective NeurIPS 2024 Uniform Last-Iterate Guarantee for Bandits and Reinforcement Learning NeurIPS 2024 Likelihood Ratio Confidence Sets for Sequential Decision Making NeurIPS 2023 Efficient Online Bayesian Inference for Neural Bandits AISTATS 2022 Hierarchical Bayesian Bandits AISTATS 2022 Beyond Variance Reduction: Understanding the True Impact of Baselines on Policy Optimization ICML 2021 Deep Proxy Causal Learning and its Application to Confounded Bandit Policy Evaluation NeurIPS 2021 Making the most of your day: online learning for optimal allocation of time NeurIPS 2021 No Regrets for Learning the Prior in Bandits NeurIPS 2021 Pure Exploration with Multiple Correct Answers NeurIPS 2019 Efficient Thompson Sampling for Online Matrix-Factorization Recommendation NeurIPS 2015 Efficient learning by implicit exploration in bandit problems with side observations NeurIPS 2014