Co-occurring keywords · papers mentioning both
Papers
A Switching Framework for Online Interval Scheduling with Predictions
AAAI 2026
Online Covering with Multiple Experts
ALT 2026
Sample-and-Search: An Effective Algorithm for Learning-Augmented k-Median Clustering in High Dimensions
AAAI 2026
Smoothed Online Optimization for Target Tracking: Robust and Learning-Augmented Algorithms
ALT 2026
Augmenting Online Algorithms for Knapsack Problem with Total Weight Information
AAAI 2025
Competitive Fair Scheduling with Predictions
ICLR 2025
Improved Bounds for Online Facility Location with Predictions
AAAI 2025
Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
AISTATS 2025
Learning-Augmented Frequent Directions
ICLR 2025
Learning-Augmented Search Data Structures
ICLR 2025
Minimalistic Predictions for Online Class Constraint Scheduling
ICLR 2025
On Tradeoffs in Learning-Augmented Algorithms
AISTATS 2025
Polynomial Time Learning Augmented Algorithms for NP-hard Permutation Problems
ICML 2025
Bandits with Knapsacks and Predictions
UAI 2024
Contract Scheduling with Distributional and Multiple Advice
IJCAI 2024
Fair Secretaries with Unfair Predictions
NeurIPS 2024
Learning-Augmented Algorithms for the Bahncard Problem
NeurIPS 2024
Learning-Augmented Algorithms with Explicit Predictors
NeurIPS 2024
Learning-Augmented Dynamic Submodular Maximization
NeurIPS 2024
Learning-Augmented Online Algorithm for Two-Level Ski-Rental Problem
AAAI 2024
Learning-Augmented Priority Queues
NeurIPS 2024
Mechanism design augmented with output advice
NeurIPS 2024
Online Budgeted Matching with General Bids
NeurIPS 2024
Plant-and-Steal: Truthful Fair Allocations via Predictions
NeurIPS 2024
Randomized Learning-Augmented Auctions with Revenue Guarantees
IJCAI 2024