Online Algorithms
2,404 papers
Papers per year
2
1
1
6
6
10
14
16
36
31
45
48
59
77
91
126
183
229
283
280
341
301
182
36
'5
'10
'15
'20
'25
Papers
Optimal Online Bookmaking for Any Number of Outcomes
COLT 2025
Optimistic Algorithms for Adaptive Estimation of the Average Treatment Effect
ICML 2025
Optimistic Safety for Online Convex Optimization with Unknown Linear Constraints
AISTATS 2025
Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search
AAAI 2025
Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search
ICML 2025
p-Mean Regret for Stochastic Bandits
AAAI 2025
Policy-Regret Minimization in Markov Games with Function Approximation
ICML 2025
Position: Constants are Critical in Regret Bounds for Reinforcement Learning
ICML 2025
Prediction-Aware Learning in Multi-Agent Systems
ICML 2025
Principal-Agent Bandit Games with Self-Interested and Exploratory Learning Agents
ICML 2025
PrioriTouch: Adapting to User Contact Preferences for Whole-Arm Physical Human-Robot Interaction
CoRL 2025
Problem-dependent Regret for Lexicographic Multi-Armed Bandits with Adversarial Corruptions
IJCAI 2025
Procurement Auctions via Approximately Optimal Submodular Optimization
ICML 2025
Provably Efficient Algorithm for Best Scoring Rule Identification in Online Principal-Agent Information Acquisition
ICML 2025
Quantile Multi-Armed Bandits with 1-bit Feedback
ALT 2025
Reputation-aware Revenue Allocation for Auction-based Federated Learning
AAAI 2025
Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel–Young Loss Perspective and Gap-Dependent Regret Analysis
AISTATS 2025
Revisiting Projection-Free Online Learning with Time-Varying Constraints
AAAI 2025
Riemannian Diffusion Adaptation for Distributed Optimization on Manifolds
ICML 2025
Safe Online Convex Optimization with Heavy-Tailed Observation Noises
AAAI 2025
Safety in the Face of Adversity: Achieving Zero Constraint Violation in Online Learning with Slowly Changing Constraints
AISTATS 2025
Sample Efficient Omniprediction and Downstream Swap Regret for Non-Linear Losses
COLT 2025
Scalable Decentralized Algorithms for Online Personalized Mean Estimation
AAAI 2025
Semi-Clairvoyant Scheduling of Speculative Decoding Requests to Minimize LLM Inference Latency
IJCAI 2025
Should Decision-Makers Reveal Classifiers in Online Strategic Classification?
ICML 2025