← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Active Exploration in Markov Decision Processes AISTATS 2019
An Online Learning Approach to Model Predictive Control RSS 2019
A 2-Approximation Algorithm for the Online Tethered Coverage Problem RSS 2019
A Bandit Approach to Maximum Inner Product Search AAAI 2019
Online Control with Adversarial Disturbances ICML 2019
Target Tracking for Contextual Bandits: Application to Demand Side Management ICML 2019
Dynamic Learning with Frequent New Product Launches: A Sequential Multinomial Logit Bandit Problem ICML 2019
Competing Against Nash Equilibria in Adversarially Changing Zero-Sum Games ICML 2019
Learning Linear-Quadratic Regulators Efficiently with only $\sqrtT$ Regret ICML 2019
Online Learning with Sleeping Experts and Feedback Graphs ICML 2019
Submodular Cost Submodular Cover with an Approximate Oracle ICML 2019
Anytime Online-to-Batch, Optimism and Acceleration ICML 2019
Matrix-Free Preconditioning in Online Learning ICML 2019
Optimal Algorithms for Lipschitz Bandits with Heavy-tailed Rewards ICML 2019
Learning from Delayed Outcomes via Proxies with Applications to Recommender Systems ICML 2019
Multiplicative Weights Updates as a distributed constrained optimization algorithm: Convergence to second-order stationary points almost always ICML 2019
Learning to Clear the Market ICML 2019
Sublinear Space Private Algorithms Under the Sliding Window Model ICML 2019
Online Adaptive Principal Component Analysis and Its extensions ICML 2019
Adaptive Regret of Convex and Smooth Functions ICML 2019
Adaptive Monte Carlo Multiple Testing via Multi-Armed Bandits ICML 2019
Fully Dynamic Consistent Facility Location NIPS 2019
Online Convex Matrix Factorization with Representative Regions NIPS 2019
A New Perspective on Pool-Based Active Classification and False-Discovery Control NIPS 2019
Polynomial Cost of Adaptation for X-Armed Bandits NIPS 2019