#machine learning
Sep 2026
Nonpreemptive Scheduling While Learning Context-Dependent Service Rates
Learn--Clear--Plan (LCP), which estimates the system and uses the resulting Bellman recursion to make horizon-dependent decisions, and suggests an estimated-SEPT algorithm that achieves a tracking error of $\widetilde{O}(\sqrt{d/t})$ without knowing the model.
Wan-Kyu Choi, Seoungbin Bae, Dabeen Lee
· arXiv.org · 0 citations