Online Algorithms

Efficient Benchmarking of NLP APIs using Multi-armed Bandits EACL 2017 Efficient Online Bandit Multiclass Learning with Õ(√T) Regret ICML 2017 Efficient Online Linear Optimization with Approximation Algorithms NeurIPS 2017 Efficient Regret Minimization in Non-Convex Games ICML 2017 Efficient Second-Order Online Kernel Learning with Adaptive Embedding NeurIPS 2017 Efficient tracking of a growing number of experts ALT 2017 Fast rates for online learning in Linearly Solvable Markov Decision Processes COLT 2017 Follow the Compressed Leader: Faster Online Learning of Eigenvectors and Faster MMWU ICML 2017 Heuristic Online Goal Recognition in Continuous Domains IJCAI 2017 Identifying Best Interventions through Online Importance Sampling ICML 2017 Identifying Outlier Arms in Multi-Armed Bandit NeurIPS 2017 Identify the Nash Equilibrium in Static Games with Random Payoffs ICML 2017 Improved Dynamic Regret for Non-degenerate Functions NeurIPS 2017 Improved Strongly Adaptive Online Learning using Coin Betting AISTATS 2017 Learning Linear Dynamical Systems via Spectral Filtering NeurIPS 2017 Multi-Objective Non-parametric Sequential Prediction NeurIPS 2017 Near-Optimal Design of Experiments via Regret Minimization ICML 2017 Online Bayesian Passive-Aggressive Learning JMLR 2017 Online Learning and Blackwell Approachability with Partial Monitoring: Optimal Convergence Rates AISTATS 2017 Online Learning for Multivariate Hawkes Processes NeurIPS 2017 Online Learning of Task-specific Word Representations with a Joint Biconvex Passive-Aggressive Algorithm EACL 2017 Online Learning to Rank in Stochastic Click Models ICML 2017 Online Learning to Rank with Top-k Feedback JMLR 2017 Online Learning with Local Permutations and Delayed Feedback ICML 2017 Online multiclass boosting NeurIPS 2017