{"id":"https://openalex.org/W4415367332","doi":"https://doi.org/10.1109/isit63088.2025.11195574","title":"Minimizing Queue Length Regret for Arbitrarily Varying Channels","display_name":"Minimizing Queue Length Regret for Arbitrarily Varying Channels","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415367332","doi":"https://doi.org/10.1109/isit63088.2025.11195574"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195574","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195574","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007897924","display_name":"Gnanambikai Krishnakumar","orcid":"https://orcid.org/0000-0002-3817-1548"},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"education","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"G Krishnakumar","raw_affiliation_strings":["Indian Institute of Technology Madras,Dept. of Electrical Engineering,Chennai,India,600036"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Madras,Dept. of Electrical Engineering,Chennai,India,600036","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057128963","display_name":"Abhishek Sinha","orcid":"https://orcid.org/0000-0001-7220-0691"},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Abhishek Sinha","raw_affiliation_strings":["School of Technology and Computer Science, Tata Institute of Fundamental Research,Mumbai,India,400005"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Technology and Computer Science, Tata Institute of Fundamental Research,Mumbai,India,400005","institution_ids":["https://openalex.org/I11947397"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"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.46204851,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9663000106811523,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9663000106811523,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12216","display_name":"Network Time Synchronization Technologies","score":0.9337000250816345,"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"}},{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9275000095367432,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.6676999926567078},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.6355999708175659},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5928000211715698},{"id":"https://openalex.org/keywords/multilevel-queue","display_name":"Multilevel queue","score":0.5324000120162964},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5157999992370605},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.5023000240325928},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4636000096797943},{"id":"https://openalex.org/keywords/bulk-queue","display_name":"Bulk queue","score":0.42289999127388}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.6676999926567078},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6355999708175659},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5928000211715698},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.538100004196167},{"id":"https://openalex.org/C201511382","wikidata":"https://www.wikidata.org/wiki/Q16801758","display_name":"Multilevel queue","level":4,"score":0.5324000120162964},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5157999992370605},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.5023000240325928},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4636000096797943},{"id":"https://openalex.org/C87950461","wikidata":"https://www.wikidata.org/wiki/Q4996486","display_name":"Bulk queue","level":3,"score":0.42289999127388},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.3797999918460846},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3750999867916107},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37369999289512634},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.3668999969959259},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3131999969482422},{"id":"https://openalex.org/C10347200","wikidata":"https://www.wikidata.org/wiki/Q1960297","display_name":"Hindsight bias","level":2,"score":0.310699999332428},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2996000051498413},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2985999882221222},{"id":"https://openalex.org/C124444977","wikidata":"https://www.wikidata.org/wiki/Q4025962","display_name":"Fork\u2013join queue","level":4,"score":0.29249998927116394},{"id":"https://openalex.org/C66295387","wikidata":"https://www.wikidata.org/wiki/Q4998912","display_name":"Burke's theorem","level":5,"score":0.2904999852180481},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.28439998626708984},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.2824999988079071},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.27070000767707825},{"id":"https://openalex.org/C128220111","wikidata":"https://www.wikidata.org/wiki/Q4531011","display_name":"Queue management system","level":3,"score":0.263700008392334}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195574","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195574","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1570963478","https://openalex.org/W1583502482","https://openalex.org/W1977699683","https://openalex.org/W2050152106","https://openalex.org/W2090452550","https://openalex.org/W2120822931","https://openalex.org/W2775421175","https://openalex.org/W2950929549","https://openalex.org/W2971854266","https://openalex.org/W2998044821","https://openalex.org/W3010248974","https://openalex.org/W3124291373","https://openalex.org/W4206530644","https://openalex.org/W4256363058","https://openalex.org/W4285213538"],"related_works":[],"abstract_inverted_index":{"We":[0,123],"consider":[1],"an":[2,31,41,105],"online":[3,106],"channel":[4,57,120,194],"scheduling":[5],"problem":[6],"for":[7,63,132,230],"a":[8,125,186,203,212],"single":[9,118],"transmitter-receiver":[10],"pair":[11],"equipped":[12],"with$N$arbitrarily":[13],"varying":[14],"wireless":[15],"channels.":[16],"The":[17,84],"transmission":[18,78],"rates":[19],"of":[20,61,68,80,185,206],"the":[21,47,55,66,69,71,77,81,89,95,98,109,117,134,152,155,164,174,183,192,227],"channels":[22],"might":[23],"be":[24,28,179],"non-stationary":[25],"and":[26,108],"could":[27],"controlled":[29],"by":[30,104,113,182],"oblivious":[32,53],"adversary.":[33],"At":[34,65],"every":[35],"slot,":[36,70],"incoming":[37],"data":[38,43],"arrives":[39],"at":[40,46,101],"infinitecapacity":[42],"queue":[44,90,99,110,135,153,175,231],"located":[45],"transmitter.":[48],"A":[49],"scheduler,":[50],"which":[51,218],"is":[52,86,167,172],"to":[54,75,87],"current":[56],"rates,":[58],"selects":[59],"one":[60],"the$N$channels":[62],"transmission.":[64],"end":[67],"scheduler":[72],"only":[73],"gets":[74],"know":[76],"rate":[79],"selected":[82],"channel.":[83],"objective":[85],"minimize":[88],"length":[91,100,111,136,176,232],"regret,":[92],"defined":[93],"as":[94],"difference":[96],"between":[97],"some":[102],"time$T$achieved":[103],"policy":[107,188,217],"obtained":[112],"always":[114],"transmitting":[115],"over":[116,198],"best":[119,193],"in":[121,138,195],"hindsight.":[122],"propose":[124,211],"weakly":[126,213],"adaptive":[127,214],"Multi-Armed":[128],"Bandit":[129],"(MAB)":[130],"algorithm":[131],"minimizing":[133],"regret":[137,177,184],"this":[139],"setup.":[140],"Unlike":[141],"previous":[142],"works,":[143],"we":[144,209],"do":[145],"not":[146],"make":[147],"any":[148],"stability":[149],"assumptions":[150],"about":[151],"or":[154],"arrival":[156],"process.":[157],"Hence,":[158],"our":[159],"result":[160],"holds":[161],"even":[162],"when":[163],"queueing":[165],"process":[166],"unstable.":[168],"Our":[169],"main":[170],"observation":[171],"that":[173,189],"can":[178],"upper":[180],"bounded":[181],"MAB":[187,216],"competes":[190],"against":[191],"hindsight":[196],"uniformly":[197],"all":[199],"sub-intervals":[200],"of$[T]$.":[201],"As":[202],"technical":[204],"contribution":[205],"independent":[207],"interest,":[208],"then":[210],"adversarial":[215],"achieves$\\tilde{O}\\left(\\sqrt{N}":[219],"T^{3":[220],"/":[221],"4}\\right)$regret":[222],"with":[223],"high":[224],"probability,":[225],"implying":[226],"same":[228],"bound":[229],"regret.":[233]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-21T00:00:00"}