conftrace_

regret bound

1926 papers

Explore in graph

Also known as

RB

Co-occurring keywords

online learning (1777) multi-armed bandit (1098) contextual bandit (381) stochastic optimization (1060) reinforcement learning (4352) online algorithm (445) upper confidence bound (197) markov decision process (790) thompson sampling (237) online convex optimization (165)

Papers

Online EXP3 Learning in Adversarial Bandits with Delayed Feedback NIPS 2019
Online Learning via the Differential Privacy Lens NIPS 2019
Improved Regret Bounds for Bandit Combinatorial Optimization NIPS 2019
Polynomial Cost of Adaptation for X-Armed Bandits NIPS 2019
Efficient online learning with kernels for adversarial large scale problems NIPS 2019
Thresholding Bandit with Optimal Aggregate Regret NIPS 2019
Phase Transitions and Cyclic Phenomena in Bandits with Switching Constraints NIPS 2019
Batched Multi-armed Bandits Problem NIPS 2019
Model-Based Reinforcement Learning Exploiting State-Action Equivalence ACML 2019
BubbleRank: Safe Online Learning to Re-Rank via Implicit Click Feedback UAI 2019
A Flexible Framework for Multi-Objective Bayesian Optimization using Random Scalarizations UAI 2019
On First-Order Bounds, Variance and Gap-Dependent Bounds for Adversarial Bandits UAI 2019
Adaptively Tracking the Best Bandit Arm with an Unknown Number of Distribution Changes COLT 2019
Multi-armed Bandit Problems with Strategic Arms COLT 2019
Improved Path-length Regret Bounds for Bandits COLT 2019
Better Algorithms for Stochastic Bandits with Adversarial Corruptions COLT 2019
Bandit Principal Component Analysis COLT 2019
Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits COLT 2019
Batch-Size Independent Regret Bounds for the Combinatorial Multi-Armed Bandit Problem COLT 2019
Open Problem: Risk of Ruin in Multiarmed Bandits COLT 2019
Differentially Private Online Submodular Minimization AISTATS 2019
Exponential Weights on the Hypercube in Polynomial Time AISTATS 2019
Consistent Online Optimization: Convex and Submodular AISTATS 2019
Online learning with feedback graphs and switching costs AISTATS 2019
Rotting bandits are no harder than stochastic ones AISTATS 2019