online algorithm

Fairness in the Multi-Secretary Problem AAAI 2026 Learning-Augmented Ski Rental with Discrete Distribution: A Bayesian Approach AAAI 2026 Near-optimal Swap Regret Minimization for Convex Losses COLT 2026 Online and Offline Learning of Orderly Hypergraphs Using Queries ALT 2026 Online Caching in Tree Networks: Algorithms, Regret, and Complexity L4DC 2026 Online Fair Allocations with Binary Valuations and Beyond AAAI 2026 Online Fair Allocation with Demand-Side Time-Dependent Weight UAI 2026 Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs COLT 2026 Ordinal Secretaries with Advice AAAI 2026 An Online Adaptive Sampling Algorithm for Stochastic Difference-of-convex Optimization with Time-varying Distributions ICML 2025 A Survey on Bandit Learning in Matching Markets IJCAI 2025 Augmenting Online Algorithms for Knapsack Problem with Total Weight Information AAAI 2025 Compression Barriers in Autoregressive Transformers COLT 2025 Fast Direct: Query-Efficient Online Black-box Guidance for Diffusion-model Target Generation ICLR 2025 From Fairness to Infinity: Outcome-Indistinguishable (Omni)Prediction in Evolving Graphs COLT 2025 Heterogeneous Multi-Agent Bandits with Parsimonious Hints AAAI 2025 High-Dimensional Prediction for Sequential Decision Making ICML 2025 Improved Bounds for Online Facility Location with Predictions AAAI 2025 Improved Regret Bounds for Online Fair Division with Bandit Learning AAAI 2025 Interval Selection with Binary Predictions IJCAI 2025 Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors ICML 2025 Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems AISTATS 2025 Learning With Multi-Group Guarantees For Clusterable Subpopulations ICML 2025 Lexicographic Lipschitz Bandits: New Algorithms and a Lower Bound JMLR 2025 List Update with Prediction AAAI 2025