← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Online Task Assignment with Controllable Processing Time IJCAI 2023
Riemannian Projection-free Online Learning NIPS 2023
Stochastic Multi-armed Bandits: Optimal Trade-off among Optimality, Consistency, and Tail Risk NIPS 2023
Multi-Player Zero-Sum Markov Games with Networked Separable Interactions NIPS 2023
Instance-Optimality in Interactive Decision Making: Toward a Non-Asymptotic Theory COLT 2023
Simulation-Assisted Optimization for Large-Scale Evacuation Planning with Congestion-Dependent Delays IJCAI 2023
Universal Online Learning with Gradient Variations: A Multi-layer Online Ensemble Approach NIPS 2023
Online Ad Procurement in Non-stationary Autobidding Worlds NIPS 2023
First- and Second-Order Bounds for Adversarial Linear Contextual Bandits NIPS 2023
Stochastic Gradient Succeeds for Bandits ICML 2023
Adaptation to the Range in K-Armed Bandits JMLR 2023
An active learning framework for multi-group mean estimation NIPS 2023
Fast Online Changepoint Detection via Functional Pruning CUSUM Statistics JMLR 2023
Online estimation of similarity matrices with incomplete data UAI 2023
On Private and Robust Bandits NIPS 2023
Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression COLT 2023
Distributed Linear Bandits under Communication Constraints ICML 2023
Delayed Feedback in Kernel Bandits ICML 2023
Online Optimization over Riemannian Manifolds JMLR 2023
Improving the Knowledge Gradient Algorithm NIPS 2023
Contextual Conservative Interleaving Bandits ICML 2023
Multi-Fidelity Multi-Armed Bandits Revisited NIPS 2023
On the Sublinear Regret of GP-UCB NIPS 2023
Levin Tree Search with Context Models IJCAI 2023
Variance-Dependent Regret Bounds for Linear Bandits and Reinforcement Learning: Adaptivity and Computational Efficiency COLT 2023