conftrace_

arm selection

28 papers

Explore in graph

Co-occurring keywords

multi-armed bandit (1098) regret bound (1926) thresholding bandit (9) sample complexity (1169) stochastic optimization (1060) best arm identification (85) online learning (1777) online algorithm (445) linear bandit (124) stochastic bandit (98)

Papers

Model-Based Best Arm Identification for Decreasing Bandits AISTATS 2024
Networked Restless Bandits with Positive Externalities AAAI 2023
Multi-Fidelity Multi-Armed Bandits Revisited NIPS 2023
Doubly Adversarial Federated Bandits ICML 2023
Posterior Tracking Algorithm for Classification Bandits AISTATS 2023
Stochastic Rising Bandits ICML 2022
Max-Utility Based Arm Selection Strategy For Sequential Query Recommendations ACML 2021
Problem Dependent View on Structured Thresholding Bandit Problems ICML 2021
A/B/n Testing with Control in the Presence of Subpopulations NIPS 2021
Thresholding Graph Bandits with GrAPL AISTATS 2020
Preselection Bandits ICML 2020
The Influence of Shape Constraints on the Thresholding Bandit Problem COLT 2020
Adversarial Attacks on Linear Contextual Bandits NIPS 2020
The True Sample Complexity of Identifying Good Arms AISTATS 2020
Semi-Parametric Sampling for Stochastic Bandits with Many Arms AAAI 2019
Exploring $k$ out of Top $ρ$ Fraction of Arms in Stochastic Bandits AISTATS 2019
Thresholding Bandit with Optimal Aggregate Regret NIPS 2019
Epsilon-Best-Arm Identification in Pay-Per-Reward Multi-Armed Bandits NIPS 2019
Causal Bandits with Propagating Inference ICML 2018
A fully adaptive algorithm for pure exploration in linear bandits AISTATS 2018
Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection AISTATS 2017
Thresholding Bandits with Augmented UCB IJCAI 2017
Scalable Generalized Linear Bandits: Online Computation and Hashing NIPS 2017
Sparse Stochastic Bandits COLT 2017
Best-Arm Identification in Linear Bandits NIPS 2014