Online Algorithms

Adaptive Weighted Averaging COLT 2026 Algorithm Design and Stronger Guarantees for the Improving Multi-Armed Bandits Problem UAI 2026 An Anytime Algorithm for Good Arm Identification JMLR 2026 A simple, optimal and efficient algorithm for online exp-concave optimization COLT 2026 A Tight Lower Bound for Non-stochastic Multi-armed Bandits with Expert Advice COLT 2026 Best Arm Identification with Minimal Regret JMLR 2026 DFDT: Dynamic Fast Decision Tree for IoT Data Stream Mining on Edge Devices AAAI 2026 Efficient Swap Multicalibration of Elicitable Properties COLT 2026 Gradient-Variation Regret Bounds for Unconstrained Online Learning COLT 2026 How to Set β_1, β_2 in Adam: An Online Learning Perspective ALT 2026 Invited Open Problem: Online Optimization of Piecewise-Lipschitz Functions with Applications to Data-Driven Algorithm Design COLT 2026 Learning-based Optimal Admission Control for Erlang-B Queuing Systems UAI 2026 Learning Periodic Strategies in Blocking Bandits Is as Hard as Bandits with Switching Costs COLT 2026 Leveraging Similarities in Multi-Armed Bandits COLT 2026 Merlin: An Efficient Adaptive Cache Eviction Algorithm via Fine-Grained Characterization OSDI 2026 Near Optimal Convergence to Coarse Correlated Equilibrium in General-Sum Markov Games L4DC 2026 Near-optimal Swap Regret Minimization for Convex Losses COLT 2026 Omniprediction with Long-Term Constraints COLT 2026 Online Convex Optimization with Sublinear Noisy Probes COLT 2026 Online Covering with Multiple Experts ALT 2026 Online Market Making and the Value of Observing the Order Book COLT 2026 On the Sublinear Regret of Continuous K-Max Bandits UAI 2026 Refined Risk Bounds for Unbounded Losses via Transductive Priors JMLR 2026 Smoothed Online Optimization for Target Tracking: Robust and Learning-Augmented Algorithms ALT 2026 Swap Regret Minimization Through Response-Based Approachability COLT 2026