{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/190409354","title":"Submodular Maximization Beyond Non-negativity: Guarantees, Fast Algorithms, and Applications","arxiv_id":"1904.09354","date":"2019-04-19","proceeding":null,"authors":["Christopher Harshaw","Moran Feldman","Justin Ward","Amin Karbasi"],"abstract":"It is generally believed that submodular functions -- and the more general\nclass of $\\gamma$-weakly submodular functions -- may only be optimized under\nthe non-negativity assumption $f(S) \\geq 0$. In this paper, we show that once\nthe function is expressed as the difference $f = g - c$, where $g$ is monotone,\nnon-negative, and $\\gamma$-weakly submodular and $c$ is non-negative modular,\nthen strong approximation guarantees may be obtained. We present an algorithm\nfor maximizing $g - c$ under a $k$-cardinality constraint which produces a\nrandom feasible set $S$ such that $\\mathbb{E} \\left[ g(S) - c(S) \\right] \\geq\n(1 - e^{-\\gamma} - \\epsilon) g(OPT) - c(OPT)$, whose running time is $O\n(\\frac{n}{\\epsilon} \\log^2 \\frac{1}{\\epsilon})$, i.e., independent of $k$. We\nextend these results to the unconstrained setting by describing an algorithm\nwith the same approximation guarantees and faster $O(\\frac{n}{\\epsilon}\n\\log\\frac{1}{\\epsilon})$ runtime. The main techniques underlying our algorithms\nare two-fold: the use of a surrogate objective which varies the relative\nimportance between $g$ and $c$ throughout the algorithm, and a geometric sweep\nover possible $\\gamma$ values. Our algorithmic guarantees are complemented by a\nhardness result showing that no polynomial-time algorithm which accesses $g$\nthrough a value oracle can do better. We empirically demonstrate the success of\nour algorithms by applying them to experimental design on the Boston Housing\ndataset and directed vertex cover on the Email EU dataset.","url_abs":"http://arxiv.org/abs/1904.09354v1","url_pdf":"http://arxiv.org/pdf/1904.09354v1.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":"190409354","repo_url":"https://github.com/crharshaw/submodular-minus-linear","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"experimental-design","task_name":"Experimental Design"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1904.09354","atlas_url":"https://app.syntology.ai/?focus=1904.09354","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1904.09354"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1904.09354\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1904.09354"},"call":"get_concepts_for_paper(arxiv_id=\"1904.09354\")"}],"by_repo":[{"repo":"crharshaw/submodular-minus-linear","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"a51cbf093e62f29775896695c8eacdf8fad73e0473b07aceec644af62969cd86","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}