AI Paper Atlas

Research map / Bandits and online learning / Online convex optimization and games

Competitive Fair Scheduling with Predictions

Tianming Zhao, Chunqiu xia, Xiaomin Chang, Chunhao Li, Wei Li, Albert Zomaya

ICLR 2025 · Bandits and online learning › Online convex optimization and games · approach: Learning-augmented online algorithms

Read the paperCheck your idea against 137,217 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Studies online non-clairvoyant scheduling to minimize max-stretch in the learning-augmented setting, using possibly imperfect job size predictions.

Problem

Online non-clairvoyant scheduling to minimize max-stretch when the scheduler has access to imperfect job size predictions.

Approach

A family of learning-augmented algorithms (Relaxed-fair-style scheduling) that uses job size predictions to obtain guarantees tied to prediction quality while remaining competitive in the worst case.

Experimental setup

Metrics: max-stretch competitive ratio

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy