← Learning Types
Machine Learning › Learning Types ›

Online Learning

1012 directly classified papers

Papers per year

Papers

Meta-Descent for Online, Continual Prediction AAAI 2019
Cogra: Concept-Drift-Aware Stochastic Gradient Descent for Time-Series Forecasting AAAI 2019
Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback NIPS 2019
Phase Transitions and Cyclic Phenomena in Bandits with Switching Constraints NIPS 2019
Online Stochastic Shortest Path with Bandit Feedback and Unknown Transition Function NIPS 2019
Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimization NIPS 2019
Thresholding Bandit with Optimal Aggregate Regret NIPS 2019
Sequential Experimental Design for Transductive Linear Bandits NIPS 2019
Confidence Weighted Multitask Learning AAAI 2019
Collective Online Learning of Gaussian Processes in Massive Multi-Agent Systems AAAI 2019
Combinatorial Bandits with Relative Feedback NIPS 2019
Parsimonious Online Learning with Kernels via Sparse Projections in Function Space JMLR 2019
Dynamic Pricing in High-dimensions JMLR 2019
Approximations of the Restless Bandit Problem JMLR 2019
Partially Observable Multi-Sensor Sequential Change Detection: A Combinatorial Multi-Armed Bandit Approach AAAI 2019
Leveraging Observations in Bandits: Between Risks and Benefits AAAI 2019
Online-Within-Online Meta-Learning NIPS 2019
Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback NIPS 2019
Dueling Bandits with Qualitative Feedback AAAI 2019
Random Feature-based Online Multi-kernel Learning in Environments with Unknown Dynamics JMLR 2019
Monotone Learning with Rectified Wire Networks JMLR 2019
On the Regret Minimization of Nonconvex Online Gradient Ascent for Online PCA COLT 2019
Minimax Online Prediction of Varying Bernoulli Process under Variational Approximation ACML 2019
Online Algorithms for Rent-Or-Buy with Expert Advice ICML 2019
Blocking Bandits NIPS 2019