📐 Learning Theory

🤖 AAAI2026 · 1 paper notes

📌 Same area in other venues: 🧪 ICML2026 (17) · 🔬 ICLR2026 (4) · 🧠 NeurIPS2025 (20)

A Switching Framework for Online Interval Scheduling with Predictions

For the irrevocable online interval scheduling problem, this paper proposes the SemiTrust-and-Switch framework and the SmoothMerge randomized algorithm. By switching between or blending a prediction-trusting strategy and a classical greedy algorithm, the approach achieves near-optimal performance when predictions are accurate (consistency) and degrades gracefully when predictions are erroneous (robustness and smoothness). Tightness of the framework on specific instances is also established.