{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/learning-augmented-energy-minimization-via","title":"Learning Augmented Energy Minimization via Speed Scaling","arxiv_id":"2010.11629","date":"2020-10-22","proceeding":"NeurIPS 2020 12","authors":["Étienne Bamas","Andreas Maggiori","Lars Rohwedder","Ola Svensson"],"abstract":"As power management has become a primary concern in modern data centers, computing resources are being scaled dynamically to minimize energy consumption. We initiate the study of a variant of the classic online speed scaling problem, in which machine learning predictions about the future can be integrated naturally. Inspired by recent work on learning-augmented online algorithms, we propose an algorithm which incorporates predictions in a black-box manner and outperforms any online algorithm if the accuracy is high, yet maintains provable guarantees if the prediction is very inaccurate. We provide both theoretical and experimental evidence to support our claims.","url_abs":"https://arxiv.org/abs/2010.11629v1","url_pdf":"https://arxiv.org/pdf/2010.11629v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"learning-augmented-energy-minimization-via","repo_url":"https://github.com/andreasr27/LAS","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"management","task_name":"Management"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2010.11629","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11629"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/andreasr27/LAS","reach":null}],"summary":{"unverified":5},"by_repo_kind":{"official":{"samples":5,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"8c30311e503bcc2e","entry":"Avg_rate","repo":"andreasr27/las","repo_kind":"official","path":"scheduling_algorithms.py","file_url":"https://github.com/andreasr27/las/blob/HEAD/scheduling_algorithms.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"8c30311e503bcc2e"}},{"code_sha256_prefix":"8f58769880d7a386","entry":"BKP_alg","repo":"andreasr27/las","repo_kind":"official","path":"scheduling_algorithms.py","file_url":"https://github.com/andreasr27/las/blob/HEAD/scheduling_algorithms.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"8f58769880d7a386"}},{"code_sha256_prefix":"5f8c87a1668b1696","entry":"LAS","repo":"andreasr27/LAS","repo_kind":"official","path":"scheduling_algorithms.py","file_url":"https://github.com/andreasr27/LAS/blob/HEAD/scheduling_algorithms.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"5f8c87a1668b1696"}},{"code_sha256_prefix":"f43dfe6e4d2c4500","entry":"OptimalOnline","repo":"andreasr27/las","repo_kind":"official","path":"scheduling_algorithms.py","file_url":"https://github.com/andreasr27/las/blob/HEAD/scheduling_algorithms.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"f43dfe6e4d2c4500"}},{"code_sha256_prefix":"4a59bfa5bda26c98","entry":"Optimal_Alg","repo":"andreasr27/LAS","repo_kind":"official","path":"scheduling_algorithms.py","file_url":"https://github.com/andreasr27/LAS/blob/HEAD/scheduling_algorithms.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"4a59bfa5bda26c98"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}