{"id":"https://openalex.org/W7134248995","doi":"https://doi.org/10.48550/arxiv.2603.06403","title":"Adapter-Augmented Bandits for Online Multi-Constrained Multi-Modal Inference Scheduling","display_name":"Adapter-Augmented Bandits for Online Multi-Constrained Multi-Modal Inference Scheduling","publication_year":2026,"publication_date":"2026-03-06","ids":{"openalex":"https://openalex.org/W7134248995","doi":"https://doi.org/10.48550/arxiv.2603.06403"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2603.06403","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/A5124387210","display_name":"Xianzhi Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Zhang, Xianzhi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128546442","display_name":"YUE XU","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xu, Yue","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128415734","display_name":"Yinlin Zhu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhu, Yinlin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128618227","display_name":"Di Wu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wu, Di","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128445375","display_name":"Yipeng Zhou","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhou, Yipeng","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128550298","display_name":"Miao Hu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hu, Miao","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5124385671","display_name":"Guocong Quan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Quan, Guocong","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5124387210"],"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/T11714","display_name":"Multimodal Machine Learning Applications","score":0.188400000333786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11714","display_name":"Multimodal Machine Learning Applications","score":0.188400000333786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12026","display_name":"Explainable Artificial Intelligence (XAI)","score":0.16750000417232513,"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/T10028","display_name":"Topic Modeling","score":0.1534000039100647,"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/inference","display_name":"Inference","score":0.7232000231742859},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.7214999794960022},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6448000073432922},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.40709999203681946},{"id":"https://openalex.org/keywords/task-analysis","display_name":"Task analysis","score":0.357699990272522},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.34470000863075256},{"id":"https://openalex.org/keywords/homogeneous","display_name":"Homogeneous","score":0.34369999170303345},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.3273000121116638}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.782800018787384},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.7232000231742859},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7214999794960022},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6448000073432922},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.40709999203681946},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.39579999446868896},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.357699990272522},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.34470000863075256},{"id":"https://openalex.org/C66882249","wikidata":"https://www.wikidata.org/wiki/Q169336","display_name":"Homogeneous","level":2,"score":0.34369999170303345},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3273000121116638},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.32339999079704285},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.32269999384880066},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.3163999915122986},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.3003999888896942},{"id":"https://openalex.org/C2781020372","wikidata":"https://www.wikidata.org/wiki/Q533093","display_name":"On the fly","level":2,"score":0.2994000017642975},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2888999879360199},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.2856000065803528},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.27480000257492065},{"id":"https://openalex.org/C86251818","wikidata":"https://www.wikidata.org/wiki/Q816754","display_name":"Benchmarking","level":2,"score":0.26910001039505005},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.2685000002384186},{"id":"https://openalex.org/C46743427","wikidata":"https://www.wikidata.org/wiki/Q1341685","display_name":"Inference engine","level":3,"score":0.25769999623298645},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25609999895095825},{"id":"https://openalex.org/C114073186","wikidata":"https://www.wikidata.org/wiki/Q2631895","display_name":"Automated planning and scheduling","level":2,"score":0.25360000133514404}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2603.06403","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.2603.06403","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.06403","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.2603.06403","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":"Partnerships for the goals","score":0.4763290584087372,"id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Multi-modal":[0],"large":[1],"language":[2],"model":[3],"(MLLM)":[4],"inference":[5,92],"scheduling":[6,28,93],"enables":[7],"strong":[8],"response":[9],"quality":[10],"under":[11,142,150],"practical":[12],"and":[13,38,53,71,108,132,140,176],"heterogeneous":[14,160],"budgets,":[15],"beyond":[16],"what":[17],"a":[18,89,99,117,134,147,155],"homogeneous":[19],"single-backend":[20],"setting":[21],"can":[22],"offer.":[23],"Yet":[24],"online":[25,74,122],"MLLM":[26,91],"task":[27,69,106],"is":[29],"nontrivial,":[30],"as":[31],"requests":[32],"vary":[33],"sharply":[34],"in":[35],"modality":[36],"composition":[37],"latent":[39],"reasoning":[40],"difficulty,":[41],"while":[42],"execution":[43],"backends":[44],"incur":[45],"distinct,":[46],"time-varying":[47],"costs":[48],"due":[49],"to":[50,125,172],"system":[51],"jitter":[52],"network":[54],"variation.":[55],"These":[56],"coupled":[57],"uncertainties":[58],"pose":[59],"two":[60],"core":[61],"challenges:":[62],"deriving":[63],"semantically":[64],"faithful":[65],"yet":[66],"scheduling-relevant":[67],"multi-modal":[68],"representations,":[70],"making":[72],"low-overhead":[73],"decisions":[75],"over":[76],"irreversible":[77,143],"multi-dimensional":[78,151],"budgets.":[79,144],"Accordingly,":[80],"we":[81],"propose":[82],"\\emph{M-CMAB}":[83,162],"(\\underline{M}ulti-modal":[84],"\\underline{M}ulti-constraint":[85],"\\underline{C}ontextual":[86],"\\underline{M}ulti-\\underline{A}rmed":[87],"\\underline{B}andit),":[88],"multi-adapter-enhanced":[90],"framework":[94],"with":[95,159],"three":[96],"components:":[97],"(i)":[98],"CLS-attentive,":[100],"frozen-backbone":[101],"\\emph{Predictor}":[102],"that":[103,120,137],"extracts":[104],"compact":[105],"representations":[107],"updates":[109],"only":[110],"lightweight":[111],"adapters":[112],"for":[113],"action-specific":[114],"estimation;":[115],"(ii)":[116],"primal-dual":[118],"\\emph{Constrainer}":[119],"maintains":[121],"Lagrange":[123],"multipliers":[124],"enforce":[126],"long-horizon":[127],"constraints":[128],"via":[129],"per-round":[130],"objectives;":[131],"(iii)":[133],"two-phase":[135],"\\emph{Scheduler}":[136],"balances":[138],"exploration":[139],"exploitation":[141],"We":[145],"establish":[146],"regret":[148],"guarantee":[149],"knapsack":[152],"constraints.":[153],"On":[154],"composite":[156],"multimodal":[157],"benchmark":[158],"backends,":[161],"consistently":[163],"outperforms":[164],"state-of-the-art":[165],"baselines":[166],"across":[167],"budget":[168],"regimes,":[169],"achieving":[170],"up":[171],"14.18%":[173],"higher":[174],"reward":[175],"closely":[177],"tracking":[178],"an":[179],"oracle-aided":[180],"upper":[181],"bound.":[182],"Codes":[183],"are":[184],"available":[185],"at":[186],"https://anonymous.4open.science/r/M2CMAB/.":[187]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-03-10T00:00:00"}