← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Bandits Dueling on Partially Ordered Sets NIPS 2017
An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback JMLR 2017
New bounds on the price of bandit feedback for mistake-bounded online multiclass learning ALT 2017
Online Learning with Local Permutations and Delayed Feedback ICML 2017
Don't Bury your Head in Warnings: A Game-Theoretic Approach for Intelligent Allocation of Cyber-security Alerts IJCAI 2017
Dynamic Revenue Sharing NIPS 2017
Improved Dynamic Regret for Non-degenerate Functions NIPS 2017
Online Algorithm Selection IJCAI 2017
Efficiency Through Procrastination: Approximately Optimal Algorithm Configuration with Runtime Guarantees IJCAI 2017
Following the Leader and Fast Rates in Online Linear Prediction: Curved Constraint Sets and Other Regularities JMLR 2017
Approximation Vector Machines for Large-scale Online Learning JMLR 2017
Online Bayesian Passive-Aggressive Learning JMLR 2017
Maxing and Ranking with Few Assumptions NIPS 2017
Influence Maximization with $\varepsilon$-Almost Submodular Threshold Functions NIPS 2017
Multi-Objective Non-parametric Sequential Prediction NIPS 2017
Identifying Outlier Arms in Multi-Armed Bandit NIPS 2017
Interactive Submodular Bandit NIPS 2017
Balancing information exposure in social networks NIPS 2017
Real-Time Bidding with Side Information NIPS 2017
Collecting Telemetry Data Privately NIPS 2017
Scalable Generalized Linear Bandits: Online Computation and Hashing NIPS 2017
Improving Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms and Its Applications NIPS 2017
A framework for Multi-A(rmed)/B(andit) Testing with Online FDR Control NIPS 2017
Efficient Mechanism Design for Online Scheduling (Extended Abstract) IJCAI 2017
Rotting Bandits NIPS 2017