{"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/learning-to-discover-efficient-mathematical","title":"Learning to Discover Efficient Mathematical Identities","arxiv_id":"1406.1584","date":"2014-06-06","proceeding":"NeurIPS 2014 12","authors":["Wojciech Zaremba","Karol Kurach","Rob Fergus"],"abstract":"In this paper we explore how machine learning techniques can be applied to\nthe discovery of efficient mathematical identities. We introduce an attribute\ngrammar framework for representing symbolic expressions. Given a set of grammar\nrules we build trees that combine different rules, looking for branches which\nyield compositions that are analytically equivalent to a target expression, but\nof lower computational complexity. However, as the size of the trees grows\nexponentially with the complexity of the target expression, brute force search\nis impractical for all but the simplest of expressions. Consequently, we\nintroduce two novel learning approaches that are able to learn from simpler\nexpressions to guide the tree search. The first of these is a simple n-gram\nmodel, the other being a recursive neural-network. We show how these approaches\nenable us to derive complex identities, beyond reach of brute-force search, or\nhuman derivation.","url_abs":"http://arxiv.org/abs/1406.1584v3","url_pdf":"http://arxiv.org/pdf/1406.1584v3.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":"learning-to-discover-efficient-mathematical","repo_url":"https://github.com/kkurach/math_learning","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"attribute","task_name":"Attribute"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1406.1584","atlas_url":"https://app.syntology.ai/?focus=1406.1584","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1406.1584"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1406.1584\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1406.1584"},"call":"get_concepts_for_paper(arxiv_id=\"1406.1584\")"}],"by_repo":[{"repo":"kkurach/math_learning","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":"63423608070c271ef2f242ca44000e12e952299a578c7d9277172ee34dcaa692","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}