← Learning Types
Machine Learning › Learning Types ›

Online Learning

1012 directly classified papers

Papers per year

Papers

Streaming Principal Component Analysis From Incomplete Data JMLR 2019
Be Greedy: How Chromatic Number meets Regret Minimization in Graph Bandits UAI 2019
User-Specified Local Differential Privacy in Unconstrained Adaptive Online Learning NIPS 2019
Problem-dependent Regret Bounds for Online Learning with Feedback Graphs UAI 2019
Contextual Bandits with Cross-Learning NIPS 2019
Polynomial Cost of Adaptation for X-Armed Bandits NIPS 2019
Online Learning via the Differential Privacy Lens NIPS 2019
On First-Order Bounds, Variance and Gap-Dependent Bounds for Adversarial Bandits UAI 2019
Online Optimal Control with Linear Dynamics and Predictions: Algorithms and Regret Analysis NIPS 2019
Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity ICML 2018
Online Linear Quadratic Control ICML 2018
Online Learning with Abstention ICML 2018
Spatio-temporal Bayesian On-line Changepoint Detection with Model Selection ICML 2018
Streaming Principal Component Analysis in Noisy Setting ICML 2018
Provable Variable Selection for Streaming Features ICML 2018
Minimax Concave Penalized Multi-Armed Bandit Model with High-Dimensional Covariates ICML 2018
Adaptive Exploration-Exploitation Tradeoff for Opportunistic Bandits ICML 2018
Minimizing Adaptive Regret with One Gradient per Iteration IJCAI 2018
Fast Factorization-free Kernel Learning for Unlabeled Chunk Data Streams IJCAI 2018
Bandit Online Learning on Graphs via Adaptive Optimization IJCAI 2018
Contextual bandits with surrogate losses: Margin bounds and efficient algorithms NIPS 2018
Learning in Games with Lossy Feedback NIPS 2018
Contextual Combinatorial Multi-armed Bandits with Volatile Arms and Submodular Reward NIPS 2018
Factored Bandits NIPS 2018
Adaptation to Easy Data in Prediction with Limited Advice NIPS 2018