← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

803 directly classified papers

Papers per year

Papers

Efficient Regret Minimization in Non-Convex Games ICML 2017
Playing Repeated Network Interdiction Games with Semi-Bandit Feedback IJCAI 2017
Online Learning with Local Permutations and Delayed Feedback ICML 2017
Identifying Best Interventions through Online Importance Sampling ICML 2017
Second-Order Kernel Online Convex Optimization with Adaptive Sketching ICML 2017
Near-Optimal Design of Experiments via Regret Minimization ICML 2017
Follow the Compressed Leader: Faster Online Learning of Eigenvectors and Faster MMWU ICML 2017
A survey of Algorithms and Analysis for Adaptive Online Learning JMLR 2017
Fast rates for online learning in Linearly Solvable Markov Decision Processes COLT 2017
Online Bayesian Passive-Aggressive Learning JMLR 2017
Consistent k-Clustering ICML 2017
Multi-Objective Non-parametric Sequential Prediction NIPS 2017
Projection-free Distributed Online Learning in Networks ICML 2017
Improved Dynamic Regret for Non-degenerate Functions NIPS 2017
Minimizing Regret on Reflexive Banach Spaces and Nash Equilibria in Continuous Zero-Sum Games NIPS 2016
Online Learning with Noisy Side Observations AISTATS 2016
Simple Bayesian Algorithms for Best Arm Identification COLT 2016
On the capacity of information processing systems COLT 2016
Online Learning with Low Rank Experts COLT 2016
Gains and Losses are Fundamentally Different in Regret Minimization: The Sparse Case JMLR 2016
Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms JMLR 2016
Maximin Action Identification: A New Bandit Framework for Games COLT 2016
Efficient Algorithms for Adversarial Contextual Learning ICML 2016
Tracking Slowly Moving Clairvoyant: Optimal Dynamic Regret of Online Learning with True and Noisy Gradient ICML 2016
Conservative Bandits ICML 2016