Research map / Bandits and online learning / Online convex optimization and games
On Smoothness Bounds for Non-Clairvoyant Scheduling with Predictions
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Non-clairvoyant Scheduling with Partial Predictions (ICML 2024 · similarity 0.90)
- Non-Clairvoyant Scheduling with Progress Bars (NeurIPS 2025 · similarity 0.86)
- Improved Bounds for Online Facility Location with Predictions (AAAI 2025 · similarity 0.86)
- Freya PAGE: First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations (NeurIPS 2024 · similarity 0.85)
- Algorithms with Calibrated Machine Learning Predictions (ICML 2025 · similarity 0.84)
- Capacity-Constrained Online Convex Optimization with Delayed Feedback (NeurIPS 2026 · similarity 0.84)
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.