← Learning Types
Machine Learning › Learning Types ›

Multi-Armed Bandits

1044 directly classified papers

Papers per year

Papers

A Drifting-Games Analysis for Online Learning and Applications to Boosting NIPS 2014
Learning Multiple Tasks in Parallel with a Shared Annotator NIPS 2014
Sequential crowdsourced labeling as an epsilon-greedy exploration in a Markov Decision Process AISTATS 2014
Optimality of Thompson Sampling for Gaussian Bandits Depends on Priors AISTATS 2014
On correlation and budget constraints in model-based bandit optimization with application to automatic machine learning AISTATS 2014
Resourceful Contextual Bandits COLT 2014
lil’ UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits COLT 2014
Finding a most biased coin with fewest flips COLT 2014
Open Problem: Shifting Experts on Easy Data COLT 2014
Adaptive Monte Carlo via Bandit Allocation ICML 2014
Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits ICML 2014
Combinatorial Partial Monitoring Game with Linear Feedback and Its Applications ICML 2014
Reducing Dueling Bandits to Cardinal Bandits ICML 2014
Prediction with Limited Advice and Multiarmed Bandits with Paid Observations ICML 2014
Thompson Sampling for Complex Online Problems ICML 2014
Combinatorial Pure Exploration of Multi-Armed Bandits NIPS 2014
Online Decision-Making in General Combinatorial Spaces NIPS 2014
Discovering, Learning and Exploiting Relevance NIPS 2014
Multiarmed Bandits With Limited Expert Advice COLT 2014
Bounded Regret for Finite-Armed Structured Bandits NIPS 2014
Best-Arm Identification in Linear Bandits NIPS 2014
Bandit Convex Optimization: Towards Tight Bounds NIPS 2014
Repeated Contextual Auctions with Strategic Buyers NIPS 2014
Optimal Regret Minimization in Posted-Price Auctions with Strategic Buyers NIPS 2014
Predictive Entropy Search for Efficient Global Optimization of Black-box Functions NIPS 2014