regret bound

Follow the Leader with Dropout Perturbations COLT 2014 Higher-Order Regret Bounds with Switching Costs COLT 2014 Improved Bounds for Online Learning Over the Permutahedron and Other Ranking Polytopes AISTATS 2014 Latent Bandits. ICML 2014 Learning the Learning Rate for Prediction with Expert Advice NeurIPS 2014 Learning to Optimize via Information-Directed Sampling NeurIPS 2014 Model-based Reinforcement Learning and the Eluder Dimension NeurIPS 2014 Multiarmed Bandits With Limited Expert Advice COLT 2014 (Near) Dimension Independent Risk Bounds for Differentially Private Learning ICML 2014 Near-optimal Reinforcement Learning in Factored MDPs NeurIPS 2014 One Practical Algorithm for Both Stochastic and Adversarial Bandits ICML 2014 Online and Stochastic Gradient Methods for Non-decomposable Loss Functions NeurIPS 2014 Online combinatorial optimization with stochastic decision sets and adversarial losses NeurIPS 2014 Online Decision-Making in General Combinatorial Spaces NeurIPS 2014 Online Learning in Markov Decision Processes with Changing Cost Sequences ICML 2014 Online Linear Optimization via Smoothing COLT 2014 Online Passive-Aggressive Algorithms for Non-Negative Matrix Factorization and Completion AISTATS 2014 Online Stochastic Optimization under Correlated Bandit Feedback ICML 2014 On Multilabel Classification and Ranking with Bandit Feedback JMLR 2014 On the Bayes-Optimality of F-Measure Maximizers JMLR 2014 Open Problem: Shifting Experts on Easy Data COLT 2014 Optimality of Thompson Sampling for Gaussian Bandits Depends on Priors AISTATS 2014 Parallelizing Exploration-Exploitation Tradeoffs in Gaussian Process Bandit Optimization JMLR 2014 Prediction with Limited Advice and Multiarmed Bandits with Paid Observations ICML 2014 Reducing Dueling Bandits to Cardinal Bandits ICML 2014