Online Algorithms

HONES: A Fast and Tuning-free Homotopy Method For Online Newton Step AISTATS 2018 Interactive Algorithms: Pool, Stream and Precognitive Stream JMLR 2018 Let’s be Honest: An Optimal No-Regret Framework for Zero-Sum Games ICML 2018 Meta-Level Control of Anytime Algorithms with Online Performance Prediction IJCAI 2018 More Adaptive Algorithms for Adversarial Bandits COLT 2018 Nonstochastic Bandits with Composite Anonymous Feedback COLT 2018 Normal Bandits of Unknown Means and Variances JMLR 2018 Not-So-Random Features ICLR 2018 Online Improper Learning with an Approximation Oracle NeurIPS 2018 Online Kernel Selection via Incremental Sketched Kernel Alignment IJCAI 2018 Online Learning of Combinatorial Objects via Extended Formulation ALT 2018 Online Learning: Sufficient Statistics and the Burkholder Method COLT 2018 Online Learning with Abstention ICML 2018 Online Pricing for Revenue Maximization with Unknown Time Discounting Valuations IJCAI 2018 Practical Contextual Bandits with Regression Oracles ICML 2018 Profitable Bandits ACML 2018 Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity ICML 2018 Reward Maximization Under Uncertainty: Leveraging Side-Observations on Networks JMLR 2018 SAFFRON: an Adaptive Algorithm for Online Control of the False Discovery Rate ICML 2018 Small-loss bounds for online learning with partial information COLT 2018 Streaming Principal Component Analysis in Noisy Setting ICML 2018 The Many Faces of Exponential Weights in Online Learning COLT 2018 A survey of Algorithms and Analysis for Adaptive Online Learning JMLR 2017 Consistent k-Clustering ICML 2017 Dueling Bandits with Weak Regret ICML 2017