Skip to content
conftrace_

ucb algorithm

44 papers

Papers

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