conftrace_

upper confidence bound

197 papers

Explore in graph

Also known as

UCB

Co-occurring keywords

regret bound (1926) multi-armed bandit (1098) online learning (1777) contextual bandit (381) bayesian optimization (624) gaussian process (1200) thompson sampling (237) reinforcement learning (4352) stochastic optimization (1060) ucb algorithm (44)

Papers

SHARE: Synthesizing Heterogeneous Autism-support Records into Evidence-based Recommendations AAAI 2026
CoRE-Learning with Look-Ahead and Immediate Resource Allocation AAAI 2026
Multi-Objective Neural Bandits with Random Scalarization IJCAI 2025
Neural Combinatorial Clustered Bandits for Recommendation Systems AAAI 2025
In-Domain African Languages Translation Using LLMs and Multi-armed Bandits ACL 2025
ClusterUCB: Efficient Gradient-Based Data Selection for Targeted Fine-Tuning of LLMs EMNLP 2025
Efficient Graph Bandit Learning with Side-Observations and Switching Constraints AAAI 2025
Contextual Bandits with Stage-wise Constraints JMLR 2025
Improved learning rates in multi-unit uniform price auctions NIPS 2024
Materials Discovery using Max K-Armed Bandit JMLR 2024
Minimizing UCB: a Better Local Search Strategy in Local Bayesian Optimization NIPS 2024
Sample-and-Bound for Non-convex Optimization AAAI 2024
Hierarchize Pareto Dominance in Multi-Objective Stochastic Linear Bandits AAAI 2024
Near Optimal Adversarial Attacks on Stochastic Bandits and Defenses with Smoothed Responses AISTATS 2024
Improved Analysis for Bandit Learning in Matching Markets NIPS 2024
Exploration, Exploitation, and Engagement in Multi-Armed Bandits with Abandonment JMLR 2024
An Adaptive Approach for Infinitely Many-armed Bandits under Generalized Rotting Constraints NIPS 2024
Privacy-Preserving UCB Decision Process Verification via zk-SNARKs IJCAI 2024
A Nearly Optimal and Low-Switching Algorithm for Reinforcement Learning with General Function Approximation NIPS 2024
Queueing Matching Bandits with Preference Feedback NIPS 2024
TS-UCB: Improving on Thompson Sampling With Little to No Additional Computation AISTATS 2023
Optimistic Whittle Index Policy: Online Learning for Restless Bandits AAAI 2023
Learning While Scheduling in Multi-Server Systems With Unknown Statistics: MaxWeight with Discounted UCB AISTATS 2023
A Partially Observable Monte Carlo Planning Algorithm Based on Path Modification ACML 2023
Learning to Rank under Multinomial Logit Choice JMLR 2023