{"id":"https://openalex.org/W7165626860","doi":"https://doi.org/10.48550/arxiv.2606.20777","title":"Sparsify Submodular Functions under Cardinality Constraints","display_name":"Sparsify Submodular Functions under Cardinality Constraints","publication_year":2026,"publication_date":"2026-06-18","ids":{"openalex":"https://openalex.org/W7165626860","doi":"https://doi.org/10.48550/arxiv.2606.20777"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.20777","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.20777","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.20777","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5139201582","display_name":"Zhengting Bao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bao, Zhengting","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139215298","display_name":"Dongrun Cai","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cai, Dongrun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5139188178","display_name":"Xue Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Xue","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9277999997138977,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9277999997138977,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.02370000071823597,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.006800000090152025,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.963100016117096},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.8557999730110168},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6014000177383423},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5460000038146973},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4462999999523163},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.29510000348091125}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.963100016117096},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.8557999730110168},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6607999801635742},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6014000177383423},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5963000059127808},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5460000038146973},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5259000062942505},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4462999999523163},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.29510000348091125},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.28600001335144043},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.2791999876499176},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.27570000290870667},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2680000066757202},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26030001044273376}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.20777","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.20777","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.20777","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.20777","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Submodular":[0],"sparsification":[1,5,30,71],"generalizes":[2],"the":[3,17,59,76,112,141,149,199,203,209,217,240,270],"classical":[4],"problems":[6],"of":[7,13,20,31,62,91,97,102,114,134,143,165,173,185,193,211,219,269,272],"graphs":[8],"and":[9,68,85,224,243,250],"matrices":[10],"to":[11,132,247,260,266],"summations":[12,192],"submodular":[14,22,63,70,82,98,195],"functions.":[15,196],"Given":[16],"summation":[18],"$F(S):=f_1(S)+\\cdots+f_m(S)$":[19],"$m$":[21],"functions":[23,64,99],"$f_1,\\ldots,f_m:\\{0,1\\}^n":[24],"\\to":[25],"\\mathbb{R}_{\\ge":[26],"0}$.":[27],"An":[28],"size-$s$":[29],"$F$":[32],"is":[33,106,151],"a":[34,107,233,262,267],"weight":[35],"vector":[36],"$w":[37],"\\in":[38],"\\mathbb{R}^m_{\\ge":[39],"0}$":[40],"such":[41,128,232],"that":[42],"$w_1":[43,152],"f_1(S)":[44,153],"+":[45,154],"\\cdots":[46,155],"w_m":[47,156],"f_m(S)":[48,157],"\\approx":[49,158],"F(S)$":[50,159],"for":[51,160,191,202],"every":[52,161],"subset":[53],"$S":[54],"\\subset":[55],"[n]$.":[56],"Motivated":[57],"by":[58,116],"wide":[60],"applications":[61],"in":[65,75,163],"data":[66],"mining":[67],"economics,":[69],"has":[72],"been":[73],"studied":[74],"last":[77],"few":[78],"years.":[79],"For":[80],"general":[81,204],"functions,":[83],"Kenneth":[84,249],"Krauthgamer":[86],"provided":[87],"an":[88,182,257],"efficient":[89,183,258],"construction":[90,184],"size":[92,103,113,135,142,174],"$O(n^3)$.":[93],"Although":[94],"several":[95,226],"families":[96,228],"admit":[100,231],"sparsifiers":[101,115,144,172,190,215],"$\\tilde{O}(n)$,":[104],"there":[105,171],"lower":[108],"bound":[109,201],"$\u03a9(n^2)$":[110,200],"on":[111],"Cohen":[117],"et":[118],"al.":[119],"In":[120,253],"this":[121],"work,":[122],"we":[123,207,255],"study":[124],"whether":[125],"cardinality":[126,166,220,276],"constraints,":[127],"as":[129],"restricting":[130],"$S$":[131,162],"subsets":[133],"at":[136,167,221],"most":[137,168,222],"$k$,":[138,169],"could":[139],"reduce":[140],"or":[145],"not.":[146],"Namely,":[147],"if":[148],"guaranty":[150],"$[n]$":[164],"are":[170],"smaller":[175],"than":[176],"$o(n^2)$?":[177],"Our":[178],"main":[179],"result":[180],"shows":[181],"size-$O(n":[186],"k^2":[187],"\\log":[188,213],"n)$":[189],"arbitrary":[194],"This":[197],"improves":[198],"setting.":[205],"Then":[206],"consider":[208],"existence":[210],"size-$(k":[212],"n)^{O(1)}$":[214],"under":[216,275],"constraint":[218],"$k$":[223],"show":[225],"natural":[227],"do":[229],"not":[230],"small":[234],"sparsifier.":[235],"Technically,":[236],"our":[237],"algorithm":[238,246,259],"applies":[239],"Lov\u00e1sz":[241],"extension":[242],"Edmonds'":[244],"greedy":[245],"extend":[248],"Krauthgamer's":[251],"approach.":[252],"particular,":[254],"provide":[256,261],"tight":[263],"estimate":[264],"(up":[265],"constant)":[268],"sensitivity":[271],"each":[273],"$f_i$":[274],"constraints.":[277]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-24T00:00:00"}