← Learning Types
Machine Learning › Learning Types ›

Online Learning

1012 directly classified papers

Papers per year

Papers

Geometric Exploration for Online Control NIPS 2020
Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent NIPS 2020
Secretary and Online Matching Problems with Machine Learned Advice NIPS 2020
Optimal Robustness-Consistency Trade-offs for Learning-Augmented Online Algorithms NIPS 2020
Online Algorithms for Multi-shop Ski Rental with Machine Learned Advice NIPS 2020
Analysis and Design of Thompson Sampling for Stochastic Partial Monitoring NIPS 2020
On Regret with Multiple Best Arms NIPS 2020
Optimal Learning from Verified Training Data NIPS 2020
Online Linear Optimization with Many Hints NIPS 2020
Exploiting the Surrogate Gap in Online Multiclass Classification NIPS 2020
Stage-wise Conservative Linear Bandits NIPS 2020
Metric-Free Individual Fairness in Online Learning NIPS 2020
A Bandit Learning Algorithm and Applications to Auction Design NIPS 2020
Latent Bandits Revisited NIPS 2020
Group-Fair Online Allocation in Continuous Time NIPS 2020
Prediction with Corrupted Expert Advice NIPS 2020
A Single Recipe for Online Submodular Maximization with Adversarial or Stochastic Constraints NIPS 2020
Online learning with dynamics: A minimax perspective NIPS 2020
Online Convex Optimization Over Erdos-Renyi Random Networks NIPS 2020
Batched Coarse Ranking in Multi-Armed Bandits NIPS 2020
Gaussian Gated Linear Networks NIPS 2020
Online Non-Convex Optimization with Imperfect Feedback NIPS 2020
Making Non-Stochastic Control (Almost) as Easy as Stochastic NIPS 2020
A Tight Lower Bound and Efficient Reduction for Swap Regret NIPS 2020
Vector Autoregressive Weighting Reversion Strategy for Online Portfolio Selection IJCAI 2020