Online Algorithms

SIRD: A Sender-Informed, Receiver-Driven Datacenter Transport Protocol NSDI 2025 Smoothed Online Convex Optimization with Delayed Feedback IJCAI 2025 Solving Multiagent Path Finding on Highly Centralized Networks AAAI 2025 Sparse-pivot: Dynamic correlation clustering for node insertions ICML 2025 Sparsity-Based Interpolation of External, Internal and Swap Regret COLT 2025 Strategic A/B testing via Maximum Probability-driven Two-armed Bandit ICML 2025 Strategyproof Matching of Roommates and Rooms AAAI 2025 Stronger Neyman Regret Guarantees for Adaptive Experimental Design ICML 2025 The Benefits and Limitations of User Interrupts for Preemptive Userspace Scheduling NSDI 2025 The Relationship Between No-Regret Learning and Online Conformal Prediction ICML 2025 Tokenized Bandit for LLM Decoding and Alignment ICML 2025 Tracking Most Significant Shifts in Infinite-Armed Bandits ICML 2025 Tracking The Best Expert Privately ICML 2025 Trade-Offs Between Information and Crowding in Sequential Decisions (Student Abstract) AAAI 2025 Unconstrained Robust Online Convex Optimization ICML 2025 Universal Online Convex Optimization Meets Second-order Bounds JMLR 2025 Vib2Move: In-hand Object Reconfiguration via Fingertip Micro-vibrations RSS 2025 Wait-Less Offline Tuning and Re-solving for Online Decision Making ICML 2025 A Best-of-both-worlds Algorithm for Bandits with Delayed Feedback with Robustness to Excessive Delays NeurIPS 2024 Accelerated Regularized Learning in Finite N-Person Games NeurIPS 2024 Accelerating Matroid Optimization through Fast Imprecise Oracles NeurIPS 2024 Achieving Õ(1/ε) Sample Complexity for Constrained Markov Decision Process NeurIPS 2024 Active Ranking and Matchmaking, with Perfect Matchings ICML 2024 Adaptive Conformal Inference by Betting ICML 2024 Adaptive Experimentation When You Can't Experiment NeurIPS 2024