Online Algorithms

Online learning in episodic Markovian decision processes by relative entropy policy search NeurIPS 2013 Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions NeurIPS 2013 Online Learning of Dynamic Parameters in Social Networks NeurIPS 2013 Online Learning under Delayed Feedback ICML 2013 Online Learning with Costly Features and Labels NeurIPS 2013 Online Learning with Predictable Sequences COLT 2013 Online Learning with Switching Costs and Other Adaptive Adversaries NeurIPS 2013 Online Similarity Prediction of Networked Data from Known and Unknown Graphs COLT 2013 Open Problem: Adversarial Multiarmed Bandits with Limited Advice COLT 2013 Opportunistic Strategies for Generalized No-Regret Problems COLT 2013 Optimization, Learning, and Games with Predictable Sequences NeurIPS 2013 Optimizing Instructional Policies NeurIPS 2013 Prediction by random-walk perturbation COLT 2013 Random Spanning Trees and the Prediction of Weighted Graphs JMLR 2013 Regret Minimization for Branching Experts COLT 2013 Reinforcement Learning in Robust Markov Decision Processes NeurIPS 2013 Scalable Influence Estimation in Continuous-Time Diffusion Networks NeurIPS 2013 Sparse Adaptive Dirichlet-Multinomial-like Processes COLT 2013 Sparsity Regret Bounds for Individual Sequences in Online Linear Regression JMLR 2013 The Pareto Regret Frontier NeurIPS 2013 Two-Target Algorithms for Infinite-Armed Bandits with Bernoulli Rewards NeurIPS 2013 Unconfused Ultraconservative Multiclass Algorithms ACML 2013 A Linear Time Active Learning Algorithm for Link Classification NeurIPS 2012 A Stochastic Bandit Algorithm for Scratch Games ACML 2012 Autonomous Exploration For Navigating In MDPs COLT 2012