{"id":"https://openalex.org/W7162633172","doi":"https://doi.org/10.48550/arxiv.2605.27490","title":"Tree Search With Predictions","display_name":"Tree Search With Predictions","publication_year":2026,"publication_date":"2026-05-26","ids":{"openalex":"https://openalex.org/W7162633172","doi":"https://doi.org/10.48550/arxiv.2605.27490"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.27490","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.27490","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":null,"license_id":null,"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.2605.27490","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049161363","display_name":"Michael Dinitz","orcid":"https://orcid.org/0000-0002-2632-966X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dinitz, Michael","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5137240799","display_name":"Bob Dong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dong, Bob","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5669999718666077,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5669999718666077,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.11240000277757645,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.08789999783039093,"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/binary-search-tree","display_name":"Binary search tree","score":0.539900004863739},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.44279998540878296},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.4262999892234802},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4253999888896942},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41830000281333923},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.41260001063346863},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4106999933719635},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40450000762939453},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.3878999948501587}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6567000150680542},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.539900004863739},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5130000114440918},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.44279998540878296},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.4262999892234802},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4253999888896942},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41830000281333923},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.41260001063346863},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4106999933719635},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40450000762939453},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.3878999948501587},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.3716999888420105},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3662000000476837},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3508000075817108},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.3328000009059906},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.33230000734329224},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.31360000371932983},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.3070000112056732},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2985999882221222},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.2969000041484833},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29429998993873596},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.29409998655319214},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2937000095844269},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.29350000619888306},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28119999170303345},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27570000290870667},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.2694000005722046},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.25290000438690186},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.27490","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.27490","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.27490","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.27490","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"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":{"``Algorithms":[0],"with":[1,18,44],"predictions'',":[2],"or":[3],"``learning-augmented":[4],"algorithms'',":[5],"has":[6,208,223],"proved":[7],"to":[8,53],"be":[9,103,159],"an":[10,87],"extremely":[11],"useful":[12],"paradigm":[13],"for":[14,26,105],"combining":[15],"machine":[16],"learning":[17],"traditional":[19],"algorithms.":[20],"One":[21],"of":[22,67,75,195],"the":[23,55,65,68,72,76,79,83,118,137,141,145,193,196,231],"textbook":[24],"settings":[25],"this":[27,95],"is":[28,64,89,121,124,135,178,192,227],"searching":[29],"a":[30,34,45,91,179,201],"sorted":[31],"array.":[32],"Without":[33],"prediction,":[35],"classical":[36],"binary":[37,51],"search":[38,106,126,180],"takes":[39],"$O(\\log":[40,59,130],"n)$":[41],"queries,":[42,61,132,189],"while":[43],"prediction":[46,69],"we":[47,97,153,174,214],"can":[48,102,158],"use":[49],"``doubling":[50],"search''":[52],"find":[54],"target":[56],"key":[57],"using":[58],"\u03b7)$":[60,131,188],"where":[62,133,190],"$\u03b7$":[63,134],"error":[66],"measured":[70],"as":[71,149],"absolute":[73],"value":[74],"difference":[77],"between":[78,140],"true":[80,146],"location":[81,143],"and":[82,144],"predicted":[84,142],"location.":[85,147],"Since":[86],"array":[88],"just":[90],"path":[92],"graph,":[93],"in":[94,166],"paper":[96],"ask":[98],"whether":[99],"similar":[100],"bounds":[101,157],"achieved":[104,160],"on":[107,161,217],"even":[108],"slightly":[109],"more":[110],"general":[111],"graphs:":[112],"trees.":[113],"We":[114,198],"show":[115,154,215],"first":[116],"that":[117,128,155,167,176,205,220],"high-level":[119],"answer":[120],"``no'':":[122],"there":[123,177],"no":[125],"algorithm":[127,181,207,222],"uses":[129,183],"now":[136],"graph":[138],"distance":[139],"However,":[148],"our":[150,206,221],"main":[151],"result,":[152],"such":[156],"trees":[162],"which":[163,182,226],"are":[164],"``path-like''":[165],"they":[168],"have":[169],"low":[170],"\\emph{pathwidth}.":[171],"In":[172],"particular,":[173],"prove":[175,200],"at":[184],"most":[185],"$O(k":[186],"\\log":[187],"$k$":[191],"pathwidth":[194],"tree.":[197],"also":[199],"lower":[202],"bound":[203],"showing":[204],"existentially":[209],"optimal":[210],"query":[211,224],"complexity.":[212],"Finally,":[213],"experimentally,":[216],"real-life":[218],"inputs,":[219],"complexity":[225],"notably":[228],"better":[229],"than":[230],"simple":[232],"non-prediction-based":[233],"algorithm.":[234]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-29T00:00:00"}