Online Algorithms

Forecasting Competitions with Correlated Events AAAI 2025 Full Swap Regret and Discretized Calibration ALT 2025 Gap-Dependent Bounds for Q-Learning using Reference-Advantage Decomposition ICLR 2025 Geometric Resampling in Nearly Linear Time for Follow-the-Perturbed-Leader with Best-of-Both-Worlds Guarantee in Bandit Problems ICML 2025 Gradient Equilibrium in Online Learning: Theory and Applications JMLR 2025 Heavy-Tailed Linear Bandits: Huber Regression with One-Pass Update ICML 2025 Heterogeneous Multi-Agent Bandits with Parsimonious Hints AAAI 2025 Improved and Oracle-Efficient Online ℓ_1-Multicalibration ICML 2025 Improved Bounds for Online Facility Location with Predictions AAAI 2025 Improved Online Confidence Bounds for Multinomial Logistic Bandits ICML 2025 Improved Regret Bounds for Online Fair Division with Bandit Learning AAAI 2025 Improving Community-Participated Patrol for Anti-Poaching AAAI 2025 In-Domain African Languages Translation Using LLMs and Multi-armed Bandits ACL 2025 Instance-Optimal Pure Exploration for Linear Bandits on Continuous Arms ICML 2025 Interval Selection with Binary Predictions IJCAI 2025 Kamino: Efficient VM Allocation at Scale with Latency-Driven Cache-Aware Scheduling OSDI 2025 Label Shift Meets Online Learning: Ensuring Consistent Adaptation with Universal Dynamic Regret CVPR 2025 Large Network UWB Localization: Algorithms and Implementation NSDI 2025 Learning Adversarial MDPs with Stochastic Hard Constraints ICML 2025 Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors ICML 2025 Learning Safe Control via On-the-Fly Bandit Exploration ICML 2025 Learning to Call: A Field Trial of a Collaborative Bandit Algorithm for Optimizing Call Timing in Mobile Maternal Health MLHC 2025 Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals ICML 2025 Learning to Steer Learners in Games ICML 2025 Learning With Multi-Group Guarantees For Clusterable Subpopulations ICML 2025