Co-occurring keywords · papers mentioning both
Papers
Efficient Explorative Key-Term Selection Strategies for Conversational Contextual Bandits
AAAI 2023
Experiment Planning with Function Approximation
NeurIPS 2023
Federated Linear Contextual Bandits with User-level Differential Privacy
ICML 2023
Federated Neural Bandits
ICLR 2023
First- and Second-Order Bounds for Adversarial Linear Contextual Bandits
NeurIPS 2023
Flexible and Efficient Contextual Bandits with Heterogeneous Treatment Effect Oracles
AISTATS 2023
Follow-ups Also Matter: Improving Contextual Bandits via Post-serving Contexts
NeurIPS 2023
Heavy-tailed linear bandit with Huber regression
UAI 2023
High-dimensional Contextual Bandit Problem without Sparsity
NeurIPS 2023
Improved Algorithms for Multi-period Multi-class Packing Problems with Bandit Feedback
ICML 2023
Individually Fair Learning with One-Sided Feedback
ICML 2023
Infinite Action Contextual Bandits with Reusable Data Exhaust
ICML 2023
Learning Kernelized Contextual Bandits in a Distributed and Asynchronous Environment
ICLR 2023
Marginal Density Ratio for Off-Policy Evaluation in Contextual Bandits
NeurIPS 2023
Meta-Learning with Neural Bandit Scheduler
NeurIPS 2023
Mixed-Effect Thompson Sampling
AISTATS 2023
Multi-Agent Learning with Heterogeneous Linear Contextual Bandits
NeurIPS 2023
Nearest Neighbour with Bandit Feedback
NeurIPS 2023
Noise-Adaptive Thompson Sampling for Linear Contextual Bandits
NeurIPS 2023
Nonstochastic Contextual Combinatorial Bandits
AISTATS 2023
Off-Policy Evaluation for Large Action Spaces via Conjunct Effect Modeling
ICML 2023
Online Clustering of Bandits with Misspecified User Models
NeurIPS 2023
On the Interplay Between Misspecification and Sub-optimality Gap in Linear Contextual Bandits
ICML 2023
Optimal Contextual Bandits with Knapsacks under Realizability via Regression Oracles
AISTATS 2023
Optimal cross-learning for contextual bandits with unknown context distributions
NeurIPS 2023