← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

803 directly classified papers

Papers per year

Papers

Fundamental Limits of Online and Distributed Algorithms for Statistical Learning and Estimation NIPS 2014
A Boosting Framework on Grounds of Online Learning NIPS 2014
Online Learning with Composite Loss Functions COLT 2014
Online combinatorial optimization with stochastic decision sets and adversarial losses NIPS 2014
Learning the Learning Rate for Prediction with Expert Advice NIPS 2014
Repeated Contextual Auctions with Strategic Buyers NIPS 2014
Discovering, Learning and Exploiting Relevance NIPS 2014
Online Passive-Aggressive Algorithms for Non-Negative Matrix Factorization and Completion AISTATS 2014
Efficient learning by implicit exploration in bandit problems with side observations NIPS 2014
The Blinded Bandit: Learning with Adaptive Feedback NIPS 2014
Learning Multiple Tasks in Parallel with a Shared Annotator NIPS 2014
Extreme bandits NIPS 2014
Scalable Influence Estimation in Continuous-Time Diffusion Networks NIPS 2013
Distributed Exploration in Multi-Armed Bandits NIPS 2013
Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions NIPS 2013
Random Spanning Trees and the Prediction of Weighted Graphs JMLR 2013
Almost Optimal Exploration in Multi-Armed Bandits ICML 2013
Online Learning of Dynamic Parameters in Social Networks NIPS 2013
Minimax Optimal Algorithms for Unconstrained Linear Optimization NIPS 2013
Optimizing Instructional Policies NIPS 2013
Approachability, fast and slow COLT 2013
Large-Scale Learning with Less RAM via Randomization ICML 2013
Dynamical Models and tracking regret in online convex programming ICML 2013
Online learning in episodic Markovian decision processes by relative entropy policy search NIPS 2013
Competing with an Infinite Set of Models in Reinforcement Learning AISTATS 2013