{"id":"https://openalex.org/W7163173301","doi":"https://doi.org/10.48550/arxiv.2606.01708","title":"Two-Fidelity Best-Action Identification for Stochastic Minimax Tree","display_name":"Two-Fidelity Best-Action Identification for Stochastic Minimax Tree","publication_year":2026,"publication_date":"2026-06-01","ids":{"openalex":"https://openalex.org/W7163173301","doi":"https://doi.org/10.48550/arxiv.2606.01708"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.01708","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.01708","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.01708","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5137673783","display_name":"Peter Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Peter","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5137659006","display_name":"Xi Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Xi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"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.2094999998807907,"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.2094999998807907,"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/T12026","display_name":"Explainable Artificial Intelligence (XAI)","score":0.14990000426769257,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.12200000137090683,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.7182999849319458},{"id":"https://openalex.org/keywords/identification","display_name":"Identification (biology)","score":0.6259999871253967},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.6241000294685364},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.573199987411499},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5340999960899353},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5335000157356262},{"id":"https://openalex.org/keywords/monte-carlo-tree-search","display_name":"Monte Carlo tree search","score":0.4691999852657318},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.44440001249313354}],"concepts":[{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.7182999849319458},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6279000043869019},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.6259999871253967},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.6241000294685364},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6184999942779541},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.573199987411499},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5340999960899353},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5335000157356262},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47530001401901245},{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.4691999852657318},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.44440001249313354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31049999594688416},{"id":"https://openalex.org/C2779304628","wikidata":"https://www.wikidata.org/wiki/Q3503480","display_name":"Face (sociological concept)","level":2,"score":0.2939000129699707},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.29269999265670776},{"id":"https://openalex.org/C79610928","wikidata":"https://www.wikidata.org/wiki/Q1656743","display_name":"Parameter identification problem","level":3,"score":0.2913999855518341},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.27390000224113464},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.26600000262260437},{"id":"https://openalex.org/C95815963","wikidata":"https://www.wikidata.org/wiki/Q1377033","display_name":"Game tree","level":4,"score":0.260699987411499},{"id":"https://openalex.org/C99414536","wikidata":"https://www.wikidata.org/wiki/Q7098950","display_name":"Optimal stopping","level":2,"score":0.259799987077713},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.2574999928474426},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.25040000677108765}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.01708","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.01708","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.01708","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.01708","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.6600480079650879}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,52,95],"study":[1],"fixed-confidence":[2,97],"best-action":[3],"identification":[4],"(BAI)":[5],"in":[6,15],"stochastic":[7,75],"minimax":[8,21],"trees.":[9,66,114],"This":[10],"problem":[11],"is":[12],"increasingly":[13],"relevant":[14],"modern":[16],"AI":[17],"planning,":[18],"where":[19],"deep":[20],"search":[22],"and":[23,85,105,124],"Monte":[24],"Carlo":[25],"Tree":[26],"Search":[27],"(MCTS)":[28],"with":[29,73],"language":[30],"model":[31],"long":[32],"rollouts":[33,46],"face":[34],"a":[35,55,107],"fundamental":[36],"tradeoff:":[37],"heuristic":[38],"evaluations":[39,84,91],"are":[40,47],"cheap":[41,82],"but":[42,49],"biased,":[43],"while":[44],"accurate":[45,90],"reliable":[48],"prohibitively":[50],"expensive.":[51],"propose":[53],"2FFS,":[54],"two-fidelity":[56],"tree-search":[57],"algorithm":[58,68],"that":[59],"brings":[60],"multi-fidelity":[61],"flat":[62],"bandit":[63],"ideas":[64],"into":[65],"The":[67],"combines":[69],"minimax-style":[70],"fast":[71],"expansion":[72],"MCTS-style":[74],"sampling,":[76],"adaptively":[77],"deciding":[78],"when":[79,86],"to":[80,87,128],"exploit":[81],"biased":[83],"invoke":[88],"expensive":[89],"for":[92,102,112],"local":[93],"certification.":[94],"prove":[96],"correctness,":[98],"establish":[99],"finite":[100],"stopping":[101],"exact":[103],"identification,":[104],"give":[106],"polynomial-depth":[108],"cost":[109],"upper":[110],"bound":[111],"general-depth":[113],"Across":[115],"numerical":[116],"stochastic-tree":[117],"experiments,":[118],"2FFS":[119],"uses":[120],"substantially":[121],"fewer":[122],"samples":[123],"computational":[125],"operations":[126],"comparing":[127],"existing":[129],"BAI-MCTS":[130],"baseline.":[131]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-03T00:00:00"}