Online Algorithms

Logarithmic Time One-Against-Some ICML 2017 Maxing and Ranking with Few Assumptions NeurIPS 2017 Minimal Exploration in Structured Stochastic Bandits NeurIPS 2017 Multi-Armed Bandits with Metric Movement Costs NeurIPS 2017 Multi-objective Bandits: Optimizing the Generalized Gini Index ICML 2017 Multi-Objective Non-parametric Sequential Prediction NeurIPS 2017 Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration COLT 2017 Near Minimax Optimal Players for the Finite-Time 3-Expert Prediction Problem NeurIPS 2017 New bounds on the price of bandit feedback for mistake-bounded online multiclass learning ALT 2017 Nonparametric Online Regression while Learning the Metric NeurIPS 2017 No Time to Observe: Adaptive Influence Maximization with Partial Feedback IJCAI 2017 Online Algorithm Selection IJCAI 2017 Online Bayesian Passive-Aggressive Learning JMLR 2017 Online Bridged Pruning for Real-Time Search with Arbitrary Lookaheads IJCAI 2017 Online Convex Optimization with Stochastic Constraints NeurIPS 2017 Online Dynamic Programming NeurIPS 2017 Online Influence Maximization under Independent Cascade Model with Semi-Bandit Feedback NeurIPS 2017 Online Learning of Optimal Bidding Strategy in Repeated Multi-Commodity Auctions NeurIPS 2017 Online Learning with a Hint NeurIPS 2017 Online Learning with Local Permutations and Delayed Feedback ICML 2017 Online Learning Without Prior Information COLT 2017 Online Learning with Transductive Regret NeurIPS 2017 Online Optimization of Smoothed Piecewise Constant Functions AISTATS 2017 Online Optimization of Video-Ad Allocation IJCAI 2017 Online Prediction with Selfish Experts NeurIPS 2017