{"id":"https://openalex.org/W7128615688","doi":"https://doi.org/10.48550/arxiv.2602.09502","title":"Improved Approximate Regret for Decentralized Online Continuous Submodular Maximization via Reductions","display_name":"Improved Approximate Regret for Decentralized Online Continuous Submodular Maximization via Reductions","publication_year":2026,"publication_date":"2026-02-10","ids":{"openalex":"https://openalex.org/W7128615688","doi":"https://doi.org/10.48550/arxiv.2602.09502"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.09502","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5121043061","display_name":"Yuanyu Wan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wan, Yuanyu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125659715","display_name":"Yu Shen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shen, Yu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109689425","display_name":"Dingzhi Yu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yu, Dingzhi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101754491","display_name":"Bo Xue","orcid":"https://orcid.org/0000-0003-2211-0676"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xue, Bo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Song, Mingli","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Song, Mingli","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.5116000175476074,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.5116000175476074,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.09470000118017197,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.0925000011920929,"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/regret","display_name":"Regret","score":0.864799976348877},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.8303999900817871},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5852000117301941},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5834000110626221},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5576000213623047},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5180000066757202},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.508899986743927},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5008999705314636}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.864799976348877},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8303999900817871},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6729999780654907},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5852000117301941},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5834000110626221},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5576000213623047},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5180000066757202},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.508899986743927},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5056999921798706},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5008999705314636},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37630000710487366},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.32260000705718994},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.321399986743927},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3163999915122986},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.296999990940094},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2903999984264374},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2727999985218048},{"id":"https://openalex.org/C28901747","wikidata":"https://www.wikidata.org/wiki/Q177571","display_name":"Decision theory","level":2,"score":0.26089999079704285},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.2500999867916107}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.09502","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.09502","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.09502","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":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.09502","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6321044564247131,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"To":[0],"expand":[1],"the":[2,41,46,66,72,106,115,139],"applicability":[3],"of":[4,142],"decentralized":[5,15,127],"online":[6,16,128],"learning,":[7],"previous":[8],"studies":[9],"have":[10],"proposed":[11],"several":[12],"algorithms":[13,136],"for":[14,82,97],"continuous":[17,26],"submodular":[18],"maximization":[19],"(D-OCSM)":[20],"--":[21],"a":[22],"non-convex/non-concave":[23],"setting":[24],"with":[25],"DR-submodular":[27],"reward":[28],"functions.":[29],"However,":[30],"there":[31],"exist":[32],"large":[33],"gaps":[34],"between":[35],"their":[36],"approximate":[37,67,140],"regret":[38,42,68,141],"bounds":[39,43,69],"and":[40],"achieved":[44,70],"in":[45,71,144],"convex":[47,86,129],"setting.":[48,74],"Moreover,":[49],"if":[50],"focusing":[51],"on":[52],"projection-free":[53],"algorithms,":[54],"which":[55,132],"can":[56,92,109,133],"efficiently":[57],"handle":[58],"complex":[59],"decision":[60,87,101],"sets,":[61,88,102],"they":[62],"cannot":[63],"even":[64],"recover":[65],"centralized":[73],"In":[75],"this":[76],"paper,":[77],"we":[78,103],"first":[79,116],"demonstrate":[80],"that":[81,105],"D-OCSM":[83,98,125,143],"over":[84,99],"general":[85],"these":[89,145],"two":[90,122,146],"issues":[91],"be":[93,110],"addressed":[94,111],"simultaneously.":[95],"Furthermore,":[96],"downward-closed":[100],"show":[104],"second":[107],"issue":[108],"while":[112],"significantly":[113],"alleviating":[114],"issue.":[117],"Our":[118],"key":[119],"techniques":[120],"are":[121],"reductions":[123],"from":[124],"to":[126,137],"optimization":[130],"(D-OCO),":[131],"exploit":[134],"D-OCO":[135],"improve":[138],"cases,":[147],"respectively.":[148]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-12T00:00:00"}