Co-occurring keywords · papers mentioning both
Papers
Generalized Policy Elimination: an efficient algorithm for Nonparametric Contextual Bandits
UAI 2020
Information Directed Sampling for Linear Partial Monitoring
COLT 2020
Kernel Methods for Cooperative Multi-Agent Contextual Bandits
ICML 2020
Latent Bandits Revisited
NeurIPS 2020
Learning to Group: A Bottom-Up Framework for 3D Part Discovery in Unseen Categories
ICLR 2020
Linear bandits with Stochastic Delayed Feedback
ICML 2020
Locally Differentially Private (Contextual) Bandits Learning
NeurIPS 2020
Model Selection in Contextual Stochastic Bandit Problems
NeurIPS 2020
Multi-Feedback Bandit Learning with Probabilistic Contexts
IJCAI 2020
Neural Contextual Bandits with UCB-based Exploration
ICML 2020
Online Algorithm for Unsupervised Sequential Selection with Contextual Information
NeurIPS 2020
Online Evaluation of Audiences for Targeted Advertising via Bandit Experiments
AAAI 2020
Online Learning in Contextual Bandits using Gated Linear Networks
NeurIPS 2020
Online Portfolio Selection with Cardinality Constraint and Transaction Costs based on Contextual Bandit
IJCAI 2020
Open Problem: Model Selection for Contextual Bandits
COLT 2020
Rationally Inattentive Inverse Reinforcement Learning Explains YouTube Commenting Behavior
JMLR 2020
Root-n-Regret for Learning in Markov Decision Processes with Function Approximation and Low Bellman Rank
COLT 2020
Smooth Contextual Bandits: Bridging the Parametric and Non-differentiable Regret Regimes
COLT 2020
Stochastic Linear Contextual Bandits with Diverse Contexts
AISTATS 2020
Stochastic Neural Network with Kronecker Flow
AISTATS 2020
Structured Linear Contextual Bandits: A Sharp and Geometric Smoothed Analysis
ICML 2020
Sublinear Optimal Policy Value Estimation in Contextual Bandits
AISTATS 2020
Taking a hint: How to leverage loss predictors in contextual bandits?
COLT 2020
Thompson Sampling via Local Uncertainty
ICML 2020
Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information
COLT 2019