{"id":"https://openalex.org/W7165022859","doi":"https://doi.org/10.48550/arxiv.2606.17489","title":"Online LLM Selection via Constrained Bandits with Time-Varying Demand","display_name":"Online LLM Selection via Constrained Bandits with Time-Varying Demand","publication_year":2026,"publication_date":"2026-06-16","ids":{"openalex":"https://openalex.org/W7165022859","doi":"https://doi.org/10.48550/arxiv.2606.17489"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.17489","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.17489","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":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.2606.17489","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126420301","display_name":"Y Huang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huang, Yin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138763082","display_name":"Qingsong Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Qingsong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5138804207","display_name":"Jie Xu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xu, Jie","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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.19290000200271606,"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.19290000200271606,"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/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.11320000141859055,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/T10273","display_name":"IoT and Edge/Fog Computing","score":0.08789999783039093,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.6136000156402588},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.47450000047683716},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4510999917984009},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.4456999897956848},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.397599995136261},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.39629998803138733},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.39329999685287476}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7851999998092651},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.6136000156402588},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.47450000047683716},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4510999917984009},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.4456999897956848},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43050000071525574},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.397599995136261},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.39629998803138733},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.39329999685287476},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.3853999972343445},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.3846000134944916},{"id":"https://openalex.org/C9233905","wikidata":"https://www.wikidata.org/wiki/Q3276328","display_name":"Bidding","level":2,"score":0.3774000108242035},{"id":"https://openalex.org/C8505890","wikidata":"https://www.wikidata.org/wiki/Q605095","display_name":"Budget constraint","level":2,"score":0.36239999532699585},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.36070001125335693},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.357699990272522},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.33980000019073486},{"id":"https://openalex.org/C29230964","wikidata":"https://www.wikidata.org/wiki/Q5164376","display_name":"Constraint learning","level":5,"score":0.3382999897003174},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.3082999885082245},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.30410000681877136},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.2892000079154968},{"id":"https://openalex.org/C73602740","wikidata":"https://www.wikidata.org/wiki/Q7795822","display_name":"Thompson sampling","level":3,"score":0.2818000018596649},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.2808000147342682},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.257999986410141}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.17489","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.17489","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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.17489","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.17489","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":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Large":[0],"Language":[1],"Models":[2],"(LLMs)":[3],"are":[4],"increasingly":[5],"deployed":[6],"in":[7,192],"edge-cloud":[8],"inference":[9],"systems":[10],"to":[11,114,123,151,172],"handle":[12],"diverse":[13],"user":[14],"tasks":[15],"with":[16,71,155,176],"heterogeneous":[17],"accuracy,":[18],"latency,":[19],"and":[20,37,45,49,108,131,148,166,187],"cost":[21],"profiles.":[22],"Selecting":[23],"the":[24,99,124,185],"appropriate":[25],"LLM":[26],"for":[27,33,84],"each":[28],"incoming":[29],"task":[30,51,116],"is":[31],"critical":[32],"ensuring":[34],"service":[35],"quality":[36],"efficient":[38],"resource":[39,63],"utilization.":[40],"However,":[41],"model":[42],"heterogeneity,":[43],"stochastic":[44,94],"unknown":[46],"performance":[47],"characteristics,":[48],"time-varying":[50,115],"demands":[52],"make":[53],"static":[54],"selection":[55],"strategies":[56],"inadequate.":[57],"Real-world":[58],"deployments":[59],"often":[60],"impose":[61],"hard":[62],"budgets":[64],"such":[65,75],"as":[66,76,91],"monetary":[67],"expenditure":[68],"limits,":[69],"along":[70],"soft":[72],"service-level":[73],"requirements":[74],"latency":[77,129],"guarantees.":[78],"These":[79],"constraints":[80],"introduce":[81],"additional":[82],"challenges":[83],"online":[85,141],"decision-making.":[86],"We":[87,137,159],"formulate":[88],"this":[89],"problem":[90],"a":[92,139],"constrained":[93],"bandit":[95],"learning":[96,142],"task,":[97],"where":[98],"learner":[100,119],"sequentially":[101],"selects":[102],"models":[103],"under":[104],"both":[105],"packing-type":[106],"(hard)":[107],"covering-type":[109],"(soft)":[110],"constraints,":[111],"while":[112],"adapting":[113],"demand.":[117],"The":[118],"operates":[120],"without":[121],"access":[122],"underlying":[125],"reward,":[126],"cost,":[127],"or":[128],"distributions":[130],"must":[132],"rely":[133],"on":[134,181],"partial":[135],"feedback.":[136],"develop":[138],"novel":[140],"algorithm":[143],"that":[144],"leverages":[145],"confidence-bound":[146],"estimates":[147],"demand":[149],"predictions":[150],"balance":[152],"reward":[153],"maximization":[154],"long-term":[156],"constraint":[157,169],"satisfaction.":[158],"provide":[160],"theoretical":[161],"guarantees":[162],"showing":[163],"sublinear":[164,167],"regret":[165],"covering":[168],"violations":[170],"compared":[171],"an":[173],"offline":[174],"benchmark":[175],"full":[177],"information.":[178],"Experimental":[179],"results":[180],"synthetic":[182],"workloads":[183],"demonstrate":[184],"effectiveness":[186],"robustness":[188],"of":[189],"our":[190],"approach":[191],"dynamic,":[193],"resource-constrained":[194],"environments.":[195]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-18T00:00:00"}
