{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/neural-network-guided-expression","title":"Neural-Network Guided Expression Transformation","arxiv_id":"1902.02194","date":"2019-02-06","proceeding":null,"authors":["Romain Edelmann","Viktor Kunčak"],"abstract":"Optimizing compilers, as well as other translator systems, often work by\nrewriting expressions according to equivalence preserving rules. Given an input\nexpression and its optimized form, finding the sequence of rules that were\napplied is a non-trivial task. Most of the time, the tools provide no proof, of\nany kind, of the equivalence between the original expression and its optimized\nform. In this work, we propose to reconstruct proofs of equivalence of simple\nmathematical expressions, after the fact, by finding paths of equivalence\npreserving transformations between expressions. We propose to find those\nsequences of transformations using a search algorithm, guided by a neural\nnetwork heuristic. Using a Tree-LSTM recursive neural network, we learn a\ndistributed representation of expressions where the Manhattan distance between\nvectors approximately corresponds to the rewrite distance between expressions.\nWe then show how the neural network can be efficiently used to search for\ntransformation paths, leading to substantial gain in speed compared to an\nuninformed exhaustive search. In one of our experiments, our neural-network\nguided search algorithm is able to solve more instances with a 2 seconds\ntimeout per instance than breadth-first search does with a 5 minutes timeout\nper instance.","url_abs":"http://arxiv.org/abs/1902.02194v1","url_pdf":"http://arxiv.org/pdf/1902.02194v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"neural-network-guided-expression","repo_url":"https://github.com/epfl-lara/nugget","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"epfl-lara/nugget","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"2204b3f901a8313ac79add2f5d57508059c950bfb720b47a8aab9f2d2c9f8409","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}