conftrace_

sublinear regret

88 papers

Explore in graph

Co-occurring keywords

regret bound (1926) online learning (1777) multi-armed bandit (1098) contextual bandit (381) bayesian optimization (624) online algorithm (445) gaussian process (1200) reinforcement learning (4352) upper confidence bound (197) online convex optimization (165)

Papers

Adaptive Feature Selection: Computationally Efficient Online Sparse Linear Regression under RIP ICML 2017
Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation NIPS 2017
Online Optimization of Smoothed Piecewise Constant Functions AISTATS 2017
Playing Repeated Network Interdiction Games with Semi-Bandit Feedback IJCAI 2017
On Thompson Sampling and Asymptotic Optimality IJCAI 2017
Efficient Algorithms for Adversarial Contextual Learning ICML 2016
No-Regret Algorithms for Heavy-Tailed Linear Bandits ICML 2016
Safe Policy Search for Lifelong Reinforcement Learning with Sublinear Regret ICML 2015
Exploiting easy data in online optimization NIPS 2014
Repeated Contextual Auctions with Strategic Buyers NIPS 2014
Open Problem: Efficient Online Sparse Regression COLT 2014
Online and Stochastic Gradient Methods for Non-decomposable Loss Functions NIPS 2014
Sequential Bayesian Search ICML 2013