Skip to content
conftrace_

upper confidence bound

241 papers

UCB

Papers

TS-UCB: Improving on Thompson Sampling With Little to No Additional Computation AISTATS 2023 An Online Learning Approach to Sequential User-Centric Selection Problems AAAI 2022 Asynchronous Upper Confidence Bound Algorithms for Federated Linear Bandits AISTATS 2022 Augmented RBMLE-UCB Approach for Adaptive Control of Linear Quadratic Systems NeurIPS 2022 Bandit Learning with Joint Effect of Incentivized Sampling, Delayed Sampling Feedback, and Self-Reinforcing User Preferences ICLR 2022 Combinatorial Bandits with Linear Constraints: Beyond Knapsacks and Fairness NeurIPS 2022 Constraint Sampling Reinforcement Learning: Incorporating Expertise for Faster Learning AAAI 2022 Contextual Dynamic Pricing with Unknown Noise: Explore-then-UCB Strategy and Improved Regrets NeurIPS 2022 Contrastive UCB: Provably Efficient Contrastive Self-Supervised Learning in Online Reinforcement Learning ICML 2022 EE-Net: Exploitation-Exploration Neural Networks in Contextual Bandits ICLR 2022 From Dirichlet to Rubin: Optimistic Exploration in RL without Bonuses ICML 2022 How Did the Model Change? Efficiently Assessing Machine Learning API Shifts ICLR 2022 KL-UCB-Switch: Optimal Regret Bounds for Stochastic Bandits from Both a Distribution-Dependent and a Distribution-Free Viewpoints JMLR 2022 Multi-Agent Multi-Armed Bandits with Limited Communication JMLR 2022 Nearly Minimax Optimal Reinforcement Learning with Linear Function Approximation ICML 2022 Neural Contextual Bandits with Deep Representation and Shallow Exploration ICLR 2022 Neural Contextual Bandits without Regret AISTATS 2022 On provably robust meta-Bayesian optimization UAI 2022 Optimal Rates of (Locally) Differentially Private Heavy-tailed Multi-Armed Bandits AISTATS 2022 PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importance ICML 2022 Provable General Function Class Representation Learning in Multitask Bandits and MDP NeurIPS 2022 Thompson Sampling for (Combinatorial) Pure Exploration ICML 2022 Thompson Sampling for Robust Transfer in Multi-Task Bandits ICML 2022 Weighted Gaussian Process Bandits for Non-stationary Environments AISTATS 2022 A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithms NeurIPS 2021