← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Class Fairness in Online Matching AAAI 2023
Generalized Implicit Follow-The-Regularized-Leader ICML 2023
TS-UCB: Improving on Thompson Sampling With Little to No Additional Computation AISTATS 2023
Efficient Algorithms for Regret Minimization in Billboard Advertisement (Student Abstract) AAAI 2023
Competing against Adaptive Strategies in Online Learning via Hints AISTATS 2023
Optimal No-Regret Learning for One-Sided Lipschitz Functions ICML 2023
Optimal Execution via Multi-Objective Multi-Armed Bandits (Student Abstract) AAAI 2023
Adapting to game trees in zero-sum imperfect information games ICML 2023
Last Switch Dependent Bandits with Monotone Payoff Functions ICML 2023
Solving Linear Programs with Fast Online Learning Algorithms ICML 2023
Doubly Fair Dynamic Pricing AISTATS 2023
Online Learning with Feedback Graphs: The True Shape of Regret ICML 2023
Dynamic Pricing with Volume Discounts in Online Settings AAAI 2023
Online Nonstochastic Control with Adversarial and Static Constraints ICML 2023
Gradient-Variation Bound for Online Convex Optimization with Constraints AAAI 2023
Optimal robustness-consistency tradeoffs for learning-augmented metrical task systems AISTATS 2023
Optimistic Whittle Index Policy: Online Learning for Restless Bandits AAAI 2023
An Information-Theoretic Analysis of Nonstationary Bandit Learning ICML 2023
Incentive-aware Contextual Pricing with Non-parametric Market Noise AISTATS 2023
Federated Online and Bandit Convex Optimization ICML 2023
Stochastic Contextual Bandits with Long Horizon Rewards AAAI 2023
Learning to Bid in Repeated First-Price Auctions with Budgets ICML 2023
Distributed Projection-Free Online Learning for Smooth and Convex Losses AAAI 2023
Non-stationary Experimental Design under Linear Trends NIPS 2023
Active Cost-aware Labeling of Streaming Data AISTATS 2023