{"id":"https://openalex.org/W7148618815","doi":"https://doi.org/10.48550/arxiv.2604.00510","title":"Adaptive Parallel Monte Carlo Tree Search for Efficient Test-time Compute Scaling","display_name":"Adaptive Parallel Monte Carlo Tree Search for Efficient Test-time Compute Scaling","publication_year":2026,"publication_date":"2026-04-01","ids":{"openalex":"https://openalex.org/W7148618815","doi":"https://doi.org/10.48550/arxiv.2604.00510"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.00510","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.00510","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":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.00510","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113037055","display_name":"Hongbeen Kim","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kim, Hongbeen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100396200","display_name":"Juhyun Lee","orcid":"https://orcid.org/0000-0003-3337-1134"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lee, Juhyun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132806700","display_name":"Sanghyeon Lee","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lee, Sanghyeon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132808841","display_name":"Kwanghoon Choi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Choi, Kwanghoon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5047149607","display_name":"Jaehyuk Huh","orcid":"https://orcid.org/0000-0002-1742-047X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huh, Jaehyuk","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.5378999710083008,"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"}},"topics":[{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.5378999710083008,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.09520000219345093,"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/T10028","display_name":"Topic Modeling","score":0.05209999904036522,"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/boosting","display_name":"Boosting (machine learning)","score":0.6653000116348267},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6586999893188477},{"id":"https://openalex.org/keywords/monte-carlo-tree-search","display_name":"Monte Carlo tree search","score":0.5924999713897705},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.586899995803833},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.5745999813079834},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.550599992275238},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.48010000586509705},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44020000100135803}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7724999785423279},{"id":"https://openalex.org/C46686674","wikidata":"https://www.wikidata.org/wiki/Q466303","display_name":"Boosting (machine learning)","level":2,"score":0.6653000116348267},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6586999893188477},{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.5924999713897705},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.586899995803833},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.5745999813079834},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.550599992275238},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.48010000586509705},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44020000100135803},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.43380001187324524},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3653999865055084},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3625999987125397},{"id":"https://openalex.org/C15482360","wikidata":"https://www.wikidata.org/wiki/Q15238499","display_name":"Monte Carlo algorithm","level":3,"score":0.3440000116825104},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.3427000045776367},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33640000224113464},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3174000084400177},{"id":"https://openalex.org/C3017813396","wikidata":"https://www.wikidata.org/wiki/Q17078173","display_name":"Resource constraints","level":2,"score":0.30570000410079956},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.2912999987602234},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.2782999873161316},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2728999853134155},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.26919999718666077},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.26179999113082886},{"id":"https://openalex.org/C2775904623","wikidata":"https://www.wikidata.org/wiki/Q108529","display_name":"Tera-","level":2,"score":0.26159998774528503},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.25999999046325684},{"id":"https://openalex.org/C84525736","wikidata":"https://www.wikidata.org/wiki/Q831366","display_name":"Decision tree","level":2,"score":0.25450000166893005},{"id":"https://openalex.org/C19012869","wikidata":"https://www.wikidata.org/wiki/Q578372","display_name":"Response time","level":2,"score":0.2508000135421753}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.00510","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.00510","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":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.00510","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.00510","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":"article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.48537108302116394,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Monte":[0],"Carlo":[1],"Tree":[2],"Search":[3],"(MCTS)":[4],"is":[5],"an":[6,69],"effective":[7,50],"test-time":[8],"compute":[9],"scaling":[10],"(TTCS)":[11],"method":[12],"for":[13],"improving":[14,96],"the":[15],"reasoning":[16,100],"performance":[17],"of":[18],"large":[19],"language":[20],"models,":[21],"but":[22,47],"its":[23],"highly":[24],"variable":[25],"execution":[26],"time":[27],"leads":[28],"to":[29,78],"severe":[30],"long-tail":[31],"latency":[32,43,94],"in":[33,44],"practice.":[34],"Existing":[35],"optimizations":[36],"such":[37],"as":[38],"positive":[39],"early":[40,61],"exit,":[41],"reduce":[42,79,91],"favorable":[45],"cases":[46],"are":[48],"less":[49],"when":[51],"search":[52],"continues":[53],"without":[54],"meaningful":[55],"progress.":[56],"We":[57],"introduce":[58],"{\\it":[59,70],"negative":[60],"exit},":[62],"which":[63],"prunes":[64],"unproductive":[65],"MCTS":[66],"trajectories,":[67],"and":[68,98],"adaptive":[71],"boosting":[72],"mechanism}":[73],"that":[74],"reallocates":[75],"reclaimed":[76],"computation":[77],"resource":[80],"contention":[81],"among":[82],"concurrent":[83],"searches.":[84],"Integrated":[85],"into":[86],"vLLM,":[87],"these":[88],"techniques":[89],"substantially":[90],"p99":[92],"end-to-end":[93],"while":[95],"throughput":[97],"maintaining":[99],"accuracy.":[101]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-03T00:00:00"}