upper confidence bound

Safe Cooperative Multi-Agent Reinforcement Learning with Function Approximation L4DC 2025 Variance-Aware Linear UCB with Deep Representation for Neural Contextual Bandits AISTATS 2025 Zero-Inflated Bandits ICML 2025 Adaptively Learning to Select-Rank in Online Platforms ICML 2024 An Adaptive Approach for Infinitely Many-armed Bandits under Generalized Rotting Constraints NeurIPS 2024 A Nearly Optimal and Low-Switching Algorithm for Reinforcement Learning with General Function Approximation NeurIPS 2024 Exploration, Exploitation, and Engagement in Multi-Armed Bandits with Abandonment JMLR 2024 Exploring High-dimensional Search Space via Voronoi Graph Traversing UAI 2024 Graph Feedback Bandits with Similar Arms UAI 2024 Hierarchize Pareto Dominance in Multi-Objective Stochastic Linear Bandits AAAI 2024 Improved Analysis for Bandit Learning in Matching Markets NeurIPS 2024 Improved learning rates in multi-unit uniform price auctions NeurIPS 2024 Materials Discovery using Max K-Armed Bandit JMLR 2024 Meta-VBO: Utilizing Prior Tasks in Optimizing Risk Measures with Gaussian Processes ICLR 2024 Minimizing UCB: a Better Local Search Strategy in Local Bayesian Optimization NeurIPS 2024 Near Optimal Adversarial Attacks on Stochastic Bandits and Defenses with Smoothed Responses AISTATS 2024 Power Mean Estimation in Stochastic Monte-Carlo Tree Search UAI 2024 Privacy-Preserving UCB Decision Process Verification via zk-SNARKs IJCAI 2024 Provably Efficient UCB-type Algorithms For Learning Predictive State Representations ICLR 2024 Quantum Kernelized Bandits UAI 2024 Queueing Matching Bandits with Preference Feedback NeurIPS 2024 Sample-and-Bound for Non-convex Optimization AAAI 2024 A Partially Observable Monte Carlo Planning Algorithm Based on Path Modification ACML 2023 Are Random Decompositions all we need in High Dimensional Bayesian Optimisation? ICML 2023 Bandit Task Assignment with Unknown Processing Time NeurIPS 2023