conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2,192 papers

Papers per year

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

Papers

Sliding Window Algorithms for k-Clustering Problems NIPS 2020
Better Full-Matrix Regret via Parameter-Free Online Learning NIPS 2020
Bandit Linear Control NIPS 2020
On Regret with Multiple Best Arms NIPS 2020
Simple and Fast Algorithm for Binary Integer and Online Linear Programming NIPS 2020
Online Linear Optimization with Many Hints NIPS 2020
Inference for Batched Bandits NIPS 2020
Optimal Best-arm Identification in Linear Bandits NIPS 2020
An Empirical Process Approach to the Union Bound: Practical Algorithms for Combinatorial and Linear Bandits NIPS 2020
High-Dimensional Sparse Linear Bandits NIPS 2020
Non-Stochastic Control with Bandit Feedback NIPS 2020
Stage-wise Conservative Linear Bandits NIPS 2020
Restless-UCB, an Efficient and Low-complexity Algorithm for Online Restless Bandits NIPS 2020
Temporal Variability in Implicit Online Learning NIPS 2020
Dynamic Regret of Convex and Smooth Functions NIPS 2020
Mitigating Manipulation in Peer Review via Randomized Reviewer Assignments NIPS 2020
Latent Bandits Revisited NIPS 2020
Group-Fair Online Allocation in Continuous Time NIPS 2020
Prediction with Corrupted Expert Advice NIPS 2020
Adversarial Attacks on Linear Contextual Bandits NIPS 2020
Planning with General Objective Functions: Going Beyond Total Rewards NIPS 2020
A Single Recipe for Online Submodular Maximization with Adversarial or Stochastic Constraints NIPS 2020
Online learning with dynamics: A minimax perspective NIPS 2020
Learning Augmented Energy Minimization via Speed Scaling NIPS 2020
Online Convex Optimization Over Erdos-Renyi Random Networks NIPS 2020