← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Sequential prediction with coded side information under logarithmic loss ALT 2018
Minimax Rates and Efficient Algorithms for Noisy Sorting ALT 2018
Semiparametric Contextual Bandits ICML 2018
Black-Box Reductions for Parameter-free Online Learning in Banach Spaces COLT 2018
Generalized Binary Search For Split-Neighborly Problems AISTATS 2018
Efficient Bandit Combinatorial Optimization Algorithm with Zero-suppressed Binary Decision Diagrams AISTATS 2018
Faster Online Learning of Optimal Threshold for Consistent F-measure Optimization NIPS 2018
Efficient Computation of Approximate Equilibria in Discrete Colonel Blotto Games IJCAI 2018
Dynamic Query Re-Planning using QOOP OSDI 2018
Three steps is all you need: fast, accurate, automatic scaling decisions for distributed streaming dataflows OSDI 2018
Adaptive Sampling for Coarse Ranking AISTATS 2018
Weakly Consistent Optimal Pricing Algorithms in Repeated Posted-Price Auctions with Strategic Buyer ICML 2018
Online Learning with Abstention ICML 2018
Online Linear Quadratic Control ICML 2018
Online Pricing for Revenue Maximization with Unknown Time Discounting Valuations IJCAI 2018
Efficient Adaptive Online Learning via Frequent Directions IJCAI 2018
Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications IJCAI 2018
Multinomial Logit Bandit with Linear Utility Functions IJCAI 2018
Online Kernel Selection via Incremental Sketched Kernel Alignment IJCAI 2018
Almost Optimal Algorithms for Linear Stochastic Bandits with Heavy-Tailed Payoffs NIPS 2018
Contextual Combinatorial Multi-armed Bandits with Volatile Arms and Submodular Reward NIPS 2018
Adversarial Attacks on Stochastic Bandits NIPS 2018
Do Less, Get More: Streaming Submodular Maximization with Subsampling NIPS 2018
Factored Bandits NIPS 2018
Nearly Optimal Robust Subspace Tracking ICML 2018