{"id":"https://openalex.org/W7128033499","doi":"https://doi.org/10.48550/arxiv.2602.03972","title":"Fixed Budget is No Harder Than Fixed Confidence in Best-Arm Identification up to Logarithmic Factors","display_name":"Fixed Budget is No Harder Than Fixed Confidence in Best-Arm Identification up to Logarithmic Factors","publication_year":2026,"publication_date":"2026-02-03","ids":{"openalex":"https://openalex.org/W7128033499","doi":"https://doi.org/10.48550/arxiv.2602.03972"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2602.03972","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.03972","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2602.03972","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114634771","display_name":"Kapilan Balagopalan","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Balagopalan, Kapilan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125215398","display_name":"Yinan Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Yinan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125132338","display_name":"Yao Zhao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhao, Yao","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125109198","display_name":"Tuan Nguyen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nguyen, Tuan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037320511","display_name":"Anton Daitche","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daitche, Anton","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5124312198","display_name":"Houssam Nassif","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nassif, Houssam","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5046896406","display_name":"Kwang-Sung Jun","orcid":"https://orcid.org/0000-0001-5483-3161"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jun, Kwang-Sung","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5114634771"],"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.9510999917984009,"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.9510999917984009,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.03420000150799751,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12288","display_name":"Optimization and Search Problems","score":0.0015999999595806003,"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/logarithm","display_name":"Logarithm","score":0.875},{"id":"https://openalex.org/keywords/sample-complexity","display_name":"Sample complexity","score":0.7300999760627747},{"id":"https://openalex.org/keywords/sample","display_name":"Sample (material)","score":0.6061999797821045},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5468000173568726},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5406000018119812},{"id":"https://openalex.org/keywords/identification","display_name":"Identification (biology)","score":0.5263000130653381},{"id":"https://openalex.org/keywords/sample-size-determination","display_name":"Sample size determination","score":0.4620000123977661}],"concepts":[{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.875},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.7300999760627747},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6685000061988831},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.6061999797821045},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5468000173568726},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5406000018119812},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.5263000130653381},{"id":"https://openalex.org/C129848803","wikidata":"https://www.wikidata.org/wiki/Q2564360","display_name":"Sample size determination","level":2,"score":0.4620000123977661},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4327999949455261},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42309999465942383},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3871999979019165},{"id":"https://openalex.org/C3020318244","wikidata":"https://www.wikidata.org/wiki/Q4812187","display_name":"Large sample","level":2,"score":0.33559998869895935},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3273000121116638},{"id":"https://openalex.org/C44249647","wikidata":"https://www.wikidata.org/wiki/Q208498","display_name":"Confidence interval","level":2,"score":0.3059000074863434},{"id":"https://openalex.org/C96563100","wikidata":"https://www.wikidata.org/wiki/Q8037118","display_name":"Worst-case complexity","level":3,"score":0.28200000524520874},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2770000100135803},{"id":"https://openalex.org/C24604422","wikidata":"https://www.wikidata.org/wiki/Q4828244","display_name":"Average-case complexity","level":3,"score":0.26759999990463257},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.26249998807907104},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.26179999113082886}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2602.03972","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.03972","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2602.03972","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.03972","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"best-arm":[1],"identification":[2],"(BAI)":[3],"problem":[4],"is":[5,85,111,159],"one":[6],"of":[7,145,149,163,206],"the":[8,20,25,33,37,62,74,146,154,164],"most":[9],"fundamental":[10,179],"problems":[11],"in":[12,117],"interactive":[13],"machine":[14],"learning,":[15],"which":[16,110],"has":[17,187],"two":[18],"flavors:":[19],"fixed-budget":[21],"setting":[22,27],"(FB)":[23],"and":[24,48,122,183],"fixed-confidence":[26],"(FC).":[28],"For":[29],"$K$-armed":[30],"bandits":[31],"with":[32,193],"unique":[34],"best":[35],"arm,":[36],"optimal":[38,155,165],"sample":[39,136,147,157,167,201],"complexities":[40],"for":[41,203],"both":[42],"settings":[43],"have":[44],"been":[45],"settled":[46],"down,":[47],"they":[49],"match":[50],"up":[51,90,140,169],"to":[52,91,107,141,170,199],"logarithmic":[53,92,142,171],"factors.":[54,93,172],"This":[55,151],"prompts":[56],"an":[57,118,126,160],"interesting":[58],"research":[59],"question":[60],"about":[61],"generic,":[63],"potentially":[64],"structured":[65],"BAI":[66],"problems:":[67],"Is":[68],"FB":[69,84,127,166,182,207],"harder":[70,87],"than":[71,88],"FC":[72,89,119,156,196],"or":[73],"other":[75],"way":[76],"around?":[77],"In":[78],"this":[79,96,132],"paper,":[80],"we":[81,98],"show":[82],"that":[83,115,131,138,144,153],"no":[86],"We":[94,129],"do":[95],"constructively:":[97],"propose":[99],"a":[100,112,135,178,188,204],"novel":[101],"algorithm":[102,114,120],"called":[103],"FC2FB":[104,133],"(fixed":[105],"confidence":[106],"fixed":[108],"budget),":[109],"meta":[113],"takes":[116],"$\\mathcal{A}$":[121],"turn":[123],"it":[124],"into":[125],"algorithm.":[128],"prove":[130],"enjoys":[134],"complexity":[137,148,158,168,202],"matches,":[139],"factors,":[143],"$\\mathcal{A}$.":[150],"means":[152],"upper":[161],"bound":[162],"Our":[173],"result":[174],"not":[175],"only":[176],"reveals":[177],"relationship":[180],"between":[181],"FC,":[184],"but":[185],"also":[186],"significant":[189],"implication:":[190],"FC2FB,":[191],"combined":[192],"existing":[194],"state-of-the-art":[195],"algorithms,":[197],"leads":[198],"improved":[200],"number":[205],"problems.":[208]},"counts_by_year":[],"updated_date":"2026-02-07T06:15:42.627816","created_date":"2026-02-07T00:00:00"}