conftrace_

stochastic bandit

98 papers

Explore in graph

Co-occurring keywords

regret bound (1926) multi-armed bandit (1098) online learning (1777) adversarial bandit (59) stochastic optimization (1060) online algorithm (445) linear bandit (124) upper confidence bound (197) ucb algorithm (44) sample complexity (1169)

Papers

Multiple-play Stochastic Bandits with Prioritized Arm Capacity Sharing AAAI 2026
Offline-to-Online Hyperparameter Transfer for Stochastic Bandits AAAI 2025
Batch Ensemble for Variance Dependent Regret in Stochastic Bandits AAAI 2025
Follow-the-Perturbed-Leader with Fréchet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds COLT 2024
No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and NP-Hardness of Adversarial Full-Information Setting NIPS 2024
Directional Optimism for Safe Linear Bandits 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 NIPS 2024
Near Optimal Adversarial Attacks on Stochastic Bandits and Defenses with Smoothed Responses AISTATS 2024
Taming Heavy-Tailed Losses in Adversarial Bandits and the Best-of-Both-Worlds Setting NIPS 2024
Warm-up Free Policy Optimization: Improved Regret in Linear Markov Decision Processes NIPS 2024
Dissimilarity Bandits AISTATS 2024
Exploration via linearly perturbed loss minimisation AISTATS 2024
PRODuctive bandits: Importance Weighting No More NIPS 2024
Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability NIPS 2024
VCG Mechanism Design with Unknown Agent Values under Stochastic Bandit Feedback JMLR 2023
Vector Optimization with Stochastic Bandit Feedback AISTATS 2023
Adversarial Attacks on Online Learning to Rank with Click Feedback NIPS 2023
Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear Bandit Algorithms COLT 2023
Fast Asymptotically Optimal Algorithms for Non-Parametric Stochastic Bandits NIPS 2023
Adaptation to the Range in K-Armed Bandits JMLR 2023
Delayed Feedback in Generalised Linear Bandits Revisited AISTATS 2023
Stability-penalty-adaptive follow-the-regularized-leader: Sparsity, game-dependency, and best-of-both-worlds NIPS 2023
On the convergence of the MLE as an estimator of the learning rate in the Exp3 algorithm ICML 2023
Stochastic Graphical Bandits with Heavy-Tailed Rewards UAI 2023