← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Exploiting easy data in online optimization NIPS 2014
Efficient Partial Monitoring with Prior Information NIPS 2014
Higher-Order Regret Bounds with Switching Costs COLT 2014
Efficient learning by implicit exploration in bandit problems with side observations NIPS 2014
Repeated Contextual Auctions with Strategic Buyers NIPS 2014
Dynamic Resource Allocation for Optimizing Population Diffusion AISTATS 2014
The Blinded Bandit: Learning with Adaptive Feedback NIPS 2014
Optimal Regret Minimization in Posted-Price Auctions with Strategic Buyers NIPS 2014
Learning to Optimize via Information-Directed Sampling NIPS 2014
Bandit Convex Optimization: Towards Tight Bounds NIPS 2014
Fundamental Limits of Online and Distributed Algorithms for Statistical Learning and Estimation NIPS 2014
Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms ICML 2014
Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm ICML 2014
Learning Multiple Tasks in Parallel with a Shared Annotator NIPS 2014
Open Problem: Online Local Learning COLT 2014
Online Learning in Markov Decision Processes with Changing Cost Sequences ICML 2014
One Practical Algorithm for Both Stochastic and Adversarial Bandits ICML 2014
Pursuit-Evasion Without Regret, with an Application to Trading ICML 2014
Adaptivity and Optimism: An Improved Exponentiated Gradient Algorithm ICML 2014
Robust Online Gesture Recognition with Crowdsourced Annotations JMLR 2014
On Communication Cost of Distributed Statistical Estimation and Dimensionality NIPS 2014
Combinatorial Partial Monitoring Game with Linear Feedback and Its Applications ICML 2014
Online Decision-Making in General Combinatorial Spaces NIPS 2014
Towards Minimax Online Learning with Unknown Time Horizon ICML 2014
Exploration vs Exploitation vs Safety: Risk-Aware Multi-Armed Bandits ACML 2013