Online Algorithms

Tracking the Best Expert in Non-stationary Stochastic Environments NeurIPS 2016 A Chaining Algorithm for Online Nonparametric Regression COLT 2015 Algorithms with Logarithmic or Sublinear Regret for Constrained Contextual Bandits NeurIPS 2015 An Online Learning Algorithm for Bilinear Models ICML 2015 Bandit Convex Optimization: \sqrtT Regret in One Dimension COLT 2015 Bandit Smooth Convex Optimization: Improving the Bias-Variance Tradeoff NeurIPS 2015 Bandits with Unobserved Confounders: A Causal Approach NeurIPS 2015 Combinatorial Bandits Revisited NeurIPS 2015 Combinatorial Cascading Bandits NeurIPS 2015 Copeland Dueling Bandits NeurIPS 2015 Cornering Stationary and Restless Mixing Bandits with Remix-UCB NeurIPS 2015 Exp-Concavity of Proper Composite Losses COLT 2015 Explore no more: Improved high-probability regret bounds for non-stochastic bandits NeurIPS 2015 Fighting Bandits with a New Kind of Smoothness NeurIPS 2015 Global Multi-armed Bandits with Hölder Continuity AISTATS 2015 Label optimal regret bounds for online local learning COLT 2015 Linear Multi-Resource Allocation with Semi-Bandit Feedback NeurIPS 2015 Minimax Fixed-Design Linear Regression COLT 2015 Non-Asymptotic Analysis of a New Bandit Algorithm for Semi-Bounded Rewards JMLR 2015 Online F-Measure Optimization NeurIPS 2015 Online Gradient Boosting NeurIPS 2015 Online Learning for Adversaries with Memory: Price of Past Mistakes NeurIPS 2015 Online Learning with Adversarial Delays NeurIPS 2015 Online Learning with Feedback Graphs: Beyond Bandits COLT 2015 Online Rank Elicitation for Plackett-Luce: A Dueling Bandits Approach NeurIPS 2015