Co-occurring keywords · papers mentioning both
Papers
Gain estimation of linear dynamical systems using Thompson Sampling
AISTATS 2019
Garbage In, Reward Out: Bootstrapping Exploration in Multi-Armed Bandits
ICML 2019
General Robustness Evaluation of Incentive Mechanism against Bounded Rationality Using Continuum-Armed Bandits
AAAI 2019
Improved Algorithm on Online Clustering of Bandits
IJCAI 2019
Improved Path-length Regret Bounds for Bandits
COLT 2019
Improved Regret Bounds for Bandit Combinatorial Optimization
NeurIPS 2019
Incorporating Behavioral Constraints in Online AI Systems
AAAI 2019
Individual Regret in Cooperative Nonstochastic Multi-Armed Bandits
NeurIPS 2019
Leveraging Observations in Bandits: Between Risks and Benefits
AAAI 2019
Linear Stochastic Bandits Under Safety Constraints
NeurIPS 2019
Machine Teaching of Active Sequential Learners
NeurIPS 2019
Making the Cut: A Bandit-based Approach to Tiered Interviewing
NeurIPS 2019
MaxGap Bandit: Adaptive Algorithms for Approximate Ranking
NeurIPS 2019
Multi-armed Bandit Problems with Strategic Arms
COLT 2019
Multi-scale Online Learning: Theory and Applications to Online Auctions and Pricing
JMLR 2019
Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits
COLT 2019
Nearly Optimal Adaptive Procedure with Change Detection for Piecewise-Stationary Bandit
AISTATS 2019
Non-Asymptotic Pure Exploration by Solving Games
NeurIPS 2019
Nonparametric Contextual Bandits in Metric Spaces with Unknown Metric
NeurIPS 2019
Nonstochastic Multiarmed Bandits with Unrestricted Delays
NeurIPS 2019
Online EXP3 Learning in Adversarial Bandits with Delayed Feedback
NeurIPS 2019
Online Learning via the Differential Privacy Lens
NeurIPS 2019
Online learning with feedback graphs and switching costs
AISTATS 2019
Online Pandora’s Boxes and Bandits
AAAI 2019
On the Design of Estimators for Bandit Off-Policy Evaluation
ICML 2019