← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Online Learning of Delayed Choices NIPS 2024
Online Distribution Learning with Local Privacy Constraints AISTATS 2024
Improved Regret for Bandit Convex Optimization with Delayed Feedback NIPS 2024
Online Submodular Maximization via Online Convex Optimization AAAI 2024
Non-stationary Projection-Free Online Learning with Dynamic and Adaptive Regret Guarantees AAAI 2024
Using Adaptive Bandit Experiments to Increase and Investigate Engagement in Mental Health AAAI 2024
The SMART approach to instance-optimal online learning COLT 2024
Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression JMLR 2024
Can Probabilistic Feedback Drive User Impacts in Online Platforms? AISTATS 2024
Restless bandits with rewards generated by a linear Gaussian dynamical system L4DC 2024
Safe online convex optimization with multi-point feedback L4DC 2024
Sample Complexity of Posted Pricing for a Single Item NIPS 2024
Accelerating Matroid Optimization through Fast Imprecise Oracles NIPS 2024
Adaptive online non-stochastic control L4DC 2024
Understanding Routable PCIe Performance for Composable Infrastructures NSDI 2024
Queueing Matching Bandits with Preference Feedback NIPS 2024
Local Linearity: the Key for No-regret Reinforcement Learning in Continuous MDPs NIPS 2024
Disentangling Linear Quadratic Control with Untrusted ML Predictions NIPS 2024
Informative Path Planning with Limited Adaptivity AISTATS 2024
Safe dynamic pricing for nonstationary network resource allocation L4DC 2024
Piecewise-Stationary Bandits with Knapsacks NIPS 2024
Online decision making with history-average dependent costs L4DC 2024
Identifying Copeland Winners in Dueling Bandits with Indifferences AISTATS 2024
Horus: Granular In-Network Task Scheduler for Cloud Datacenters NSDI 2024
Local and Adaptive Mirror Descents in Extensive-Form Games NIPS 2024