{"id":"https://openalex.org/W7129675138","doi":"https://doi.org/10.48550/arxiv.2602.14543","title":"Truly Adapting to Adversarial Constraints in Constrained MABs","display_name":"Truly Adapting to Adversarial Constraints in Constrained MABs","publication_year":2026,"publication_date":"2026-02-16","ids":{"openalex":"https://openalex.org/W7129675138","doi":"https://doi.org/10.48550/arxiv.2602.14543"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.14543","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":"article","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/A5015327395","display_name":"Francesco Emanuele Stradi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stradi, Francesco Emanuele","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126239481","display_name":"Kalana Kalupahana","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kalupahana, Kalana","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126225149","display_name":"Matteo Castiglioni","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Castiglioni, Matteo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039843107","display_name":"Alberto Marchesi","orcid":"https://orcid.org/0000-0002-8284-5757"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marchesi, Alberto","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5122879754","display_name":"Nicola Gatti","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gatti, Nicola","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":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1528009,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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.8766999840736389,"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.8766999840736389,"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/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.04670000076293945,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.029100000858306885,"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.8001000285148621},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.6990000009536743},{"id":"https://openalex.org/keywords/adversarial-system","display_name":"Adversarial system","score":0.6610999703407288},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6182000041007996},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5611000061035156},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.3246000111103058}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.8001000285148621},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6990000009536743},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6697999835014343},{"id":"https://openalex.org/C37736160","wikidata":"https://www.wikidata.org/wiki/Q1801315","display_name":"Adversarial system","level":2,"score":0.6610999703407288},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6182000041007996},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5611000061035156},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5213000178337097},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33570000529289246},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.3246000111103058},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2863999903202057},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.28630000352859497},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.27880001068115234},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2639000117778778},{"id":"https://openalex.org/C29230964","wikidata":"https://www.wikidata.org/wiki/Q5164376","display_name":"Constraint learning","level":5,"score":0.2529999911785126},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.25209999084472656}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.14543","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.14543","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.14543","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,"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":"pmh:doi:10.48550/arxiv.2602.14543","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.6377124190330505,"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":{"We":[0,44,122,189],"study":[1],"the":[2,6,13,20,25,32,107,120,124,138,143,157,162,182,187,204,213],"constrained":[3],"variant":[4],"of":[5,34,131,159,161,184],"\\emph{multi-armed":[7],"bandit}":[8],"(MAB)":[9],"problem,":[10],"in":[11,186],"which":[12],"learner":[14],"aims":[15],"not":[16,82],"only":[17,198],"at":[18,30,58],"minimizing":[19],"total":[21],"loss":[22],"incurred":[23],"during":[24],"learning":[26],"dynamic,":[27],"but":[28],"also":[29],"controlling":[31],"violation":[33,136,222],"multiple":[35],"\\emph{unknown}":[36],"constraints,":[37,214],"under":[38,165],"both":[39,51,61,86],"\\emph{full}":[40],"and":[41,53,56,63,89,133,148,175,223],"\\emph{bandit":[42,208],"feedback}.":[43],"consider":[45],"a":[46,77],"non-stationary":[47],"environment":[48],"that":[49,69,127,149,153],"subsumes":[50],"stochastic":[52,102,141],"adversarial":[54,111],"models":[55],"where,":[57],"each":[59],"round,":[60],"losses":[62,144],"constraints":[64,103,112,139],"are":[65,140],"drawn":[66],"from":[67],"distributions":[68],"may":[70,145],"change":[71],"arbitrarily":[72],"over":[73],"time.":[74],"In":[75],"such":[76],"setting,":[78],"it":[79],"is":[80,201,210],"provably":[81],"possible":[83],"to":[84,119,193],"guarantee":[85],"sublinear":[87,90],"regret":[88,132,174],"violation.":[91],"Accordingly,":[92],"prior":[93],"work":[94],"has":[95],"mainly":[96],"focused":[97],"either":[98],"on":[99,105],"settings":[100],"with":[101,109,117,156],"or":[104],"relaxing":[106],"benchmark":[108],"fully":[110],"(\\emph{e.g.},":[113],"via":[114],"competitive":[115],"ratios":[116],"respect":[118],"optimum).":[121],"provide":[123],"first":[125],"algorithms":[126],"achieve":[128],"optimal":[129],"rates":[130],"\\emph{positive}":[134],"constraint":[135],"when":[137,197,207],"while":[142],"vary":[146],"arbitrarily,":[147],"simultaneously":[150],"yield":[151],"guarantees":[152,196],"degrade":[154],"smoothly":[155],"degree":[158],"adversariality":[160],"constraints.":[163,188],"Specifically,":[164],"\\emph{full":[166],"feedback}":[167,209],"we":[168,215],"propose":[169],"an":[170,217],"algorithm":[171,218],"attaining":[172],"$\\widetilde{\\mathcal{O}}(\\sqrt{T}+C)$":[173,176,220],"{positive}":[177,221],"violation,":[178],"where":[179],"$C$":[180],"quantifies":[181],"amount":[183],"non-stationarity":[185],"then":[190],"show":[191],"how":[192],"extend":[194],"these":[195],"bandit":[199],"feedback":[200],"available":[202,211],"for":[203,212],"losses.":[205],"Finally,":[206],"design":[216],"achieving":[219],"$\\widetilde{\\mathcal{O}}(\\sqrt{T}+C\\sqrt{T})$":[224],"regret.":[225]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-02-18T00:00:00"}