{"id":"https://openalex.org/W7202346048","doi":"https://doi.org/10.48550/arxiv.2608.12134","title":"Adversarial Resilience of Poisson-Process Submodular Maximization over Matroids, and Full-Bandit Learning","display_name":"Adversarial Resilience of Poisson-Process Submodular Maximization over Matroids, and Full-Bandit Learning","publication_year":2026,"publication_date":"2026-08-12","ids":{"openalex":"https://openalex.org/W7202346048","doi":"https://doi.org/10.48550/arxiv.2608.12134"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2608.12134","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.12134","pdf_url":"https://arxiv.org/pdf/2608.12134","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2608.12134","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126195561","display_name":"Vaneet Aggarwal","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Aggarwal, Vaneet","raw_affiliation_strings":["V. Aggarwal is with Purdue University , West Lafayette IN , USA,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"V. Aggarwal is with Purdue University , West Lafayette IN , USA,","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5126195561"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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.47850000858306885,"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.47850000858306885,"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/T12288","display_name":"Optimization and Search Problems","score":0.2897999882698059,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.10360000282526016,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-maximization","display_name":"submodular maximization","score":0.9789999723434448},{"id":"https://openalex.org/keywords/matroid-constraints","display_name":"matroid constraints","score":0.9210000038146973},{"id":"https://openalex.org/keywords/poisson-process","display_name":"Poisson process","score":0.8479999899864197},{"id":"https://openalex.org/keywords/adversarial-resilience","display_name":"adversarial resilience","score":0.8489999771118164},{"id":"https://openalex.org/keywords/combinatorial-multi-armed-bandit","display_name":"combinatorial bandits","score":0.8730000257492065},{"id":"https://openalex.org/keywords/regret-bounds","display_name":"regret bounds","score":0.6000000238418579},{"id":"https://openalex.org/keywords/partition-matroids","display_name":"partition matroids","score":0.8140000104904175},{"id":"https://openalex.org/keywords/approximation-guarantees","display_name":"approximation guarantees","score":0.3700000047683716}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9129999876022339},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.600600004196167},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5819000005722046},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5738999843597412},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.536300003528595},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5162000060081482},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4950999915599823},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.48739999532699585},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.47749999165534973},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4641999900341034},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4146000146865845},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4072999954223633},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.34790000319480896},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.3138999938964844},{"id":"https://openalex.org/C2779585090","wikidata":"https://www.wikidata.org/wiki/Q3457762","display_name":"Resilience (materials science)","level":2,"score":0.30880001187324524},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C99821215","wikidata":"https://www.wikidata.org/wiki/Q1136583","display_name":"Swap (finance)","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2784000039100647},{"id":"https://openalex.org/C100906024","wikidata":"https://www.wikidata.org/wiki/Q205692","display_name":"Poisson distribution","level":2,"score":0.27549999952316284},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27090001106262207},{"id":"https://openalex.org/C2777780509","wikidata":"https://www.wikidata.org/wiki/Q1377422","display_name":"Profit maximization","level":3,"score":0.2694999873638153},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2671000063419342},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.25940001010894775},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.25690001249313354}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2608.12134","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.12134","pdf_url":"https://arxiv.org/pdf/2608.12134","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2608.12134","doi":"https://doi.org/10.48550/arxiv.2608.12134","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2608.12134","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2608.12134","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.12134","pdf_url":"https://arxiv.org/pdf/2608.12134","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7202346048.pdf","grobid_xml":"https://content.openalex.org/works/W7202346048.grobid-xml"},"referenced_works_count":1,"referenced_works":["https://openalex.org/W7196944279"],"related_works":["https://openalex.org/W7204244505","https://openalex.org/W3048806178","https://openalex.org/W7163984456","https://openalex.org/W7196944279","https://openalex.org/W2964326108","https://openalex.org/W4297975901","https://openalex.org/W3128497686","https://openalex.org/W2603933516","https://openalex.org/W1509940100","https://openalex.org/W4226209249"],"abstract_inverted_index":{"We":[0,193],"study":[1],"nonnegative":[2],"submodular":[3,140],"maximization":[4],"on":[5],"$n$":[6],"elements":[7],"subject":[8],"to":[9,162,211],"a":[10,94,115,125,195],"general":[11,138],"matroid":[12],"of":[13,119],"rank":[14],"$k$,":[15],"when":[16],"the":[17,36,55,109,176,189,201,206],"offline":[18,214],"algorithm":[19,56],"is":[20,30,108],"given":[21,72],"an":[22,31,73,127],"arbitrary":[23],"controlled":[24,79],"value":[25,99],"oracle.":[26],"Our":[27],"main":[28],"result":[29],"adversarial":[32],"resilience":[33],"theorem":[34],"for":[35,62,67,87,137],"Spiteful":[37],"Greedy":[38],"Swap":[39],"Poisson":[40,46,202],"Process":[41],"(SGS-Poisson):":[42],"without":[43],"modifying":[44],"its":[45,213],"intensity,":[47],"single-element":[48],"exchange":[49],"rule,":[50],"or":[51],"spiteful":[52],"drop":[53],"step,":[54],"retains":[57],"limiting":[58,144],"approximation":[59],"factors":[60,146],"$1/e$":[61,147],"non-monotone":[63],"objectives":[64],"and":[65,103,148,150,175,204],"$1-1/e$":[66,149],"monotone":[68],"objectives.":[69],"More":[70],"precisely,":[71],"error":[74],"bound":[75],"$\u03be\\ge0$,":[76],"under":[77,188],"every":[78,88],"oracle":[80,122],"$\\widehat":[81],"f$":[82],"satisfying":[83],"$|\\widehat":[84],"f(S)-f(S)|\\le":[85],"\u03be$":[86],"set":[89,96,209],"$S$,":[90],"our":[91],"implementation":[92,113],"returns":[93],"feasible":[95,110],"with":[97,142],"expected":[98],"at":[100,170],"least":[101],"$(1/e-\\varepsilon)OPT-O(k\u03be)$":[102],"$(1-1/e-\\varepsilon)OPT-O(k\u03be)$,":[104],"respectively,":[105],"where":[106],"$OPT$":[107],"optimum.":[111],"The":[112],"uses":[114],"\\emph{deterministically":[116],"bounded}":[117],"budget":[118,198],"$O(nk^{2}\\varepsilon^{-2}\\log":[120],"n\\log^{2}(1/\\varepsilon))$":[121],"calls.":[123],"As":[124],"consequence,":[126],"offline-to-online":[128],"reduction":[129],"yields":[130],"full-bandit":[131],"combinatorial":[132],"multi-armed":[133],"bandit":[134],"(CMAB)":[135],"algorithms":[136],"matroid-constrained":[139],"rewards":[141],"exact":[143],"approximation-regret":[145],"$\\widetilde":[151,186],"O(n^{1/5}k^{4/5}T^{4/5})$":[152],"regret":[153],"over":[154],"$T$":[155],"rounds.":[156],"These":[157],"online":[158],"guarantees":[159],"allow":[160],"exploration":[161,191],"play":[163],"sets":[164],"that":[165],"become":[166],"independent":[167],"after":[168],"deleting":[169],"most":[171],"one":[172],"element;":[173],"exploitation":[174],"benchmark":[177],"remain":[178],"matroid-feasible.":[179],"For":[180],"unit-capacity":[181],"partition":[182],"matroids":[183],"we":[184],"obtain":[185],"O(n^{1/5}k^{3/5}T^{4/5})$":[187],"same":[190],"relaxation.":[192],"establish":[194],"deterministic":[196],"query":[197],"by":[199],"truncating":[200],"process":[203],"identify":[205],"enlarged":[207],"action":[208],"needed":[210],"answer":[212],"queries.":[215]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-08-14T00:00:00"}