regret bound

Relative Upper Confidence Bound for the K-Armed Dueling Bandit Problem ICML 2014 Repeated Contextual Auctions with Strategic Buyers NeurIPS 2014 Resourceful Contextual Bandits COLT 2014 Robust Multi-objective Learning with Mentor Feedback COLT 2014 Skip Context Tree Switching ICML 2014 Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards NeurIPS 2014 Surrogate Regret Bounds for Bipartite Ranking via Strongly Proper Losses JMLR 2014 Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits ICML 2014 The Blinded Bandit: Learning with Adaptive Feedback NeurIPS 2014 Thompson Sampling for Complex Online Problems ICML 2014 Towards Minimax Online Learning with Unknown Time Horizon ICML 2014 Tracking Adversarial Targets ICML 2014 Unconstrained Online Linear Learning in Hilbert Spaces: Minimax Algorithms and Normal Approximations COLT 2014 Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms ICML 2014 Adaptive Market Making via Online Learning NeurIPS 2013 Adaptive Submodular Maximization in Bandit Setting NeurIPS 2013 Aggregating Optimistic Planning Trees for Solving Markov Decision Processes NeurIPS 2013 A Last-Step Regression Algorithm for Non-Stationary Online Learning AISTATS 2013 Almost Optimal Exploration in Multi-Armed Bandits ICML 2013 A near-optimal algorithm for finite partial-monitoring games against adversarial opponents COLT 2013 A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret COLT 2013 Beating Bandits in Gradually Evolving Worlds COLT 2013 Bounded regret in stochastic multi-armed bandits COLT 2013 Combinatorial Multi-Armed Bandit: General Framework and Applications ICML 2013 Competing with an Infinite Set of Models in Reinforcement Learning AISTATS 2013