← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Adaptation to Easy Data in Prediction with Limited Advice NIPS 2018
Beyond the Click-Through Rate: Web Link Selection with Multi-level Feedback IJCAI 2018
Online Regression with Partial Information: Generalization and Linear Projection AISTATS 2018
Contextual Bandits with Stochastic Experts AISTATS 2018
Generalized Inverse Optimization through Online Learning NIPS 2018
Regret Bounds for Online Portfolio Selection with a Cardinality Constraint NIPS 2018
A Bandit Approach to Sequential Experimental Design with False Discovery Control NIPS 2018
Best arm identification in multi-armed bandits with delayed feedback AISTATS 2018
Regional Multi-Armed Bandits AISTATS 2018
Constant Regret, Generalized Mixability, and Mirror Descent NIPS 2018
Efficient Online Portfolio with Logarithmic Regret NIPS 2018
Single-Agent Policy Tree Search With Guarantees NIPS 2018
Horizon-Independent Minimax Linear Regression NIPS 2018
Medoids in Almost-Linear Time via Multi-Armed Bandits AISTATS 2018
Stochastic Multi-armed Bandits in Constant Space AISTATS 2018
Online Learning with Non-Convex Losses and Non-Stationary Regret AISTATS 2018
Growth-Optimal Portfolio Selection under CVaR Constraints AISTATS 2018
Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descent COLT 2018
Private Sequential Learning COLT 2018
The Externalities of Exploration and How Data Diversity Helps Exploitation COLT 2018
Opinion Diffusion and Campaigning on Society Graphs IJCAI 2018
Multiplicative Weights Updates with Constant Step-Size in Graphical Constant-Sum Games NIPS 2018
Bringing Multi-agent Path Finding Closer to Reality IJCAI 2018
A fully adaptive algorithm for pure exploration in linear bandits AISTATS 2018
Maximum Selection and Sorting with Adversarial Comparators JMLR 2018