Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 64 tok/s
Gemini 2.5 Pro 40 tok/s Pro
GPT-5 Medium 17 tok/s Pro
GPT-5 High 13 tok/s Pro
GPT-4o 86 tok/s Pro
Kimi K2 208 tok/s Pro
GPT OSS 120B 457 tok/s Pro
Claude Sonnet 4 32 tok/s Pro
2000 character limit reached

Non-clairvoyant Scheduling with Partial Predictions (2405.01013v2)

Published 2 May 2024 in cs.LG, cs.AI, and cs.DS

Abstract: The non-clairvoyant scheduling problem has gained new interest within learning-augmented algorithms, where the decision-maker is equipped with predictions without any quality guarantees. In practical settings, access to predictions may be reduced to specific instances, due to cost or data limitations. Our investigation focuses on scenarios where predictions for only $B$ job sizes out of $n$ are available to the algorithm. We first establish near-optimal lower bounds and algorithms in the case of perfect predictions. Subsequently, we present a learning-augmented algorithm satisfying the robustness, consistency, and smoothness criteria, and revealing a novel tradeoff between consistency and smoothness inherent in the scenario with a restricted number of predictions.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (57)
  1. Paging with succinct predictions. In International Conference on Machine Learning, pages 952–968. PMLR, 2023.
  2. Learning-augmented dynamic power management with multiple states via new ski rental bounds. Advances in Neural Information Processing Systems, 34:16714–16726, 2021.
  3. Online metric algorithms with untrusted predictions. ACM Transactions on Algorithms, 19(2):1–34, 2023.
  4. Secretary and online matching problems with machine learned advice. Advances in Neural Information Processing Systems, 33:7933–7944, 2020.
  5. Customizing ml predictions for online algorithms. In International Conference on Machine Learning, pages 303–313. PMLR, 2020.
  6. A novel prediction setup for online speed-scaling. arXiv preprint arXiv:2112.03082, 2021.
  7. Flow time scheduling with uncertain processing time. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 1070–1080, 2021.
  8. Anonymous. Algorithms for caching and MTS with reduced number of predictions. In The Twelfth International Conference on Learning Representations, 2024.
  9. Barry C Arnold. Pareto distribution. Wiley StatsRef: Statistics Reference Online, pages 1–10, 2014.
  10. Scheduling with untrusted predictions. In Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI, pages 4581–4587, 2022.
  11. Online computation and competitive analysis. cambridge university press, 2005.
  12. Analysis of srpt scheduling: Investigating unfairness. In Proceedings of the 2001 ACM SIGMETRICS International conference on Measurement and modeling of computer systems, pages 279–290, 2001.
  13. Learning augmented energy minimization via speed scaling. Advances in Neural Information Processing Systems, 33:15350–15359, 2020.
  14. The primal-dual method for learning augmented algorithms. Advances in Neural Information Processing Systems, 33:20083–20094, 2020.
  15. Advice querying under budget constraint for online algorithms. In Thirty-seventh Conference on Neural Information Processing Systems, 2023.
  16. Principles of sequencing and scheduling. John Wiley & Sons, 2013.
  17. Robust learning-augmented caching: An experimental study. In International Conference on Machine Learning, pages 1920–1930. PMLR, 2021.
  18. A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research, 47(3):271–292, 1990.
  19. Faster fundamental graph algorithms via learned predictions. In International Conference on Machine Learning, pages 3583–3602. PMLR, 2022.
  20. Optimal robustness-consistency tradeoffs for learning-augmented metrical task systems. In International Conference on Artificial Intelligence and Statistics, pages 9377–9399. PMLR, 2023.
  21. Faster matchings via learned duals. Advances in neural information processing systems, 34:10393–10406, 2021.
  22. Algorithms with prediction portfolios. Advances in neural information processing systems, 35:20273–20286, 2022.
  23. Learning online algorithms with distributional advice. In International Conference on Machine Learning, pages 2687–2696. PMLR, 2021.
  24. Secretaries with advice. In Proceedings of the 22nd ACM Conference on Economics and Computation, pages 409–429, 2021.
  25. Online algorithms with costly predictions. In International Conference on Artificial Intelligence and Statistics, pages 8078–8101. PMLR, 2023.
  26. Optimization and approximation in deterministic sequencing and scheduling: a survey. In Annals of discrete mathematics, volume 5, pages 287–326. Elsevier, 1979.
  27. Online algorithms for rent-or-buy with expert advice. In International Conference on Machine Learning, pages 2319–2327. PMLR, 2019.
  28. Exploiting process lifetime distributions for dynamic load balancing. ACM Transactions on Computer Systems (TOCS), 15(3):253–285, 1997.
  29. Supply chain scheduling: Batching and delivery. Operations Research, 51(4):566–584, 2003.
  30. A dynamic model and an algorithm for short-term supply chain scheduling in the smart factory industry 4.0. International Journal of Production Research, 54(2):386–402, 2016.
  31. Non-clairvoyant scheduling with predictions. In ACM Symposium on Parallelism in Algorithms and Architectures, 2021.
  32. Parsimonious learning-augmented caching. In International Conference on Machine Learning, pages 9588–9601. PMLR, 2022.
  33. A time-driven scheduling model for real-time operating systems. In Rtss, volume 85, pages 112–122, 1985.
  34. Online bipartite matching with advice: Tight robustness-consistency tradeoffs for the two-stage model. Advances in Neural Information Processing Systems, 35:14555–14567, 2022.
  35. The case for learned index structures. In Proceedings of the 2018 international conference on management of data, pages 489–504, 2018.
  36. Sequencing and scheduling: Algorithms and complexity. Handbooks in operations research and management science, 4:445–522, 1993.
  37. Minimalistic predictions to schedule jobs with online precedence constraints. In International Conference on Machine Learning, pages 18563–18583. PMLR, 2023.
  38. Online scheduling via learned weights. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1859–1877. SIAM, 2020.
  39. Learning augmented binary search trees. In International Conference on Machine Learning, pages 13431–13440. PMLR, 2022.
  40. Permutation predictions for non-clairvoyant scheduling. In Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, pages 357–368, 2022.
  41. Complexity of scheduling under precedence constraints. Operations Research, 26(1):22–35, 1978.
  42. Competitive caching with machine learned advice. In International Conference on Machine Learning, pages 3296–3305. PMLR, 2018.
  43. Charles Martel. Preemptive scheduling with release times, deadlines, and due times. Journal of the ACM (JACM), 29(3):812–829, 1982.
  44. Applied online algorithms with heterogeneous predictors. In International Conference on Machine Learning, pages 23484–23497. PMLR, 2023.
  45. Nonclairvoyant scheduling. Theoretical computer science, 130(1):17–47, 1994.
  46. On preemption and learning in stochastic scheduling. In International Conference on Machine Learning, pages 24478–24516. PMLR, 2023.
  47. Revenue optimization with approximate bid predictions. Advances in Neural Information Processing Systems, 30, 2017.
  48. Algorithms with predictions. Communications of the ACM, 65(7):33–35, 2022.
  49. A survey of scheduling rules. Operations research, 25(1):45–61, 1977.
  50. Michael L Pinedo. Scheduling, volume 29. Springer, 2012.
  51. Improving online algorithms via ml predictions. Advances in Neural Information Processing Systems, 31, 2018.
  52. Scheduling algorithms and operating systems support for real-time systems. Proceedings of the IEEE, 82(1):55–67, 1994.
  53. Improved learning-augmented algorithms for the multi-option ski rental problem via best-possible competitive analysis. arXiv preprint arXiv:2302.06832, 2023.
  54. Discrete-convex-analysis-based framework for warm-starting algorithms with predictions. Advances in Neural Information Processing Systems, 35:20988–21000, 2022.
  55. Operating systems for reconfigurable embedded platforms: Online scheduling of real-time tasks. IEEE Transactions on computers, 53(11):1393–1407, 2004.
  56. Optimal robustness-consistency trade-offs for learning-augmented online algorithms. Advances in Neural Information Processing Systems, 33:8042–8053, 2020.
  57. Andrew Chi-Chin Yao. Probabilistic computations: Toward a unified measure of complexity. In 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pages 222–227. IEEE Computer Society, 1977.
Citations (5)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up
Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets

Youtube Logo Streamline Icon: https://streamlinehq.com

YouTube