Skip to content
conftrace_

multi-armed bandit

1,217 papers

MABS MAB

Papers

Boltzmann Exploration Done Right NeurIPS 2017 Boundary Crossing for General Exponential Families ALT 2017 Context Attentive Bandits: Contextual Bandit with Restricted Context IJCAI 2017 Coordinated Versus Decentralized Exploration In Multi-Agent Multi-Armed Bandits IJCAI 2017 Corralling a Band of Bandit Algorithms COLT 2017 Counterfactual Data-Fusion for Online Reinforcement Learners ICML 2017 Crowd Learning: Improving Online Decision Making Using Crowdsourced Data IJCAI 2017 Efficient Benchmarking of NLP APIs using Multi-armed Bandits EACL 2017 Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe NeurIPS 2017 Horde of Bandits using Gaussian Markov Random Fields AISTATS 2017 Identifying Best Interventions through Online Importance Sampling ICML 2017 Identifying Outlier Arms in Multi-Armed Bandit NeurIPS 2017 Identify the Nash Equilibrium in Static Games with Random Payoffs ICML 2017 Improving Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms and Its Applications NeurIPS 2017 Interactive Submodular Bandit NeurIPS 2017 Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons COLT 2017 Lower Bounds on Regret for Noisy Gaussian Process Bandit Optimization COLT 2017 Multi-Armed Bandits with Metric Movement Costs NeurIPS 2017 Multi-objective Bandits: Optimizing the Generalized Gini Index ICML 2017 Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection AISTATS 2017 Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration COLT 2017 On Context-Dependent Clustering of Bandits ICML 2017 On Kernelized Multi-armed Bandits ICML 2017 Online Algorithm Selection IJCAI 2017 Online Learning to Rank in Stochastic Click Models ICML 2017