← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Streaming kernel regression with provably adaptive mean, variance, and regularization JMLR 2018
Refining the Confidence Level for Optimistic Bandit Strategies JMLR 2018
The Promise and Perils of Myopia in Dynamic Pricing With Censored Information IJCAI 2018
Online Variance Reduction for Stochastic Optimization COLT 2018
Scheduling under Uncertainty: A Query-based Approach IJCAI 2018
The Everlasting Database: Statistical Validity at a Fair Price NIPS 2018
Learning Optimal Reserve Price against Non-myopic Bidders NIPS 2018
Online Reciprocal Recommendation with Theoretical Performance Guarantees NIPS 2018
Faster Rates for Convex-Concave Games COLT 2018
Constant Factor Time Optimal Multi-Robot Routing on High-Dimensional Grids RSS 2018
Cost-aware Cascading Bandits IJCAI 2018
Minimizing Adaptive Regret with One Gradient per Iteration IJCAI 2018
Sharing, Protection, and Compatibility for Reconfigurable Fabric with AmorphOS OSDI 2018
HONES: A Fast and Tuning-free Homotopy Method For Online Newton Step AISTATS 2018
Improving Online Algorithms via ML Predictions NIPS 2018
Bandit Learning in Concave N-Person Games NIPS 2018
Distributed Multi-Player Bandits - a Game of Thrones Approach NIPS 2018
Bandits with Delayed, Aggregated Anonymous Feedback ICML 2018
Multi-armed Bandits with Compensation NIPS 2018
SAFFRON: an Adaptive Algorithm for Online Control of the False Discovery Rate ICML 2018
LeapsAndBounds: A Method for Approximately Optimal Algorithm Configuration ICML 2018
Adaptive Exploration-Exploitation Tradeoff for Opportunistic Bandits ICML 2018
Nonstochastic Bandits with Composite Anonymous Feedback COLT 2018
Universal Growth in Production Economies NIPS 2018
Online Prediction with Selfish Experts NIPS 2017