{"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/optimal-deletion-robust-coreset-for","title":"Coresets remembered and items forgotten: submodular maximization with deletions","arxiv_id":"2203.01241","date":"2022-03-02","proceeding":null,"authors":["Guangyi Zhang","Nikolaj Tatti","Aristides Gionis"],"abstract":"In recent years we have witnessed an increase on the development of methods for submodular optimization, which have been motivated by the wide applicability of submodular functions in real-world data-science problems. In this paper, we contribute to this line of work by considering the problem of robust submodular maximization against unexpected deletions, which may occur due to privacy issues or user preferences. Specifically, we consider the minimum number of items an algorithm has to remember, in order to achieve a non-trivial approximation guarantee against adversarial deletion of up to $d$ items. We refer to the set of items that an algorithm has to keep before adversarial deletions as a deletion-robust coreset. Our theoretical contributions are two-fold. First, we propose a single-pass streaming algorithm that yields a $(1-2\\epsilon)/(4p)$-approximation for maximizing a non-decreasing submodular function under a general p-matroid constraint and requires a coreset of size $k + d/\\epsilon$, where $k$ is the maximum size of a feasible solution. To the best of our knowledge, this is the first work to achieve an (asymptotically) optimal coreset, as no constant-factor approximation is possible with a coreset of size sublinear in $d$. Second, we devise an effective offline algorithm that guarantees stronger approximation ratios with a coreset of size $O(d \\log(k)/\\epsilon)$. We also demonstrate the superior empirical performance of the proposed algorithms in real-life applications.","url_abs":"https://arxiv.org/abs/2203.01241v3","url_pdf":"https://arxiv.org/pdf/2203.01241v3.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":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"optimal-deletion-robust-coreset-for","repo_url":"https://github.com/guangyi-zhang/robust-subm-coreset","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2203.01241","atlas_url":"https://app.syntology.ai/?focus=2203.01241","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.01241"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+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/guangyi-zhang/robust-subm-coreset","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":5},"by_repo_kind":{"official":{"samples":5,"ran":5,"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":"1d15235c08285149","entry":"L1","repo":"guangyi-zhang/robust-subm-coreset","repo_kind":"official","path":"data_scripts/face.py","file_url":"https://github.com/guangyi-zhang/robust-subm-coreset/blob/HEAD/data_scripts/face.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"1d15235c08285149"}},{"code_sha256_prefix":"88585a674103c2e2","entry":"ge","repo":"guangyi-zhang/robust-subm-coreset","repo_kind":"official","path":"robustcore/util.py","file_url":"https://github.com/guangyi-zhang/robust-subm-coreset/blob/HEAD/robustcore/util.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"88585a674103c2e2"}},{"code_sha256_prefix":"51494de15a346b17","entry":"gt","repo":"guangyi-zhang/robust-subm-coreset","repo_kind":"official","path":"robustcore/util.py","file_url":"https://github.com/guangyi-zhang/robust-subm-coreset/blob/HEAD/robustcore/util.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"51494de15a346b17"}},{"code_sha256_prefix":"38a7ab12d742c767","entry":"le","repo":"guangyi-zhang/robust-subm-coreset","repo_kind":"official","path":"robustcore/util.py","file_url":"https://github.com/guangyi-zhang/robust-subm-coreset/blob/HEAD/robustcore/util.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"38a7ab12d742c767"}},{"code_sha256_prefix":"d5651103e31b3a50","entry":"parse_file_name","repo":"guangyi-zhang/robust-subm-coreset","repo_kind":"official","path":"data_scripts/face.py","file_url":"https://github.com/guangyi-zhang/robust-subm-coreset/blob/HEAD/data_scripts/face.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"d5651103e31b3a50"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}