← Learning Types
Machine Learning › Learning Types ›

Exploration-Exploitation

154 directly classified papers

Papers per year

Papers

Optimal Best-arm Identification in Linear Bandits NIPS 2020
Finite-Time Analysis of Round-Robin Kullback-Leibler Upper Confidence Bounds for Optimal Adaptive Allocation with Multiple Plays and Markovian Rewards NIPS 2020
Hindsight Credit Assignment NIPS 2019
Explicit Explore-Exploit Algorithms in Continuous State Spaces NIPS 2019
Linear Stochastic Bandits Under Safety Constraints NIPS 2019
Nonstochastic Multiarmed Bandits with Unrestricted Delays NIPS 2019
Information-Theoretic Confidence Bounds for Reinforcement Learning NIPS 2019
Model Selection for Contextual Bandits NIPS 2019
Are sample means in multi-armed bandits positively or negatively biased? NIPS 2019
Contextual Bandits with Cross-Learning NIPS 2019
Blocking Bandits NIPS 2019
Thresholding Bandit with Optimal Aggregate Regret NIPS 2019
MaxGap Bandit: Adaptive Algorithms for Approximate Ranking NIPS 2019
Stochastic Bandits with Context Distributions NIPS 2019
Nonparametric Contextual Bandits in Metric Spaces with Unknown Metric NIPS 2019
On the Optimality of Perturbations in Stochastic and Adversarial Multi-armed Bandit Problems NIPS 2019
Exploration Bonus for Regret Minimization in Discrete and Continuous Average Reward MDPs NIPS 2019
Epsilon-Best-Arm Identification in Pay-Per-Reward Multi-Armed Bandits NIPS 2019
Dueling Bandits with Qualitative Feedback AAAI 2019
Policy Optimization with Model-Based Explorations AAAI 2019
Balanced Linear Contextual Bandits AAAI 2019
Dynamic Learning of Sequential Choice Bandit Problem under Marketing Fatigue AAAI 2019
Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games AAAI 2019
Community Exploration: From Offline Optimization to Online Learning NIPS 2018
Differentially Private Contextual Linear Bandits NIPS 2018