conftrace_

ucb algorithm

44 papers

Explore in graph

Co-occurring keywords

multi-armed bandit (1098) regret bound (1926) upper confidence bound (197) online learning (1777) stochastic bandit (98) stochastic optimization (1060) regret analysis (73) thompson sampling (237) regret minimization (315) combinatorial optimization (1039)

Papers

Multiple-play Stochastic Bandits with Prioritized Arm Capacity Sharing AAAI 2026
p-Mean Regret for Stochastic Bandits AAAI 2025
Queueing Matching Bandits with Preference Feedback NIPS 2024
Improved Analysis for Bandit Learning in Matching Markets NIPS 2024
Near Optimal Adversarial Attacks on Stochastic Bandits and Defenses with Smoothed Responses AISTATS 2024
Stochastic Graphical Bandits with Heavy-Tailed Rewards UAI 2023
Learning to Incentivize Information Acquisition: Proper Scoring Rules Meet Principal-Agent Model ICML 2023
Saving Stochastic Bandits from Poisoning Attacks via Limited Data Verification AAAI 2022
Optimal Rates of (Locally) Differentially Private Heavy-tailed Multi-Armed Bandits AISTATS 2022
Multi-armed Bandit Algorithm against Strategic Replication AISTATS 2022
Modeling Attrition in Recommender Systems with Departing Bandits AAAI 2022
Uplifting Bandits NIPS 2022
Rotting Infinitely Many-Armed Bandits ICML 2022
Random Effect Bandits AISTATS 2022
Bandits with many optimal arms NIPS 2021
Achieving Fairness in the Stochastic Multi-Armed Bandit Problem JMLR 2021
Matrix games with bandit feedback UAI 2021
Combinatorial Blocking Bandits with Stochastic Delays ICML 2021
Learning in Non-Cooperative Configurable Markov Decision Processes NIPS 2021
From Finite to Countable-Armed Bandits NIPS 2020
A Simple Approach for Non-stationary Linear Bandits AISTATS 2020
Robust Outlier Arm Identification ICML 2020
Multinomial Logit Bandit with Low Switching Cost ICML 2020
Problem-dependent Regret Bounds for Online Learning with Feedback Graphs UAI 2019
Stochastic Bandits with Context Distributions NIPS 2019