{"id":"https://openalex.org/W4283813024","doi":"https://doi.org/10.1109/ncc55593.2022.9806785","title":"Best Arm Identification in Sample-path Correlated Bandits","display_name":"Best Arm Identification in Sample-path Correlated Bandits","publication_year":2022,"publication_date":"2022-05-24","ids":{"openalex":"https://openalex.org/W4283813024","doi":"https://doi.org/10.1109/ncc55593.2022.9806785"},"language":"en","primary_location":{"id":"doi:10.1109/ncc55593.2022.9806785","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ncc55593.2022.9806785","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 National Conference on Communications (NCC)","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/A5112910219","display_name":"R Sri Prakash","orcid":null},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"R Sri Prakash","raw_affiliation_strings":["IIT Bombay"],"affiliations":[{"raw_affiliation_string":"IIT Bombay","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084509524","display_name":"Nikhil Karamchandani","orcid":"https://orcid.org/0000-0002-7233-0717"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Nikhil Karamchandani","raw_affiliation_strings":["IIT Bombay"],"affiliations":[{"raw_affiliation_string":"IIT Bombay","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005788654","display_name":"Sharayu Moharir","orcid":"https://orcid.org/0000-0001-9393-9276"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sharayu Moharir","raw_affiliation_strings":["IIT Bombay"],"affiliations":[{"raw_affiliation_string":"IIT Bombay","institution_ids":["https://openalex.org/I162827531"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5112910219"],"corresponding_institution_ids":["https://openalex.org/I162827531"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07358522,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":null,"first_page":"7","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":1.0,"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":1.0,"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/T11182","display_name":"Auction Theory and Applications","score":0.9952999949455261,"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/T12288","display_name":"Optimization and Search Problems","score":0.9944000244140625,"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/sample-complexity","display_name":"Sample complexity","score":0.7373712062835693},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.7232367396354675},{"id":"https://openalex.org/keywords/identification","display_name":"Identification (biology)","score":0.7107857465744019},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.7072303295135498},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6605056524276733},{"id":"https://openalex.org/keywords/sample","display_name":"Sample (material)","score":0.6092653870582581},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5132436752319336},{"id":"https://openalex.org/keywords/parameter-identification-problem","display_name":"Parameter identification problem","score":0.43872907757759094},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4349232017993927},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.35002923011779785},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2735764980316162}],"concepts":[{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.7373712062835693},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.7232367396354675},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.7107857465744019},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7072303295135498},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6605056524276733},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.6092653870582581},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5132436752319336},{"id":"https://openalex.org/C79610928","wikidata":"https://www.wikidata.org/wiki/Q1656743","display_name":"Parameter identification problem","level":3,"score":0.43872907757759094},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4349232017993927},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35002923011779785},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2735764980316162},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C43617362","wikidata":"https://www.wikidata.org/wiki/Q170050","display_name":"Chromatography","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C59822182","wikidata":"https://www.wikidata.org/wiki/Q441","display_name":"Botany","level":1,"score":0.0},{"id":"https://openalex.org/C2983447341","wikidata":"https://www.wikidata.org/wiki/Q1413083","display_name":"Model parameter","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ncc55593.2022.9806785","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ncc55593.2022.9806785","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 National Conference on Communications (NCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334771","display_name":"Science and Engineering Research Board","ror":"https://ror.org/03ffdsr55"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W135467536","https://openalex.org/W1626398438","https://openalex.org/W1881419322","https://openalex.org/W2009551863","https://openalex.org/W2017919516","https://openalex.org/W2106663919","https://openalex.org/W2136317921","https://openalex.org/W2140251882","https://openalex.org/W2804342876","https://openalex.org/W3035200505","https://openalex.org/W3148149356","https://openalex.org/W3165221851","https://openalex.org/W3196668472","https://openalex.org/W3199817429","https://openalex.org/W4206530644","https://openalex.org/W6636500457","https://openalex.org/W6676362848","https://openalex.org/W6752125625"],"related_works":["https://openalex.org/W17155033","https://openalex.org/W2397544591","https://openalex.org/W4376639527","https://openalex.org/W1991417304","https://openalex.org/W2132876566","https://openalex.org/W1969276875","https://openalex.org/W2788738055","https://openalex.org/W2950049300","https://openalex.org/W4299895404","https://openalex.org/W1536289922"],"abstract_inverted_index":{"We":[0,74,88,116],"consider":[1,75],"the":[2,9,17,66,80,95,111,123],"problem":[3],"of":[4,16,60,98,113,125],"best":[5],"arm":[6,25,62],"identification":[7],"in":[8],"fixed":[10],"confidence":[11],"setting":[12],"for":[13],"a":[14,31,90],"variant":[15],"multi-arm":[18],"bandit":[19,86],"problem.":[20,115],"In":[21,40],"our":[22,114,118],"problem,":[23],"each":[24,61],"is":[26,43,63],"associated":[27],"with":[28,47,105],"two":[29,76],"attributes,":[30],"known":[32,44],"deterministic":[33],"cost,":[34],"and":[35,72,84,101,131],"an":[36],"unknown":[37],"stochastic":[38],"reward.":[39],"addition,":[41],"it":[42],"that":[45,109],"arms":[46],"higher":[48,51],"costs":[49],"have":[50],"rewards":[52],"across":[53],"every":[54],"sample":[55,96],"path.":[56],"The":[57],"net":[58],"utility":[59],"defined":[64],"as":[65],"difference":[67],"between":[68],"its":[69],"expected":[70],"reward":[71],"cost.":[73],"information":[77,82],"models,":[78],"namely,":[79],"full":[81],"feedback":[83],"sequential":[85],"feedback.":[87],"derive":[89],"fundamental":[91],"lower":[92],"bound":[93],"on":[94],"complexity":[97],"any":[99],"policy":[100],"also":[102],"propose":[103],"policies":[104,128],"provable":[106],"performance":[107,124],"guarantees":[108],"exploit":[110],"structure":[112],"supplement":[117],"analytical":[119],"results":[120],"by":[121],"comparing":[122],"various":[126],"candidate":[127],"via":[129],"synthetic":[130],"data-driven":[132],"simulations.":[133]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}