← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Residual-Based Sampling for Online Outlier-Robust PCA ICML 2022
Congested Bandits: Optimal Routing via Short-term Resets ICML 2022
An $\alpha$-No-Regret Algorithm For Graphical Bilinear Bandits NIPS 2022
Pessimism for Offline Linear Contextual Bandits using $\ell_p$ Confidence Sets NIPS 2022
Collaborative Linear Bandits with Adversarial Agents: Near-Optimal Regret Bounds NIPS 2022
Learning from a Sample in Online Algorithms NIPS 2022
Sequential Information Design: Learning to Persuade in the Dark NIPS 2022
Parameter-Free Online Linear Optimization with Side Information via Universal Coin Betting AISTATS 2022
Anonymous Bandits for Multi-User Systems NIPS 2022
Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games NIPS 2022
Contextual Bandits with Smooth Regret: Efficient Learning in Continuous Action Spaces ICML 2022
A Last Switch Dependent Analysis of Satiation and Seasonality in Bandits AISTATS 2022
Choosing Answers in Epsilon-Best-Answer Identification for Linear Bandits ICML 2022
Online Learning with Knapsacks: the Best of Both Worlds ICML 2022
A Marriage between Adversarial Team Games and 2-player Games: Enabling Abstractions, No-regret Learning, and Subgame Solving ICML 2022
Safe Learning in Tree-Form Sequential Decision Making: Handling Hard and Soft Constraints ICML 2022
Stochastic Contextual Dueling Bandits under Linear Stochastic Transitivity Models ICML 2022
Yeti: Stateless and Generalized Multicast Forwarding NSDI 2022
Dynamic Bandits with Temporal Structure IJCAI 2022
Conformal Frequency Estimation with Sketched Data NIPS 2022
Online Balanced Experimental Design ICML 2022
Batched Dueling Bandits ICML 2022
Backpressure Flow Control NSDI 2022
On Kernelized Multi-Armed Bandits with Constraints NIPS 2022
Improved Regret Analysis for Variance-Adaptive Linear Bandits and Horizon-Free Linear Mixture MDPs NIPS 2022