{"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/competitive-algorithms-for-online-knapsack","title":"Competitive Algorithms for Online Knapsack with Succinct Predictions","arxiv_id":"2406.18752","date":"2024-06-26","proceeding":null,"authors":["Mohammadreza Daneshvaramoli","Helia Karisani","Adam Lechowicz","Bo Sun","Cameron Musco","Mohammad Hajiesmaili"],"abstract":"In the online knapsack problem, the goal is to pack items arriving online with different values and weights into a capacity-limited knapsack to maximize the total value of the accepted items. We study \\textit{learning-augmented} algorithms for this problem, which aim to use machine-learned predictions to move beyond pessimistic worst-case guarantees. Existing learning-augmented algorithms for online knapsack consider relatively complicated prediction models that give an algorithm substantial information about the input, such as the total weight of items at each value. In practice, such predictions can be error-sensitive and difficult to learn. Motivated by this limitation, we introduce a family of learning-augmented algorithms for online knapsack that use \\emph{succinct predictions}. In particular, the machine-learned prediction given to the algorithm is just a single value or interval that estimates the minimum value of any item accepted by an offline optimal solution. By leveraging a relaxation to online \\emph{fractional} knapsack, we design algorithms that can leverage such succinct predictions in both the trusted setting (i.e., with perfect prediction) and the untrusted setting, where we prove that a simple meta-algorithm achieves a nearly optimal consistency-robustness trade-off. Empirically, we show that our algorithms significantly outperform baselines that do not use predictions and often outperform algorithms based on more complex prediction models.","url_abs":"https://arxiv.org/abs/2406.18752v1","url_pdf":"https://arxiv.org/pdf/2406.18752v1.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":"competitive-algorithms-for-online-knapsack","repo_url":"https://github.com/moreda-a/OKP","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"prediction","task_name":"Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2406.18752","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.18752"}},"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":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/moreda-a/OKP","reach":null}],"summary":{"ran_honours":1,"ran":1,"unverified":3},"by_repo_kind":{"official":{"samples":5,"ran":2,"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":5,"samples":[{"code_sha256_prefix":"d2ddfda24bb83b7a","entry":"phi","repo":"moreda-a/OKP","repo_kind":"official","path":"Fig 2a/code.py","file_url":"https://github.com/moreda-a/OKP/blob/HEAD/Fig%202a/code.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"d2ddfda24bb83b7a"}},{"code_sha256_prefix":"4ef02d04dbf73fb9","entry":"phi_inverse","repo":"moreda-a/OKP","repo_kind":"official","path":"Fig 2a/code.py","file_url":"https://github.com/moreda-a/OKP/blob/HEAD/Fig%202a/code.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"4ef02d04dbf73fb9"}},{"code_sha256_prefix":"c0a2be9671493b64","entry":"noadvice","repo":"moreda-a/OKP","repo_kind":"official","path":"Fig 2a/code.py","file_url":"https://github.com/moreda-a/OKP/blob/HEAD/Fig%202a/code.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"c0a2be9671493b64"}},{"code_sha256_prefix":"965f95cee7e1b6a2","entry":"prob_two_noadvice","repo":"moreda-a/OKP","repo_kind":"official","path":"Fig 2a/code.py","file_url":"https://github.com/moreda-a/OKP/blob/HEAD/Fig%202a/code.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"965f95cee7e1b6a2"}},{"code_sha256_prefix":"975736ede36b1e9e","entry":"two_cmpi","repo":"moreda-a/OKP","repo_kind":"official","path":"Fig 2a/code.py","file_url":"https://github.com/moreda-a/OKP/blob/HEAD/Fig%202a/code.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"975736ede36b1e9e"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}