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

Follow-ups Also Matter: Improving Contextual Bandits via Post-serving Contexts NIPS 2023
When Privacy Meets Partial Information: A Refined Analysis of Differentially Private Bandits NIPS 2022
Breaking the $\sqrtT$ Barrier: Instance-Independent Logarithmic Regret in Stochastic Contextual Linear Bandits ICML 2022
Simultaneously Learning Stochastic and Adversarial Bandits with General Graph Feedback ICML 2022
Multi-Fidelity Best-Arm Identification NIPS 2022
Stochastic Rising Bandits ICML 2022
Multiple-Play Stochastic Bandits with Shareable Finite-Capacity Arms ICML 2022
CVaR-Regret Bounds for Multi-armed Bandits ACML 2022
Near-optimal Thompson sampling-based algorithms for differentially private stochastic bandits UAI 2022
A Simple Unified Framework for High Dimensional Bandit Problems ICML 2022
Shuffle Private Linear Contextual Bandits ICML 2022
A Bayesian Approach for Stochastic Continuum-armed Bandit with Long-term Constraints AISTATS 2022
A Wasserstein Distance Approach for Concentration of Empirical Risk Estimates JMLR 2022
KL-UCB-Switch: Optimal Regret Bounds for Stochastic Bandits from Both a Distribution-Dependent and a Distribution-Free Viewpoints JMLR 2022
Saving Stochastic Bandits from Poisoning Attacks via Limited Data Verification AAAI 2022
On the Optimality of Batch Policy Optimization Algorithms ICML 2021
Fast Pure Exploration via Frank-Wolfe NIPS 2021
Corralling Stochastic Bandit Algorithms AISTATS 2021
Indexed Minimum Empirical Divergence for Unimodal Bandits NIPS 2021
Regret Bounds for Batched Bandits AAAI 2021
Stochastic Bandits with Graph Feedback in Non-Stationary Environments AAAI 2021
Observation-Free Attacks on Stochastic Bandits NIPS 2021
Adaptive Algorithms for Multi-armed Bandit with Composite and Anonymous Feedback AAAI 2021
Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Bandits JMLR 2021
An Algorithm for Stochastic and Adversarial Bandits with Switching Costs ICML 2021