regret bound

Semi-Parametric Sampling for Stochastic Bandits with Many Arms AAAI 2019 SIC-MMAB: Synchronisation Involves Communication in Multiplayer Multi-Armed Bandits NeurIPS 2019 Stay With Me: Lifetime Maximization Through Heteroscedastic Linear Bandits With Reneging ICML 2019 Stochastic Bandits with Context Distributions NeurIPS 2019 Structured Robust Submodular Maximization: Offline and Online Algorithms AISTATS 2019 Target Tracking for Contextual Bandits: Application to Demand Side Management ICML 2019 Thompson Sampling and Approximate Inference NeurIPS 2019 Thompson Sampling for Multinomial Logit Contextual Bandits NeurIPS 2019 Thompson Sampling on Symmetric Alpha-Stable Bandits IJCAI 2019 Thresholding Bandit with Optimal Aggregate Regret NeurIPS 2019 Tighter Problem-Dependent Regret Bounds in Reinforcement Learning without Domain Knowledge using Value Function Bounds ICML 2019 Tight Regret Bounds for Model-Based Reinforcement Learning with Greedy Policies NeurIPS 2019 Top Feasible Arm Identification AISTATS 2019 Uniform regret bounds over R^d for the sequential linear regression problem with the square loss ALT 2019 Unifying the Stochastic and the Adversarial Bandits with Knapsack IJCAI 2019 User-Specified Local Differential Privacy in Unconstrained Adaptive Online Learning NeurIPS 2019 Variational Regret Bounds for Reinforcement Learning UAI 2019 Worst-Case Regret Bounds for Exploration via Randomized Value Functions NeurIPS 2019 XNAS: Neural Architecture Search with Expert Advice NeurIPS 2019 A Better Resource Allocation Algorithm with Semi-Bandit Feedback ALT 2018 Adaptation to Easy Data in Prediction with Limited Advice NeurIPS 2018 Adaptive Exploration-Exploitation Tradeoff for Opportunistic Bandits ICML 2018 Adaptive Learning with Unknown Information Flows NeurIPS 2018 Advancements in Dueling Bandits IJCAI 2018 Almost Optimal Algorithms for Linear Stochastic Bandits with Heavy-Tailed Payoffs NeurIPS 2018