← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

803 directly classified papers

Papers per year

Papers

A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret COLT 2013
The Pareto Regret Frontier NIPS 2013
Sparsity Regret Bounds for Individual Sequences in Online Linear Regression JMLR 2013
Unconfused Ultraconservative Multiclass Algorithms ACML 2013
Dimension-Free Exponentiated Gradient NIPS 2013
Adaptive Market Making via Online Learning NIPS 2013
Online Learning with Switching Costs and Other Adaptive Adversaries NIPS 2013
Online Learning with Predictable Sequences COLT 2013
Online Similarity Prediction of Networked Data from Known and Unknown Graphs COLT 2013
A near-optimal algorithm for finite partial-monitoring games against adversarial opponents COLT 2013
Competing With Strategies COLT 2013
Opportunistic Strategies for Generalized No-Regret Problems COLT 2013
Bounded regret in stochastic multi-armed bandits COLT 2013
Prediction by random-walk perturbation COLT 2013
Sparse Adaptive Dirichlet-Multinomial-like Processes COLT 2013
From Bandits to Experts: A Tale of Domination and Independence NIPS 2013
Adaptive Submodular Maximization in Bandit Setting NIPS 2013
Beating Bandits in Gradually Evolving Worlds COLT 2013
Regret Minimization for Branching Experts COLT 2013
One-Pass AUC Optimization ICML 2013
Combinatorial Multi-Armed Bandit: General Framework and Applications ICML 2013
How to Hedge an Option Against an Adversary: Black-Scholes Pricing is Minimax Optimal NIPS 2013
Reinforcement Learning in Robust Markov Decision Processes NIPS 2013
Online Learning with Costly Features and Labels NIPS 2013
Open Problem: Adversarial Multiarmed Bandits with Limited Advice COLT 2013