{"id":"https://openalex.org/W4417403874","doi":"https://doi.org/10.1109/pact65351.2025.00029","title":"Guess, Measure & Edit: Using Lowering to Lift Tensor Code","display_name":"Guess, Measure & Edit: Using Lowering to Lift Tensor Code","publication_year":2025,"publication_date":"2025-11-03","ids":{"openalex":"https://openalex.org/W4417403874","doi":"https://doi.org/10.1109/pact65351.2025.00029"},"language":"en","primary_location":{"id":"doi:10.1109/pact65351.2025.00029","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pact65351.2025.00029","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 34th International Conference on Parallel Architectures and Compilation Techniques (PACT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/7cb7c037-9766-4347-8531-4bd457c18361","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072335056","display_name":"Jos\u00e9 Wesley de Souza Magalh\u00e3es","orcid":"https://orcid.org/0000-0003-2767-1130"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Jos\u00e9 Wesley de Souza Magalh\u00e3es","raw_affiliation_strings":["University of Edinburgh,United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh,United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072181658","display_name":"Jackson Woodruff","orcid":"https://orcid.org/0000-0003-2650-9596"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jackson Woodruff","raw_affiliation_strings":["University of Edinburgh,United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh,United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020795476","display_name":"Jordi Armengol-Estap\u00e9","orcid":"https://orcid.org/0000-0001-8893-6185"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jordi Armengol-Estap\u00e9","raw_affiliation_strings":["University of Edinburgh,United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh,United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091099679","display_name":"Alexander Brauckmann","orcid":"https://orcid.org/0000-0001-5774-3970"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Alexander Brauckmann","raw_affiliation_strings":["University of Edinburgh,United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh,United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006432908","display_name":"Luc Jaulmes","orcid":"https://orcid.org/0000-0002-5815-2504"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Luc Jaulmes","raw_affiliation_strings":["University of Edinburgh,United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh,United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009694403","display_name":"Elizabeth Polgreen","orcid":"https://orcid.org/0000-0001-9032-7661"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Elizabeth Polgreen","raw_affiliation_strings":["University of Edinburgh,United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh,United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027001025","display_name":"Michael O\u2019Boyle","orcid":"https://orcid.org/0000-0003-1619-5052"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Michael F.P. O\u2019Boyle","raw_affiliation_strings":["University of Edinburgh,United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh,United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5072335056"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22474199,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"216","last_page":"228"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.30140000581741333,"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/T10126","display_name":"Logic, programming, and type systems","score":0.30140000581741333,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.3010999858379364,"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/T11424","display_name":"Security and Verification in Computing","score":0.06589999794960022,"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/exploit","display_name":"Exploit","score":0.6764000058174133},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.6425999999046326},{"id":"https://openalex.org/keywords/lift","display_name":"Lift (data mining)","score":0.570900022983551},{"id":"https://openalex.org/keywords/programmer","display_name":"Programmer","score":0.5670999884605408},{"id":"https://openalex.org/keywords/suite","display_name":"Suite","score":0.5539000034332275},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5422999858856201},{"id":"https://openalex.org/keywords/code-generation","display_name":"Code generation","score":0.46369999647140503},{"id":"https://openalex.org/keywords/domain-specific-language","display_name":"Domain-specific language","score":0.44600000977516174},{"id":"https://openalex.org/keywords/tensor","display_name":"Tensor (intrinsic definition)","score":0.43059998750686646},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4203000068664551}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7896999716758728},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7135999798774719},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.6764000058174133},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6425999999046326},{"id":"https://openalex.org/C139002025","wikidata":"https://www.wikidata.org/wiki/Q3001212","display_name":"Lift (data mining)","level":2,"score":0.570900022983551},{"id":"https://openalex.org/C2778514511","wikidata":"https://www.wikidata.org/wiki/Q1374194","display_name":"Programmer","level":2,"score":0.5670999884605408},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.5539000034332275},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5422999858856201},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.46369999647140503},{"id":"https://openalex.org/C135257023","wikidata":"https://www.wikidata.org/wiki/Q691358","display_name":"Domain-specific language","level":2,"score":0.44600000977516174},{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"score":0.43059998750686646},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4203000068664551},{"id":"https://openalex.org/C201374245","wikidata":"https://www.wikidata.org/wiki/Q104534","display_name":"Digital subscriber line","level":2,"score":0.4077000021934509},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3952000141143799},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3898000121116638},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.3862000107765198},{"id":"https://openalex.org/C203005215","wikidata":"https://www.wikidata.org/wiki/Q79798","display_name":"Machine translation","level":2,"score":0.3790000081062317},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.36500000953674316},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.3626999855041504},{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.35530000925064087},{"id":"https://openalex.org/C17137986","wikidata":"https://www.wikidata.org/wiki/Q215067","display_name":"Orthogonality","level":2,"score":0.3393000066280365},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.3296000063419342},{"id":"https://openalex.org/C149364088","wikidata":"https://www.wikidata.org/wiki/Q185917","display_name":"Translation (biology)","level":4,"score":0.3172000050544739},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.31709998846054077},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.3125},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.3034000098705292},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.30309998989105225},{"id":"https://openalex.org/C77660490","wikidata":"https://www.wikidata.org/wiki/Q244916","display_name":"Intermediate language","level":3,"score":0.30160000920295715},{"id":"https://openalex.org/C2778361913","wikidata":"https://www.wikidata.org/wiki/Q7248437","display_name":"Program transformation","level":2,"score":0.30079999566078186},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.2809999883174896},{"id":"https://openalex.org/C137293760","wikidata":"https://www.wikidata.org/wiki/Q3621696","display_name":"Language model","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.27889999747276306},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.27379998564720154},{"id":"https://openalex.org/C7051814","wikidata":"https://www.wikidata.org/wiki/Q1051282","display_name":"Generic programming","level":2,"score":0.26600000262260437},{"id":"https://openalex.org/C61423126","wikidata":"https://www.wikidata.org/wiki/Q187432","display_name":"Scripting language","level":2,"score":0.2623000144958496},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.2572999894618988},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.25450000166893005},{"id":"https://openalex.org/C99821215","wikidata":"https://www.wikidata.org/wiki/Q1136583","display_name":"Swap (finance)","level":2,"score":0.25279998779296875},{"id":"https://openalex.org/C2776937632","wikidata":"https://www.wikidata.org/wiki/Q4117718","display_name":"Program synthesis","level":2,"score":0.25270000100135803}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/pact65351.2025.00029","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pact65351.2025.00029","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 34th International Conference on Parallel Architectures and Compilation Techniques (PACT)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/7cb7c037-9766-4347-8531-4bd457c18361","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/7cb7c037-9766-4347-8531-4bd457c18361","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"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":"De Souza Magalh\u00e3es, J W, Woodruff, J, Armengol Estap\u00e9, J, Brauckmann, A, Jaulmes, L, Polgreen, E & O'Boyle, M F P 2025, Guess, Measure & Edit : Using Lowering to Lift Tensor Code. in 2025 34th International Conference on Parallel Architectures and Compilation Techniques (PACT). Proceedings (International Conference on Parallel Architectures and Compilation Techniques), Institute of Electrical and Electronics Engineers, pp. 216-228, The International Conference on Parallel Architectures and Compilation Techniques , 3/11/25. https://doi.org/10.1109/PACT65351.2025.00029","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/7cb7c037-9766-4347-8531-4bd457c18361","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/7cb7c037-9766-4347-8531-4bd457c18361","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"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":"De Souza Magalh\u00e3es, J W, Woodruff, J, Armengol Estap\u00e9, J, Brauckmann, A, Jaulmes, L, Polgreen, E & O'Boyle, M F P 2025, Guess, Measure & Edit : Using Lowering to Lift Tensor Code. in 2025 34th International Conference on Parallel Architectures and Compilation Techniques (PACT). Proceedings (International Conference on Parallel Architectures and Compilation Techniques), Institute of Electrical and Electronics Engineers, pp. 216-228, The International Conference on Parallel Architectures and Compilation Techniques , 3/11/25. https://doi.org/10.1109/PACT65351.2025.00029","raw_type":"contributionToPeriodical"},"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":{"Recently,":[0],"we":[1,185],"have":[2,75],"observed":[3],"a":[4,104,127,132,259],"steady":[5],"growth":[6],"in":[7,16,52,79,247],"specialized":[8],"hardware":[9],"accelerators.":[10],"These":[11],"accelerators":[12],"are":[13,84,91],"typically":[14],"programmed":[15],"high-level":[17,124,172],"domain-specific":[18],"languages":[19],"(DSLs),":[20],"enabling":[21],"compilers":[22],"to":[23,36,49,58,69,86,97,119,123,135,170,174,196,236,258],"generate":[24],"efficient":[25],"code":[26,35,57,122,195],"for":[27],"rapidly":[28],"evolving":[29],"heterogeneous":[30],"hardware.":[31],"However,":[32],"rewriting":[33],"existing":[34,121,191],"exploit":[37],"DSL":[38],"compiler":[39,117],"performance":[40],"is":[41,179,210,229,232],"an":[42,137,217],"onerous":[43],"programmer":[44],"task.":[45],"This":[46,101],"has":[47],"led":[48],"recent":[50],"interest":[51],"automatically":[53],"translating":[54],"or":[55,66,145],"lifting":[56,61,214,226],"DSLs.":[59,100,125,204],"Current":[60],"techniques":[62],"use":[63],"language":[64,73,114,133],"models":[65,74,115],"program":[67,161],"synthesis":[68,89],"translate":[70],"code.":[71,242],"Although":[72],"proved":[76],"remarkably":[77],"successful":[78],"related":[80],"translation":[81],"tasks,":[82],"they":[83],"prone":[85],"hallucinations.":[87],"Program":[88],"approaches":[90],"accurate":[92],"but":[93],"do":[94],"not":[95],"scale":[96],"complex":[98],"tensor":[99,192,202,240],"paper":[102],"presents":[103],"novel":[105],"approach,":[106,184],"Guess,":[107],"Measure":[108],"&":[109],"Edit;":[110],"that":[111,208],"exploits":[112],"both":[113],"and":[116,149,153,212,221,231,253,262],"technology":[118],"lift":[120,238],"Given":[126],"source":[128],"program,":[129,152],"it":[130,178],"uses":[131,166],"model":[134],"guess":[136,148,176],"initial":[138],"equivalent":[139],"target":[140],"program.":[141],"It":[142,164],"then":[143],"compiles":[144],"lowers":[146],"the":[147,150,155,175,199,233],"original":[151],"measures":[154],"low-level":[156,168],"distance":[157],"between":[158],"them":[159],"using":[160],"similarity":[162],"metrics.":[163],"iteratively":[165],"these":[167],"metrics":[169],"guide":[171],"edits":[173],"until":[177],"correct.":[180],"To":[181],"validate":[182],"this":[183],"develop":[186],"KONRUL":[187,209,228],"which":[188],"correctly":[189,237],"lifts":[190],"algebra":[193],"C":[194],"einsum":[197],"notation,":[198],"basis":[200],"of":[201,216,250],"contraction":[203,241],"Our":[205,243],"evaluation":[206],"shows":[207],"fast":[211],"accurate,":[213],"98%":[215],"extensive":[218],"benchmark":[219],"suite":[220],"significantly":[222],"outperforming":[223],"4":[224],"state-of-theart":[225],"schemes.":[227],"scalable":[230],"only":[234],"approach":[235],"higher-dimensional":[239],"lifted":[244],"programs":[245],"result":[246],"geomean":[248],"speedups":[249],"$4.07":[251],"\\times$":[252,255],"$38.30":[254],"when":[256],"ported":[257],"multi-core":[260],"CPU":[261],"GPU":[263],"respectively.":[264]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-12-16T00:00:00"}