{"id":"https://openalex.org/W2919158374","doi":"https://doi.org/10.1109/infocom.2019.8737610","title":"Link Rate Selection using Constrained Thompson Sampling","display_name":"Link Rate Selection using Constrained Thompson Sampling","publication_year":2019,"publication_date":"2019-04-01","ids":{"openalex":"https://openalex.org/W2919158374","doi":"https://doi.org/10.1109/infocom.2019.8737610","mag":"2919158374"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2019.8737610","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2019.8737610","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","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/A5101600794","display_name":"Harsh Gupta","orcid":"https://orcid.org/0000-0002-7845-5078"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Harsh Gupta","raw_affiliation_strings":["ECE and CSL, UIUC"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ECE and CSL, UIUC","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076974020","display_name":"Atilla Ery\u0131lmaz","orcid":"https://orcid.org/0000-0001-5560-5806"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Atilla Eryilmaz","raw_affiliation_strings":["ECE, The Ohio State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ECE, The Ohio State University","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078518595","display_name":"R. Srikant","orcid":"https://orcid.org/0000-0003-1483-5204"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. Srikant","raw_affiliation_strings":["ECE and CSL, UIUC"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ECE and CSL, UIUC","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"739","last_page":"747"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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/T10579","display_name":"Cognitive Radio Networks and Spectrum Sensing","score":0.9991999864578247,"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/T13553","display_name":"Age of Information Optimization","score":0.9980000257492065,"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.9279595613479614},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6330434083938599},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.6209372878074646},{"id":"https://openalex.org/keywords/thompson-sampling","display_name":"Thompson sampling","score":0.5914031863212585},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5531236529350281},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5517133474349976},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5134595036506653},{"id":"https://openalex.org/keywords/channel-state-information","display_name":"Channel state information","score":0.5020184516906738},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.4676456153392792},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4131399989128113},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3561166226863861},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2505328059196472},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13426360487937927},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11729851365089417},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.10260879993438721},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.10230302810668945}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.9279595613479614},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6330434083938599},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.6209372878074646},{"id":"https://openalex.org/C73602740","wikidata":"https://www.wikidata.org/wiki/Q7795822","display_name":"Thompson sampling","level":3,"score":0.5914031863212585},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5531236529350281},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5517133474349976},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5134595036506653},{"id":"https://openalex.org/C148063708","wikidata":"https://www.wikidata.org/wiki/Q5072511","display_name":"Channel state information","level":3,"score":0.5020184516906738},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.4676456153392792},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4131399989128113},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3561166226863861},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2505328059196472},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13426360487937927},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11729851365089417},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.10260879993438721},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.10230302810668945},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom.2019.8737610","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2019.8737610","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W148122774","https://openalex.org/W1501823362","https://openalex.org/W1911551976","https://openalex.org/W1995612435","https://openalex.org/W2003531160","https://openalex.org/W2006813606","https://openalex.org/W2009551863","https://openalex.org/W2019094720","https://openalex.org/W2049934117","https://openalex.org/W2050152106","https://openalex.org/W2083896716","https://openalex.org/W2108890528","https://openalex.org/W2129036575","https://openalex.org/W2130172960","https://openalex.org/W2168405694","https://openalex.org/W2791444538","https://openalex.org/W2820485130","https://openalex.org/W2949186496","https://openalex.org/W2950929549","https://openalex.org/W2963750583","https://openalex.org/W2963931928","https://openalex.org/W4300508798","https://openalex.org/W6606032028","https://openalex.org/W6630117878","https://openalex.org/W6639904974","https://openalex.org/W6655128454","https://openalex.org/W6730350646","https://openalex.org/W6752740238"],"related_works":["https://openalex.org/W1850547517","https://openalex.org/W2964125852","https://openalex.org/W3176022311","https://openalex.org/W3048056964","https://openalex.org/W3046298489","https://openalex.org/W4287690869","https://openalex.org/W3015709540","https://openalex.org/W4287816990","https://openalex.org/W2205200720","https://openalex.org/W2132876566"],"abstract_inverted_index":{"We":[0,72,112,146],"consider":[1],"the":[2,27,38,42,48,61,69,86,96,106,109,120,131,136,157],"optimal":[3,19,28,70],"link":[4,20],"rate":[5,21,29],"selection":[6,22],"problem":[7,107],"in":[8,34,95,105,142],"time-varying":[9],"wireless":[10,43],"channels":[11],"with":[12,108,140],"unknown":[13],"channel":[14,55,58],"statistics.":[15],"The":[16],"aim":[17],"of":[18,41,52,63],"is":[23,89,92],"to":[24,36,67],"transmit":[25],"at":[26,30],"each":[31],"time":[32,141],"slot":[33],"order":[35,144],"maximize":[37],"expected":[39,49,121],"throughput":[40],"channel/link":[44],"or":[45,57],"equivalently":[46],"minimize":[47],"regret.":[50],"Lack":[51],"information":[53],"about":[54],"state":[56],"statistics":[59],"necessitates":[60],"use":[62],"online/sequential":[64],"learning":[65],"algorithms":[66],"determine":[68],"rate.":[71],"present":[73],"an":[74,115,143],"algorithm":[75,82],"called":[76],"CoTS":[77,154],"-":[78],"Constrained":[79],"Thompson":[80],"sampling":[81],"which":[83,133,151],"improves":[84],"upon":[85],"current":[87,158],"state-of-the-art,":[88],"fast":[90],"and":[91,123],"also":[93,113,147],"general":[94],"sense":[97],"that":[98,135,153],"it":[99],"can":[100],"handle":[101],"several":[102],"different":[103],"constraints":[104],"same":[110],"algorithm.":[111],"prove":[114],"asymptotic":[116],"lower":[117],"bound":[118,129],"on":[119,130],"regret":[122,137],"a":[124],"high":[125],"probability":[126],"large-horizon":[127],"upper":[128],"regret,":[132],"show":[134],"grows":[138],"logarithmically":[139],"sense.":[145],"provide":[148],"numerical":[149],"results":[150],"establish":[152],"significantly":[155],"outperforms":[156],"state-of-the-art":[159],"algorithms.":[160]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}