Online Algorithms
1,013 papers
Papers per year
1
1
2
4
6
6
10
10
24
27
41
45
35
43
36
35
60
104
108
93
117
124
54
27
'10
'15
'20
'25
Papers
Improved Algorithms for Contextual Dynamic Pricing
NeurIPS 2024
Improved Bandits in Many-to-One Matching Markets with Incentive Compatibility
AAAI 2024
Improved Guarantees for Fully Dynamic k-Center Clustering with Outliers in General Metric Spaces
NeurIPS 2024
Improved learning rates in multi-unit uniform price auctions
NeurIPS 2024
Improved Regret for Bandit Convex Optimization with Delayed Feedback
NeurIPS 2024
Improved Regret of Linear Ensemble Sampling
NeurIPS 2024
Learning-Augmented Online Algorithm for Two-Level Ski-Rental Problem
AAAI 2024
Learning from Snapshots of Discrete and Continuous Data Streams
NeurIPS 2024
Learning No-Regret Sparse Generalized Linear Models with Varying Observation(s)
ICLR 2024
Learning to Price Homogeneous Data
NeurIPS 2024
Linear bandits with polylogarithmic minimax regret
COLT 2024
Local Anti-Concentration Class: Logarithmic Regret for Greedy Linear Contextual Bandit
NeurIPS 2024
Low-Distortion Clustering with Ordinal and Limited Cardinal Information
AAAI 2024
Model-Based Best Arm Identification for Decreasing Bandits
AISTATS 2024
Multiclass Transductive Online Learning
NeurIPS 2024
Nearly Optimal Regret for Decentralized Online Convex Optimization
COLT 2024
Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs
NeurIPS 2024
Near-optimal Per-Action Regret Bounds for Sleeping Bandits
AISTATS 2024
Neural Active Learning Meets the Partial Monitoring Framework
UAI 2024
New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem
AAAI 2024
No Internal Regret with Non-convex Loss Functions
AAAI 2024
Non-stationary Projection-Free Online Learning with Dynamic and Adaptive Regret Guarantees
AAAI 2024
No-Regret Algorithms for Safe Bayesian Optimization with Monotonicity Constraints
AISTATS 2024
No-Regret Bandit Exploration based on Soft Tree Ensemble Model
NeurIPS 2024
No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and NP-Hardness of Adversarial Full-Information Setting
NeurIPS 2024