conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

806 papers

Papers per year

6
24
87
21
'10
'15
'20
'25

Papers

Most Correlated Arms Identification COLT 2014
Robust Multi-objective Learning with Mentor Feedback COLT 2014
Online Linear Optimization via Smoothing COLT 2014
Follow the Leader with Dropout Perturbations COLT 2014
Lipschitz Bandits: Regret Lower Bound and Optimal Algorithms COLT 2014
Resourceful Contextual Bandits COLT 2014
Online Learning with Composite Loss Functions COLT 2014
Online Non-Parametric Regression COLT 2014
Three Guidelines of Online Learning for Large-Scale Visual Recognition CVPR 2014
Towards Minimax Online Learning with Unknown Time Horizon ICML 2014
Prediction with Limited Advice and Multiarmed Bandits with Paid Observations ICML 2014
Boosting with Online Binary Learners for the Multiclass Bandit Problem ICML 2014
Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits ICML 2014
LIBOL: A Library for Online Learning Algorithms JMLR 2014
Set-Valued Approachability and Online Learning with Partial Monitoring JMLR 2014
Reinforcement Learning in Robust Markov Decision Processes NIPS 2013
Online Learning with Costly Features and Labels NIPS 2013
Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions NIPS 2013
Distributed Exploration in Multi-Armed Bandits NIPS 2013
Online Learning of Dynamic Parameters in Social Networks NIPS 2013
Online learning in episodic Markovian decision processes by relative entropy policy search NIPS 2013
The Pareto Regret Frontier NIPS 2013
Dimension-Free Exponentiated Gradient NIPS 2013
Scalable Influence Estimation in Continuous-Time Diffusion Networks NIPS 2013
Optimizing Instructional Policies NIPS 2013