← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

OLPS: A Toolbox for On-Line Portfolio Selection JMLR 2016
Combinatorial Multi-Armed Bandit with General Reward Functions NIPS 2016
Online Convex Optimization with Unconstrained Domains and Losses NIPS 2016
Following the Leader and Fast Rates in Linear Prediction: Curved Constraint Sets and Other Regularities NIPS 2016
Anytime optimal algorithms in stochastic multi-armed bandits ICML 2016
Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms JMLR 2016
An Information-Theoretic Analysis of Thompson Sampling JMLR 2016
Multi-armed Bandits: Competing with Optimal Sequences NIPS 2016
Learning Algorithms for Second-Price Auctions with Reserve JMLR 2016
Delay and Cooperation in Nonstochastic Bandits COLT 2016
An Online Convex Optimization Approach to Blackwell's Approachability JMLR 2016
Tight (Lower) Bounds for the Fixed Budget Best Arm Identification Bandit Problem COLT 2016
Hardness of Online Sleeping Combinatorial Optimization Problems NIPS 2016
Learning Simple Auctions COLT 2016
Combinatorial semi-bandit with known covariance NIPS 2016
Dueling Bandits: Beyond Condorcet Winners to General Tournament Solutions NIPS 2016
Coin Betting and Parameter-Free Online Learning NIPS 2016
Online Learning with Adversarial Delays NIPS 2015
Online Learning via Sequential Complexities JMLR 2015
Achieving All with No Parameters: AdaNormalHedge COLT 2015
Online Gradient Boosting NIPS 2015
On the Complexity of Bandit Linear Optimization COLT 2015
Second-order Quantile Methods for Experts and Combinatorial Games COLT 2015
Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem COLT 2015
Combinatorial Bandits Revisited NIPS 2015