{"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":"article","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":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"G Krishnakumar","raw_affiliation_strings":["Indian Institute of Technology Madras,Dept. of Electrical Engineering,Chennai,India,600036"],"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"],"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":["https://openalex.org/A5007897924"],"corresponding_institution_ids":["https://openalex.org/I24676775"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.5015229,"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,135],"consider":[1],"an":[2,35,45,117],"online":[3,118],"channel":[4,61,132,206],"scheduling":[5],"problem":[6],"for":[7,71,144,249],"a":[8,137,198,218,227],"single":[9,130],"transmitter-receiver":[10],"pair":[11],"equipped":[12],"with":[13,242],"<tex":[14,67,112,214,235],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[15,68,113,215,236],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$N$</tex>":[16,69],"arbitrarily":[17],"varying":[18],"wireless":[19],"channels.":[20],"The":[21,92],"transmission":[22,86],"rates":[23],"of":[24,65,76,88,197,213,221],"the":[25,51,59,66,74,77,79,85,89,97,103,106,121,129,146,164,167,176,186,195,204,246],"channels":[26,70],"might":[27],"be":[28,32,191],"non-stationary":[29],"and":[30,120],"could":[31],"controlled":[33],"by":[34,116,125,194],"oblivious":[36,57],"adversary.":[37],"At":[38,73],"every":[39],"slot,":[40,78],"incoming":[41],"data":[42,47],"arrives":[43],"at":[44,50,109],"infinitecapacity":[46],"queue":[48,98,107,122,147,165,187,250],"located":[49],"transmitter.":[52],"A":[53],"scheduler,":[54],"which":[55,233],"is":[56,94,179,184],"to":[58,83,95],"current":[60],"rates,":[62],"selects":[63],"one":[64],"transmission.":[72],"end":[75],"scheduler":[80],"only":[81],"gets":[82],"know":[84],"rate":[87],"selected":[90],"channel.":[91],"objective":[93],"minimize":[96],"length":[99,108,123,148,188,251],"regret,":[100],"defined":[101],"as":[102],"difference":[104],"between":[105],"some":[110],"time":[111],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$T$</tex>":[114],"achieved":[115],"policy":[119,200,232],"obtained":[124],"always":[126],"transmitting":[127],"over":[128,210],"best":[131,205],"in":[133,150,207],"hindsight.":[134],"propose":[136,226],"weakly":[138,228],"adaptive":[139,229],"Multi-Armed":[140],"Bandit":[141],"(MAB)":[142],"algorithm":[143],"minimizing":[145],"regret":[149,189,196,241],"this":[151],"setup.":[152],"Unlike":[153],"previous":[154],"works,":[155],"we":[156,224],"do":[157],"not":[158],"make":[159],"any":[160],"stability":[161],"assumptions":[162],"about":[163],"or":[166],"arrival":[168],"process.":[169],"Hence,":[170],"our":[171],"result":[172],"holds":[173],"even":[174],"when":[175],"queueing":[177],"process":[178],"unstable.":[180],"Our":[181],"main":[182],"observation":[183],"that":[185,201],"can":[190],"upper":[192],"bounded":[193],"MAB":[199,231],"competes":[202],"against":[203],"hindsight":[208],"uniformly":[209],"all":[211],"sub-intervals":[212],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$[T]$</tex>.":[216],"As":[217],"technical":[219],"contribution":[220],"independent":[222],"interest,":[223],"then":[225],"adversarial":[230],"achieves":[234],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\tilde{O}\\left(\\sqrt{N}":[237],"T^{3":[238],"/":[239],"4}\\right)$</tex>":[240],"high":[243],"probability,":[244],"implying":[245],"same":[247],"bound":[248],"regret.":[252]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-21T00:00:00"}