← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Polynomial-Time Linear-Swap Regret Minimization in Imperfect-Information Sequential Games NIPS 2023
Anytime Model Selection in Linear Bandits NIPS 2023
Improved Learning-Augmented Algorithms for the Multi-Option Ski Rental Problem via Best-Possible Competitive Analysis ICML 2023
On the Sublinear Regret of GP-UCB NIPS 2023
Cilantro: Performance-Aware Resource Allocation for General Objectives via Online Feedback OSDI 2023
Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization NIPS 2023
Optimistic Whittle Index Policy: Online Learning for Restless Bandits AAAI 2023
Statistical Inference and A/B Testing for First-Price Pacing Equilibria ICML 2023
Semi-Parametric Contextual Pricing Algorithm using Cox Proportional Hazards Model ICML 2023
Nearest Neighbour with Bandit Feedback NIPS 2023
On Preemption and Learning in Stochastic Scheduling ICML 2023
Efficient Online Clustering with Moving Costs NIPS 2023
A Quantitative Game-theoretical Study on Externalities of Long-lasting Humanitarian Relief Operations in Conflict Areas IJCAI 2023
Multiplier Bootstrap-based Exploration ICML 2023
Online Label Shift: Optimal Dynamic Regret meets Practical Algorithms NIPS 2023
Dynamical Linear Bandits ICML 2023
Fully Dynamic $k$-Clustering in $\tilde O(k)$ Update Time NIPS 2023
Asynchronous Proportional Response Dynamics: Convergence in Markets with Adversarial Scheduling NIPS 2023
Online Optimization over Riemannian Manifolds JMLR 2023
Meta-Learning Adversarial Bandit Algorithms NIPS 2023
Online Learning under Adversarial Nonlinear Constraints NIPS 2023
Is Consensus Acceleration Possible in Decentralized Optimization over Slowly Time-Varying Networks? ICML 2023
Stochastic Gradient Succeeds for Bandits ICML 2023
Communication-Constrained Bandits under Additive Gaussian Noise ICML 2023
Bandits with Knapsacks: Advice on Time-Varying Demands ICML 2023