{"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/the-fast-algorithm-for-submodular","title":"The FAST Algorithm for Submodular Maximization","arxiv_id":"1907.06173","date":"2019-07-14","proceeding":"ICML 2020 1","authors":["Adam Breuer","Eric Balkanski","Yaron Singer"],"abstract":"In this paper we describe a new algorithm called Fast Adaptive Sequencing Technique (FAST) for maximizing a monotone submodular function under a cardinality constraint $k$ whose approximation ratio is arbitrarily close to $1-1/e$, is $O(\\log(n) \\log^2(\\log k))$ adaptive, and uses a total of $O(n \\log\\log(k))$ queries. Recent algorithms have comparable guarantees in terms of asymptotic worst case analysis, but their actual number of rounds and query complexity depend on very large constants and polynomials in terms of precision and confidence, making them impractical for large data sets. Our main contribution is a design that is extremely efficient both in terms of its non-asymptotic worst case query complexity and number of rounds, and in terms of its practical runtime. We show that this algorithm outperforms any algorithm for submodular maximization we are aware of, including hyper-optimized parallel versions of state-of-the-art serial algorithms, by running experiments on large data sets. These experiments show FAST is orders of magnitude faster than the state-of-the-art.","url_abs":"https://arxiv.org/abs/1907.06173v1","url_pdf":"https://arxiv.org/pdf/1907.06173v1.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":"the-fast-algorithm-for-submodular","repo_url":"https://github.com/luccote/msm-primal-dual","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"the-fast-algorithm-for-submodular","repo_url":"https://github.com/submodularcode/About","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1907.06173","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.06173"}},"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/submodularcode/About","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/luccote/msm-primal-dual","reach":null}],"summary":{"ran_draft_wrong":2,"ran_violates":1,"ran_honours":1},"by_repo_kind":{"listed":{"samples":4,"ran":4,"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":4,"samples":[{"code_sha256_prefix":"f76560166d44e3a3","entry":"greedy","repo":"luccote/msm-primal-dual","repo_kind":"listed","path":"src/submodular.py","file_url":"https://github.com/luccote/msm-primal-dual/blob/HEAD/src/submodular.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"none","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"f76560166d44e3a3"}},{"code_sha256_prefix":"f8bab31130ea6b93","entry":"mean","repo":"luccote/msm-primal-dual","repo_kind":"listed","path":"visuals/objective_visualizer.py","file_url":"https://github.com/luccote/msm-primal-dual/blob/HEAD/visuals/objective_visualizer.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"f8bab31130ea6b93"}},{"code_sha256_prefix":"47e270c462e2d6fc","entry":"method3","repo":"luccote/msm-primal-dual","repo_kind":"listed","path":"src/submodular.py","file_url":"https://github.com/luccote/msm-primal-dual/blob/HEAD/src/submodular.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"47e270c462e2d6fc"}},{"code_sha256_prefix":"30629e74b5b57400","entry":"primal_dual","repo":"luccote/msm-primal-dual","repo_kind":"listed","path":"src/submodular.py","file_url":"https://github.com/luccote/msm-primal-dual/blob/HEAD/src/submodular.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"none","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"30629e74b5b57400"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}