Skip to content
conftrace_

stochastic bandit

114 papers

Papers

An Anytime Algorithm for Good Arm Identification JMLR 2026 Multiple-play Stochastic Bandits with Prioritized Arm Capacity Sharing AAAI 2026 The Price of Knowledge: Optimal Algorithms for Costly Bandits UAI 2026 The Role of Contextual Information in Best Arm Identification JMLR 2026 Batch Ensemble for Variance Dependent Regret in Stochastic Bandits AAAI 2025 Connecting Thompson Sampling and UCB: Towards More Efficient Trade-offs Between Privacy and Regret ICML 2025 Fusing Reward and Dueling Feedback in Stochastic Bandits ICML 2025 Logarithmic Regret for Unconstrained Submodular Maximization Stochastic Bandit ALT 2025 Multi-thresholding Good Arm Identification with Bandit Feedback ACML 2025 Offline-to-Online Hyperparameter Transfer for Stochastic Bandits AAAI 2025 uniINF: Best-of-Both-Worlds Algorithm for Parameter-Free Heavy-Tailed MABs ICLR 2025 Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability NeurIPS 2024 Directional Optimism for Safe Linear Bandits AISTATS 2024 Dissimilarity Bandits AISTATS 2024 Exploration via linearly perturbed loss minimisation AISTATS 2024 Follow-the-Perturbed-Leader with Fréchet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds COLT 2024 Linear bandits with polylogarithmic minimax regret COLT 2024 Low-rank Matrix Bandits with Heavy-tailed Rewards UAI 2024 Near Optimal Adversarial Attacks on Stochastic Bandits and Defenses with Smoothed Responses AISTATS 2024 Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits AISTATS 2024 No-Regret Bandit Exploration based on Soft Tree Ensemble Model NeurIPS 2024 No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and NP-Hardness of Adversarial Full-Information Setting NeurIPS 2024 PRODuctive bandits: Importance Weighting No More NeurIPS 2024 Taming Heavy-Tailed Losses in Adversarial Bandits and the Best-of-Both-Worlds Setting NeurIPS 2024 Warm-up Free Policy Optimization: Improved Regret in Linear Markov Decision Processes NeurIPS 2024