{"id":"https://openalex.org/W4403334425","doi":"https://doi.org/10.1145/3656019.3689611","title":"Optimizing Tensor Computation Graphs with Equality Saturation and Monte Carlo Tree Search","display_name":"Optimizing Tensor Computation Graphs with Equality Saturation and Monte Carlo Tree Search","publication_year":2024,"publication_date":"2024-10-11","ids":{"openalex":"https://openalex.org/W4403334425","doi":"https://doi.org/10.1145/3656019.3689611"},"language":"en","primary_location":{"id":"doi:10.1145/3656019.3689611","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3656019.3689611","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3656019.3689611?download=true","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2024 International Conference on Parallel Architectures and Compilation Techniques","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3656019.3689611?download=true","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109907658","display_name":"Jakob Hartmann","orcid":null},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Jakob Hartmann","raw_affiliation_strings":["Department of Computer Science and Technology, University of Cambridge, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Technology, University of Cambridge, United Kingdom","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028324061","display_name":"Guoliang He","orcid":"https://orcid.org/0009-0008-9713-1678"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Guoliang He","raw_affiliation_strings":["Department of Computer Science and Technology, University of Cambridge, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Technology, University of Cambridge, United Kingdom","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063536695","display_name":"Eiko Yoneki","orcid":"https://orcid.org/0000-0002-5552-4536"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Eiko Yoneki","raw_affiliation_strings":["Department of Computer Science and Technology, University of Cambridge, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Technology, University of Cambridge, United Kingdom","institution_ids":["https://openalex.org/I241749"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5109907658"],"corresponding_institution_ids":["https://openalex.org/I241749"],"apc_list":null,"apc_paid":null,"fwci":1.2914,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.79234339,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"40","last_page":"52"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T13650","display_name":"Computational Physics and Python Applications","score":0.9955000281333923,"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/monte-carlo-method","display_name":"Monte Carlo method","score":0.6015752553939819},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5848448276519775},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5464687347412109},{"id":"https://openalex.org/keywords/monte-carlo-tree-search","display_name":"Monte Carlo tree search","score":0.5113222599029541},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3967335522174835},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3298899531364441},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3220056891441345},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32103124260902405},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.127282977104187}],"concepts":[{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.6015752553939819},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5848448276519775},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5464687347412109},{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.5113222599029541},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3967335522174835},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3298899531364441},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3220056891441345},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32103124260902405},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.127282977104187}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3656019.3689611","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3656019.3689611","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3656019.3689611?download=true","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2024 International Conference on Parallel Architectures and Compilation Techniques","raw_type":"proceedings-article"},{"id":"pmh:oai:www.repository.cam.ac.uk:1810/377492","is_oa":true,"landing_page_url":"https://www.repository.cam.ac.uk/handle/1810/377492","pdf_url":"https://www.repository.cam.ac.uk/bitstreams/e6a2d2b9-241b-41fa-86d5-72ccab64ca1d/download","source":{"id":"https://openalex.org/S4306401777","display_name":"Apollo (University of Cambridge)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I241749","host_organization_name":"University of Cambridge","host_organization_lineage":["https://openalex.org/I241749"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Object"}],"best_oa_location":{"id":"doi:10.1145/3656019.3689611","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3656019.3689611","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3656019.3689611?download=true","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2024 International Conference on Parallel Architectures and Compilation Techniques","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4403334425.pdf","grobid_xml":"https://content.openalex.org/works/W4403334425.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W78235646","https://openalex.org/W2152397470","https://openalex.org/W2156361796","https://openalex.org/W2168405694","https://openalex.org/W2183341477","https://openalex.org/W2194775991","https://openalex.org/W2549139847","https://openalex.org/W2553303224","https://openalex.org/W2590246587","https://openalex.org/W2604712483","https://openalex.org/W2747329762","https://openalex.org/W2902907165","https://openalex.org/W2963163009","https://openalex.org/W2964081807","https://openalex.org/W2981758446","https://openalex.org/W3016010032","https://openalex.org/W3099525000","https://openalex.org/W3117137355","https://openalex.org/W4312933868","https://openalex.org/W4318541647","https://openalex.org/W4323323088","https://openalex.org/W4327911434","https://openalex.org/W4367626611","https://openalex.org/W4368353156"],"related_works":["https://openalex.org/W2571592646","https://openalex.org/W4247855592","https://openalex.org/W2567165815","https://openalex.org/W2740304877","https://openalex.org/W2978000411","https://openalex.org/W4226164546","https://openalex.org/W2766259847","https://openalex.org/W2112583639","https://openalex.org/W346633817","https://openalex.org/W2563266764"],"abstract_inverted_index":{"The":[0],"real-world":[1],"effectiveness":[2],"of":[3,61,106,184,197],"deep":[4],"neural":[5,198],"networks":[6,199],"often":[7],"depends":[8],"on":[9],"their":[10],"latency,":[11],"thereby":[12],"necessitating":[13],"optimization":[14],"techniques":[15],"that":[16,81,100,152,176],"can":[17,65,89,177],"reduce":[18],"a":[19,84,116,147,172],"model\u2019s":[20],"inference":[21,195],"time":[22],"while":[23],"preserving":[24],"its":[25],"performance.":[26],"One":[27],"popular":[28],"approach":[29,49,151,192],"is":[30],"to":[31,52,69,158,202,205],"sequentially":[32],"rewrite":[33,63,167],"the":[34,53,59,67,107,112,125,135,139,164,194],"input":[35,108],"computation":[36],"graph":[37,149],"into":[38],"an":[39,71,96,189],"equivalent":[40],"but":[41],"faster":[42],"one":[43,62,74],"by":[44,93,162,200],"replacing":[45],"individual":[46],"subgraphs.":[47],"This":[48],"gives":[50],"rise":[51],"so-called":[54],"phase-ordering":[55,136],"problem":[56,137],"in":[57,115,138,188],"which":[58],"application":[60],"rule":[64],"eliminate":[66],"possibility":[68],"apply":[70],"even":[72],"better":[73],"later":[75],"on.":[76],"Recent":[77],"work":[78],"has":[79],"shown":[80],"equality":[82],"saturation,":[83],"technique":[85],"from":[86,127],"compiler":[87],"optimization,":[88],"mitigate":[90],"this":[91,143],"issue":[92],"first":[94],"building":[95],"intermediate":[97],"representation":[98],"(IR)":[99],"efficiently":[101],"stores":[102],"multiple":[103],"optimized":[104,130],"versions":[105,131],"program":[109],"before":[110],"extracting":[111],"best":[113],"solution":[114],"second":[117],"step.":[118],"In":[119,142],"practice,":[120],"however,":[121],"memory":[122],"constraints":[123],"prevent":[124],"IR":[126],"capturing":[128],"all":[129],"and":[132,180],"thus":[133],"reintroduce":[134],"construction":[140],"phase.":[141],"paper,":[144],"we":[145],"present":[146],"tensor":[148,185],"rewriting":[150],"uses":[153],"Monte":[154],"Carlo":[155],"tree":[156],"search":[157],"build":[159],"superior":[160],"IRs":[161],"identifying":[163],"most":[165],"promising":[166],"rules.":[168],"We":[169],"also":[170],"introduce":[171],"novel":[173],"extraction":[174],"algorithm":[175],"provide":[178],"fast":[179],"accurate":[181],"runtime":[182],"estimates":[183],"programs":[186],"represented":[187],"IR.":[190],"Our":[191],"improves":[193],"speedup":[196],"up":[201],"11%":[203],"compared":[204],"existing":[206],"methods.":[207]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}