conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2,192 papers

Papers per year

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

Papers

An Asymptotically Optimal Primal-Dual Incremental Algorithm for Contextual Linear Bandits NIPS 2020
Locally-Adaptive Nonparametric Online Learning NIPS 2020
Unreasonable Effectiveness of Greedy Algorithms in Multi-Armed Bandit with Many Arms NIPS 2020
The Power of Predictions in Online Control NIPS 2020
Cooperative Multi-player Bandit Optimization NIPS 2020
Tight First- and Second-Order Regret Bounds for Adversarial Linear Bandits NIPS 2020
A/B Testing in Dense Large-Scale Networks: Design and Inference NIPS 2020
Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes NIPS 2020
Finite Continuum-Armed Bandits NIPS 2020
Online MAP Inference of Determinantal Point Processes NIPS 2020
Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition NIPS 2020
Delay and Cooperation in Nonstochastic Linear Bandits NIPS 2020
Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits NIPS 2020
SLIP: Learning to predict in unknown dynamical systems with long-term memory NIPS 2020
Crush Optimism with Pessimism: Structured Bandits Beyond Asymptotic Optimality NIPS 2020
Small Nash Equilibrium Certificates in Very Large Games NIPS 2020
Geometric Exploration for Online Control NIPS 2020
Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent NIPS 2020
Secretary and Online Matching Problems with Machine Learned Advice NIPS 2020
Optimal Robustness-Consistency Trade-offs for Learning-Augmented Online Algorithms NIPS 2020
Adversarial Blocking Bandits NIPS 2020
Online Algorithms for Multi-shop Ski Rental with Machine Learned Advice NIPS 2020
From Finite to Countable-Armed Bandits NIPS 2020
Optimal Algorithms for Stochastic Multi-Armed Bandits with Heavy Tailed Rewards NIPS 2020
Adaptive Probing Policies for Shortest Path Routing NIPS 2020