conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2,192 papers

Papers per year

1
16
59
225
69
'05
'10
'15
'20
'25

Papers

Contextual bandits with surrogate losses: Margin bounds and efficient algorithms NIPS 2018
Enhancing the Accuracy and Fairness of Human Decision Making NIPS 2018
Efficient online algorithms for fast-rate regret bounds under sparsity NIPS 2018
Regret Bounds for Robust Adaptive Control of the Linear Quadratic Regulator NIPS 2018
Adaptive Online Learning in Dynamic Environments NIPS 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
Factored Bandits NIPS 2018
Adaptation to Easy Data in Prediction with Limited Advice NIPS 2018
Generalized Inverse Optimization through Online Learning NIPS 2018
On preserving non-discrimination when combining expert advice NIPS 2018
Contextual Pricing for Lipschitz Buyers NIPS 2018
Bandit Learning in Concave N-Person Games NIPS 2018
The Everlasting Database: Statistical Validity at a Fair Price NIPS 2018
Online Learning with an Unknown Fairness Metric NIPS 2018
Single-Agent Policy Tree Search With Guarantees NIPS 2018
Faster Online Learning of Optimal Threshold for Consistent F-measure Optimization NIPS 2018
Universal Growth in Production Economies NIPS 2018
Regret Bounds for Online Portfolio Selection with a Cardinality Constraint NIPS 2018
Improving Online Algorithms via ML Predictions NIPS 2018
A Bandit Approach to Sequential Experimental Design with False Discovery Control NIPS 2018
Horizon-Independent Minimax Linear Regression NIPS 2018
Adversarial Attacks on Stochastic Bandits NIPS 2018
Multi-armed Bandits with Compensation NIPS 2018
Multiplicative Weights Updates with Constant Step-Size in Graphical Constant-Sum Games NIPS 2018