← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Designing smoothing functions for improved worst-case competitive ratio in online optimization NIPS 2016
An Efficient Streaming Algorithm for the Submodular Cover Problem NIPS 2016
Large Scale Online Kernel Learning JMLR 2016
Machine Learning in an Auction Environment JMLR 2016
Online PCA with Optimal Regret JMLR 2016
Horizontally Scalable Submodular Maximization ICML 2016
Slicer: Auto-Sharding for Datacenter Applications OSDI 2016
Online Stochastic Linear Optimization under One-bit Feedback ICML 2016
Adaptive Algorithms for Online Convex Optimization with Long-term Constraints ICML 2016
Heteroscedastic Sequences: Beyond Gaussianity ICML 2016
Pricing a Low-regret Seller ICML 2016
MetaGrad: Multiple Learning Rates in Online Learning NIPS 2016
Efficient Second Order Online Learning by Sketching NIPS 2016
Randomization and The Pernicious Effects of Limited Budgets on Auction Experiments AISTATS 2016
Accelerating Online Convex Optimization via Adaptive Prediction AISTATS 2016
Revealing Graph Bandits for Maximizing Local Influence AISTATS 2016
Random Forest for the Contextual Bandit Problem AISTATS 2016
Fast Convergence of Online Pairwise Learning Algorithms AISTATS 2016
Non-stochastic Best Arm Identification and Hyperparameter Optimization AISTATS 2016
No Regret Bound for Extreme Bandits AISTATS 2016
Online Learning to Rank with Feedback at the Top AISTATS 2016
Online and Distributed Bayesian Moment Matching for Parameter Learning in Sum-Product Networks AISTATS 2016
Provable Efficient Online Matrix Completion via Non-convex Stochastic Gradient Descent NIPS 2016
Dual Space Gradient Descent for Online Learning NIPS 2016
Data-driven Rank Breaking for Efficient Rank Aggregation JMLR 2016