← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

803 directly classified papers

Papers per year

Papers

Bandits with Delayed, Aggregated Anonymous Feedback ICML 2018
SAFFRON: an Adaptive Algorithm for Online Control of the False Discovery Rate ICML 2018
Dynamic Regret of Strongly Adaptive Methods ICML 2018
Interactive Algorithms: Pool, Stream and Precognitive Stream JMLR 2018
Adaptive Online Learning in Dynamic Environments NIPS 2018
Online Learning of Combinatorial Objects via Extended Formulation ALT 2018
Reward Maximization Under Uncertainty: Leveraging Side-Observations on Networks JMLR 2018
Adversarial Attacks on Stochastic Bandits NIPS 2018
Online Improper Learning with an Approximation Oracle NIPS 2018
More Adaptive Algorithms for Adversarial Bandits COLT 2018
A General Approach to Multi-Armed Bandits Under Risk Criteria COLT 2018
Nonstochastic Bandits with Composite Anonymous Feedback COLT 2018
Distributed Multi-Player Bandits - a Game of Thrones Approach NIPS 2018
Meta-Level Control of Anytime Algorithms with Online Performance Prediction IJCAI 2018
Online Pricing for Revenue Maximization with Unknown Time Discounting Valuations IJCAI 2018
An Optimal Learning Algorithm for Online Unconstrained Submodular Maximization COLT 2018
Online Learning: Sufficient Statistics and the Burkholder Method COLT 2018
The Many Faces of Exponential Weights in Online Learning COLT 2018
Efficient Contextual Bandits in Non-stationary Worlds COLT 2018
Advancements in Dueling Bandits IJCAI 2018
Cost-aware Cascading Bandits IJCAI 2018
Streaming Principal Component Analysis in Noisy Setting ICML 2018
Practical Contextual Bandits with Regression Oracles ICML 2018
Online Kernel Selection via Incremental Sketched Kernel Alignment IJCAI 2018
Bandit Online Learning on Graphs via Adaptive Optimization IJCAI 2018