Online Algorithms

A Polynomial-time Algorithm for Online Sparse Linear Regression with Improved Regret Bound under Weaker Conditions COLT 2025 App2Exa: Accelerating Exact kNN Search via Dynamic Cache-Guided Approximation IJCAI 2025 Approximating Optimal Labelings for Temporal Connectivity AAAI 2025 Approximation algorithms for combinatorial optimization with predictions ICLR 2025 Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching ACL 2025 A Survey on Bandit Learning in Matching Markets IJCAI 2025 A Trichotomy for List Transductive Online Learning ICML 2025 Attractor-based Closed List Search: Sparsifying the Closed List for Efficient Memory-Constrained Planning IJCAI 2025 Augmenting Online Algorithms for Knapsack Problem with Total Weight Information AAAI 2025 A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPs JMLR 2025 Automatic Selection of Macro-Events for Heuristic-Search Temporal Planning AAAI 2025 AutoML Algorithms for Online Generalized Additive Model Selection: Application to Electricity Demand Forecasting AutoML 2025 Avoiding Catastrophe in Online Learning by Asking for Help ICML 2025 Best of Both Worlds: Regret Minimization versus Minimax Play ICML 2025 Beyond Worst-Case Online Classification: VC-Based Regret Bounds for Relaxed Benchmarks COLT 2025 Black-Box Reductions for Decentralized Online Convex Optimization in Changing Environments COLT 2025 Building Massive MIMO Baseband Processing on a Single-Node Supercomputer NSDI 2025 Cap-and-Penalize: Competitive Mechanisms for Multi-Phase Regularized Online Allocation IJCAI 2025 Causal Learning Meet Covariates: Empowering Lightweight and Effective Nationwide Air Quality Forecasting IJCAI 2025 Center-Based Approximation of a Drifting Distribution ALT 2025 Clustering with bandit feedback: breaking down the computation/information gap ALT 2025 Competing Bandits in Matching Markets via Super Stability ICML 2025 Competitively Consistent Clustering ICML 2025 Computational Intractability of Strategizing against Online Learners COLT 2025 Computing Optimal Regularizers for Online Linear Optimization COLT 2025