← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

803 directly classified papers

Papers per year

Papers

Adversarial Dueling Bandits ICML 2021
Dueling Bandits with Team Comparisons NIPS 2021
Differentially Private Online Submodular Maximization AISTATS 2021
Bandits with many optimal arms NIPS 2021
Robust Bandit Learning with Imperfect Context AAAI 2021
Online Learning with Primary and Secondary Losses NIPS 2020
Cooperative Multi-player Bandit Optimization NIPS 2020
Online Agnostic Boosting via Regret Minimization NIPS 2020
Simultaneous Translation Policies: From Fixed to Adaptive ACL 2020
Revisiting Online Quantum State Learning AAAI 2020
Stochastic Online Learning with Probabilistic Graph Feedback AAAI 2020
OMuLeT: Online Multi-Lead Time Location Prediction for Hurricane Trajectory Forecasting AAAI 2020
Follow the Perturbed Leader: Optimism and Fast Parallel Algorithms for Smooth Minimax Games NIPS 2020
Monte Carlo Tree Search in Continuous Spaces Using Voronoi Optimistic Optimization with Regret Bounds AAAI 2020
Online Multitask Learning with Long-Term Memory NIPS 2020
Reinforcement Learning in Feature Space: Matrix Bandit, Kernels, and Regret Bound ICML 2020
Comparator-Adaptive Convex Bandits NIPS 2020
Model-free Reinforcement Learning in Infinite-horizon Average-reward Markov Decision Processes ICML 2020
Budgeted Online Influence Maximization ICML 2020
Adaptive Online Estimation of Piecewise Polynomial Trends NIPS 2020
Logarithmic Regret for Adversarial Online Control ICML 2020
No-Regret and Incentive-Compatible Online Learning ICML 2020
Parameter-free, Dynamic, and Strongly-Adaptive Online Learning ICML 2020
Memoryless Sequences for General Losses JMLR 2020
A Bandit Learning Algorithm and Applications to Auction Design NIPS 2020