{"id":"https://openalex.org/W7140209340","doi":"https://doi.org/10.48550/arxiv.2603.21492","title":"Multinoulli Extension: A Lossless Continuous Relaxation for Partition-Constrained Subset Selection","display_name":"Multinoulli Extension: A Lossless Continuous Relaxation for Partition-Constrained Subset Selection","publication_year":2026,"publication_date":"2026-03-23","ids":{"openalex":"https://openalex.org/W7140209340","doi":"https://doi.org/10.48550/arxiv.2603.21492"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.21492","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.21492","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.2603.21492","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Zhang, Qixin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Qixin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Huang, Wei","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huang, Wei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Sun, Yan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sun, Yan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Shu, Yao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shu, Yao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Yu, Yi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yu, Yi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Tao, Dacheng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tao, Dacheng","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.840499997138977,"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.840499997138977,"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.025299999862909317,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.015599999576807022,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.7347000241279602},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.6385999917984009},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5809000134468079},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4616999924182892},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4546999931335449},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.4334999918937683},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.40459999442100525},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.399399995803833},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.3971000015735626}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7347000241279602},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.6385999917984009},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5809000134468079},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5623999834060669},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4668000042438507},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4616999924182892},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4546999931335449},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.4334999918937683},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42669999599456787},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.40459999442100525},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.399399995803833},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.3971000015735626},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3950999975204468},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.38659998774528503},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38609999418258667},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.37220001220703125},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.35749998688697815},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.34049999713897705},{"id":"https://openalex.org/C177769412","wikidata":"https://www.wikidata.org/wiki/Q278090","display_name":"Prior probability","level":3,"score":0.3382999897003174},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.3249000012874603},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.28290000557899475},{"id":"https://openalex.org/C2775973920","wikidata":"https://www.wikidata.org/wiki/Q3252726","display_name":"Selection algorithm","level":3,"score":0.27410000562667847},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.26969999074935913},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2694000005722046},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2669999897480011},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.2662000060081482},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.2599000036716461},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.2572999894618988}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.21492","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.21492","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.21492","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.21492","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Identifying":[0],"the":[1,11,26,40,70,75,87,116,137,154,159,166,213],"most":[2],"representative":[3],"subset":[4,139,172,216],"for":[5,43,170,191,212],"a":[6,16,56,102,147,174,187],"close-to-submodular":[7],"objective":[8,88],"while":[9],"satisfying":[10],"predefined":[12],"partition":[13,144,220],"constraint":[14],"is":[15,64,90,125,181],"fundamental":[17],"task":[18],"with":[19,79,108,165],"numerous":[20],"applications":[21],"in":[22],"machine":[23],"learning.":[24],"However,":[25],"existing":[27],"distorted":[28,76],"local-search":[29,77],"methods":[30,78],"are":[31],"often":[32],"hindered":[33],"by":[34],"their":[35],"prohibitive":[36],"query":[37],"complexities":[38],"and":[39,210],"rigid":[41],"requirement":[42],"prior":[44],"knowledge":[45],"of":[46,104,121,177],"difficult-to-obtain":[47],"structural":[48],"parameters.":[49],"To":[50],"overcome":[51],"these":[52],"limitations,":[53],"we":[54,201],"introduce":[55],"novel":[57,205],"algorithm":[58,99,124],"titled":[59],"Multinoulli-SCG,":[60],"which":[61,133],"not":[62],"only":[63,109],"parameter-free,":[65],"but":[66],"also":[67,202],"can":[68,100,134],"achieve":[69],"same":[71],"approximation":[72],"guarantees":[73],"as":[74],"significantly":[80],"fewer":[81],"function":[82,89,111],"evaluations.":[83],"More":[84],"specifically,":[85],"when":[86],"monotone":[91],"$\u03b1$-weakly":[92],"DR-submodular":[93],"or":[94,106],"$(\u03b3,\u03b2)$-weakly":[95],"submodular,":[96],"our":[97,122,178,198],"Multinoulli-SCG":[98,123],"attain":[101],"value":[103],"$(1-e^{-\u03b1})\\text{OPT}-\u03b5$":[105],"$(\\frac{\u03b3^{2}(1-e^{-(\u03b2(1-\u03b3)+\u03b3^2)})}{\u03b2(1-\u03b3)+\u03b3^2})\\text{OPT}-\u03b5$":[107],"$O(1/\u03b5^{2})$":[110],"evaluations,":[112],"where":[113],"OPT":[114],"denotes":[115],"optimal":[117,155],"value.":[118],"The":[119],"cornerstone":[120],"an":[126],"innovative":[127],"continuous-relaxation":[128],"framework":[129],"named":[130],"Multinoulli":[131],"Extension(ME),":[132],"effectively":[135],"convert":[136],"discrete":[138],"selection":[140,217],"problem":[141],"subject":[142],"to":[143,185],"constraints":[145],"into":[146],"solvable":[148],"continuous":[149],"maximization":[150],"focused":[151],"on":[152,197],"learning":[153],"multinoulli":[156],"priors":[157],"across":[158],"concerned":[160],"partition.":[161],"In":[162],"sharp":[163],"contrast":[164],"well-established":[167],"multi-linear":[168],"extension":[169],"submodular":[171],"selection,":[173],"notable":[175],"advantage":[176],"proposed":[179,199],"ME":[180],"its":[182],"intrinsic":[183],"capacity":[184],"provide":[186],"lossless":[188],"rounding":[189],"scheme":[190],"any":[192],"set":[193],"function.":[194],"Furthermore,":[195],"based":[196],"ME,":[200],"present":[203],"two":[204],"online":[206,215],"algorithms,":[207],"namely,":[208],"Multinoulli-OSCG":[209],"Multinoulli-OSGA,":[211],"unexplored":[214],"problems":[218],"over":[219],"constraints.":[221]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-03-25T00:00:00"}