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

Top-$k$ Combinatorial Bandits with Full-Bandit Feedback ALT 2020
Online Non-Convex Learning: Following the Perturbed Leader is Optimal ALT 2020
New Potential-Based Bounds for Prediction with Expert Advice COLT 2020
Learning by Repetition: Stochastic Multi-armed Bandits under Priming Effect UAI 2020
What You See May Not Be What You Get: UCB Bandit Algorithms Robust to $\varepsilon$-Contamination UAI 2020
Exploration Analysis in Finite-Horizon Turn-based Stochastic Games UAI 2020
Submodular Bandit Problem Under Multiple Constraints UAI 2020
Regret Analysis of Bandit Problems with Causal Background Knowledge UAI 2020
Analysis and Design of Thompson Sampling for Stochastic Partial Monitoring NIPS 2020
Learning to Play Sequential Games versus Unknown Opponents NIPS 2020
On Regret with Multiple Best Arms NIPS 2020
Simple and Fast Algorithm for Binary Integer and Online Linear Programming NIPS 2020
Exploiting the Surrogate Gap in Online Multiclass Classification NIPS 2020
Stage-wise Conservative Linear Bandits NIPS 2020
Restless-UCB, an Efficient and Low-complexity Algorithm for Online Restless Bandits NIPS 2020
A Bandit Learning Algorithm and Applications to Auction Design NIPS 2020
Locally Differentially Private (Contextual) Bandits Learning NIPS 2020
Temporal Variability in Implicit Online Learning NIPS 2020
Latent Bandits Revisited NIPS 2020
Old Dog Learns New Tricks: Randomized UCB for Bandit Problems AISTATS 2020
Robust Learning from Discriminative Feature Feedback AISTATS 2020
Group-Fair Online Allocation in Continuous Time NIPS 2020
A Single Recipe for Online Submodular Maximization with Adversarial or Stochastic Constraints NIPS 2020
Online Convex Optimization Over Erdos-Renyi Random Networks NIPS 2020
Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses NIPS 2020