Co-occurring keywords · papers mentioning both
Papers
Instance-Dependent Complexity of Contextual Bandits and Reinforcement Learning: A Disagreement-Based Perspective
COLT 2021
Is Reinforcement Learning More Difficult Than Bandits? A Near-optimal Algorithm Escaping the Curse of Horizon
COLT 2021
Leveraging Good Representations in Linear Contextual Bandits
ICML 2021
Meta-Learning Effective Exploration Strategies for Contextual Bandits
AAAI 2021
Multinomial Logit Contextual Bandits: Provable Optimality and Practicality
AAAI 2021
Neural Thompson Sampling
ICLR 2021
Non-Stationary Off-Policy Optimization
AISTATS 2021
Offline Contextual Bandits with Overparameterized Models
ICML 2021
Off-Policy Confidence Sequences
ICML 2021
Off-Policy Risk Assessment in Contextual Bandits
NeurIPS 2021
Online Limited Memory Neural-Linear Bandits with Likelihood Matching
ICML 2021
Optimal Algorithms for Stochastic Contextual Preference Bandits
NeurIPS 2021
Parallelizing Thompson Sampling
NeurIPS 2021
Post-Contextual-Bandit Inference
NeurIPS 2021
Power Constrained Bandits
MLHC 2021
Relational Boosted Bandits
AAAI 2021
Risk Minimization from Adaptively Collected Data: Guarantees for Supervised and Policy Learning
NeurIPS 2021
Robust Bandit Learning with Imperfect Context
AAAI 2021
Robust Contextual Bandits via Bootstrapping
AAAI 2021
Self-Concordant Analysis of Generalized Linear Bandits with Forgetting
AISTATS 2021
Self-Tuning Bandits over Unknown Covariate-Shifts
ALT 2021
Sparsity-Agnostic Lasso Bandit
ICML 2021
Speaker Diarization as a Fully Online Bandit Learning Problem in MiniVox
ACML 2021
The Pareto Frontier of model selection for general Contextual Bandits
NeurIPS 2021
Thompson Sampling for Bandits with Clustered Arms
IJCAI 2021