Co-occurring keywords · papers mentioning both
Papers
Robustness Guarantees for Mode Estimation with an Application to Bandits
AAAI 2021
Selective Sampling for Online Best-arm Identification
NeurIPS 2021
Simple combinatorial algorithms for combinatorial bandits: corruptions and approximations
UAI 2021
Stochastic bandits with groups of similar arms.
NeurIPS 2021
Stochastic Bandits with Linear Constraints
AISTATS 2021
Stochastic Multi-Armed Bandits with Control Variates
NeurIPS 2021
Stochastic Multi-Armed Bandits with Unrestricted Delay Distributions
ICML 2021
The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle
NeurIPS 2021
Thompson Sampling for Bandits with Clustered Arms
IJCAI 2021
Training a Single Bandit Arm
AISTATS 2021
Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Bandits
JMLR 2021
Tuning Mixed Input Hyperparameters on the Fly for Efficient Population Based AutoRL
NeurIPS 2021
UCB-based Algorithms for Multinomial Logistic Regression Bandits
NeurIPS 2021
Understanding Bandits with Graph Feedback
NeurIPS 2021
Unifying Clustered and Non-stationary Bandits
AISTATS 2021
Variance-dependent best arm identification
UAI 2021
Variational Bayesian Optimistic Sampling
NeurIPS 2021
A Bandit Learning Algorithm and Applications to Auction Design
NeurIPS 2020
Achieving Fairness in the Stochastic Multi-Armed Bandit Problem
AAAI 2020
A Closer Look at Small-loss Bounds for Bandits with Graph Feedback
COLT 2020
Adaptive Double-Exploration Tradeoff for Outlier Detection
AAAI 2020
Adaptive Learning of Rank-One Models for Efficient Pairwise Sequence Alignment
NeurIPS 2020
Adversarial Blocking Bandits
NeurIPS 2020
A Farewell to Arms: Sequential Reward Maximization on a Budget with a Giving Up Option
AISTATS 2020
Agbots 2.0: Weeding Denser Fields with Fewer Robots
RSS 2020