conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2,192 papers

Papers per year

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

Papers

On Optimal Robustness to Adversarial Corruption in Online Decision Problems NIPS 2021
Statistical Inference with M-Estimators on Adaptively Collected Data NIPS 2021
Improved Regret Bounds for Tracking Experts with Memory NIPS 2021
One More Step Towards Reality: Cooperative Bandits with Imperfect Communication NIPS 2021
A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithms NIPS 2021
ROI Maximization in Stochastic Online Decision-Making NIPS 2021
Conic Blackwell Algorithm: Parameter-Free Convex-Concave Saddle-Point Solving NIPS 2021
Online Learning in Periodic Zero-Sum Games NIPS 2021
Pareto-Optimal Learning-Augmented Algorithms for Online Conversion Problems NIPS 2021
Online learning in MDPs with linear function approximation and bandit feedback. NIPS 2021
Parallelizing Thompson Sampling NIPS 2021
Implicit Finite-Horizon Approximation and Efficient Optimal Algorithms for Stochastic Shortest Path NIPS 2021
Selective Sampling for Online Best-arm Identification NIPS 2021
Making the most of your day: online learning for optimal allocation of time NIPS 2021
Online Adaptation to Label Distribution Shift NIPS 2021
Sequential Algorithms for Testing Closeness of Distributions NIPS 2021
Variational Bayesian Optimistic Sampling NIPS 2021
Learning in Multi-Stage Decentralized Matching Markets NIPS 2021
Revisiting Smoothed Online Learning NIPS 2021
Prior-independent Dynamic Auctions for a Value-maximizing Buyer NIPS 2021
Logarithmic Regret in Feature-based Dynamic Pricing NIPS 2021
From Optimality to Robustness: Adaptive Re-Sampling Strategies in Stochastic Bandits NIPS 2021
Online Selective Classification with Limited Feedback NIPS 2021
Fast Routing under Uncertainty: Adaptive Learning in Congestion Games via Exponential Weights NIPS 2021
Learning-to-learn non-convex piecewise-Lipschitz functions NIPS 2021