← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach NIPS 2017
Affine-Invariant Online Optimization and the Low-rank Experts Problem NIPS 2017
Corralling a Band of Bandit Algorithms COLT 2017
Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons COLT 2017
Thompson Sampling for the MNL-Bandit COLT 2017
Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration COLT 2017
Tight Bounds for Bandit Combinatorial Optimization COLT 2017
Online Learning Without Prior Information COLT 2017
Bandits with Movement Costs and Adaptive Pricing COLT 2017
Sparse Stochastic Bandits COLT 2017
The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regime COLT 2017
Online Learning of Optimal Bidding Strategy in Repeated Multi-Commodity Auctions NIPS 2017
Online Learning with a Hint NIPS 2017
Algorithmic Chaining and the Role of Partial Feedback in Online Nonparametric Learning COLT 2017
ZigZag: A New Approach to Adaptive Online Learning COLT 2017
Recognizing Top-Monotonic Preference Profiles in Polynomial Time IJCAI 2017
Online Optimization of Video-Ad Allocation IJCAI 2017
Follow the Compressed Leader: Faster Online Learning of Eigenvectors and Faster MMWU ICML 2017
Emulating the Expert: Inverse Optimization through Online Learning ICML 2017
Lazifying Conditional Gradient Algorithms ICML 2017
Linear Thompson Sampling Revisited AISTATS 2017
Online Optimization of Smoothed Piecewise Constant Functions AISTATS 2017
Unsupervised Sequential Sensor Acquisition AISTATS 2017
Improved Strongly Adaptive Online Learning using Coin Betting AISTATS 2017
Random Permutation Online Isotonic Regression NIPS 2017