Online Algorithms

Efficient learning by implicit exploration in bandit problems with side observations NeurIPS 2014 Efficient Partial Monitoring with Prior Information NeurIPS 2014 Efficient Visual-Inertial Navigation using a Rolling-Shutter Camera with Inaccurate Timestamps RSS 2014 Exploiting easy data in online optimization NeurIPS 2014 Extreme bandits NeurIPS 2014 Follow the Leader If You Can, Hedge If You Must JMLR 2014 Fundamental Limits of Online and Distributed Algorithms for Statistical Learning and Estimation NeurIPS 2014 Higher-Order Regret Bounds with Switching Costs COLT 2014 Improved Bounds for Online Learning Over the Permutahedron and Other Ranking Polytopes AISTATS 2014 Learning Multiple Tasks in Parallel with a Shared Annotator NeurIPS 2014 Learning to Optimize via Information-Directed Sampling NeurIPS 2014 Lipschitz Bandits: Regret Lower Bound and Optimal Algorithms COLT 2014 Most Correlated Arms Identification COLT 2014 On Communication Cost of Distributed Statistical Estimation and Dimensionality NeurIPS 2014 One Practical Algorithm for Both Stochastic and Adversarial Bandits ICML 2014 Online combinatorial optimization with stochastic decision sets and adversarial losses NeurIPS 2014 Online Decision-Making in General Combinatorial Spaces NeurIPS 2014 Online Learning in Markov Decision Processes with Changing Cost Sequences ICML 2014 Online Linear Optimization via Smoothing COLT 2014 Open Problem: Online Local Learning COLT 2014 Open Problem: Shifting Experts on Easy Data COLT 2014 Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm ICML 2014 Optimal Regret Minimization in Posted-Price Auctions with Strategic Buyers NeurIPS 2014 Pursuit-Evasion Without Regret, with an Application to Trading ICML 2014 Reducing Dueling Bandits to Cardinal Bandits ICML 2014