{"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/discovering-symbolic-expressions-with","title":"Discovering symbolic expressions with parallelized tree search","arxiv_id":"2407.04405","date":"2024-07-05","proceeding":null,"authors":["Kai Ruan","Ze-Feng Gao","Yike Guo","Hao Sun","Ji-Rong Wen","Yang Liu"],"abstract":"Symbolic regression plays a crucial role in modern scientific research thanks to its capability of discovering concise and interpretable mathematical expressions from data. A grand challenge lies in the arduous search for parsimonious and generalizable mathematical formulas, in an infinite search space, while intending to fit the training data. Existing algorithms have faced a critical bottleneck of accuracy and efficiency over a decade when handling problems of complexity, which essentially hinders the pace of applying symbolic regression for scientific exploration across interdisciplinary domains. To this end, we introduce a parallelized tree search (PTS) model to efficiently distill generic mathematical expressions from limited data. Through a series of extensive experiments, we demonstrate the superior accuracy and efficiency of PTS for equation discovery, which greatly outperforms the state-of-the-art baseline models on over 80 synthetic and experimental datasets (e.g., lifting its performance by up to 99% accuracy improvement and one-order of magnitude speed up). PTS represents a key advance in accurate and efficient data-driven discovery of symbolic, interpretable models (e.g., underlying physical laws) and marks a pivotal transition towards scalable symbolic learning.","url_abs":"https://arxiv.org/abs/2407.04405v1","url_pdf":"https://arxiv.org/pdf/2407.04405v1.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":"discovering-symbolic-expressions-with","repo_url":"https://github.com/intell-sci-comput/pts","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"equation-discovery","task_name":"Equation Discovery"},{"task_slug":"symbolic-regression","task_name":"Symbolic Regression"},{"task_slug":"regression-1","task_name":"regression"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2407.04405","atlas_url":"https://app.syntology.ai/?focus=2407.04405","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.04405"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2407.04405"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2407.04405"},"call":"get_harvested_code_for_paper(arxiv_id=\"2407.04405\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2407.04405"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2407.04405\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2407.04405"},"call":"get_concepts_for_paper(arxiv_id=\"2407.04405\")"}],"by_repo":[{"repo":"intell-sci-comput/pts","kind":"official","samples":10,"ran":8,"instrument":4,"unverified":2}],"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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2407.04405.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2407.04405.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/intell-sci-comput/pts","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran_draft_wrong":4,"ran":3,"ran_violates":1,"unverified":2},"n_samples":10,"n_ran":8,"n_constructed":0,"n_ran_checked":4,"n_instrument":4,"n_unverified":2,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":10,"ran":8,"n_ran_checked":4,"n_instrument":4,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":8,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-24","last":"2026-09-24","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"a12ba8299b72219f","code_sha256_prefix":"a12ba8299b72219f","entry":"compute_lcm","repo":"intell-sci-comput/pts","repo_kind":"official","path":"model/functions.py","file_url":"https://github.com/intell-sci-comput/pts/blob/HEAD/model/functions.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"A:Tensor/2/int, B:Tensor/2/int","fixture_out_type":"Tensor","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"a12ba8299b72219f"}},{"code_sha256":"d7110ab0bcc85f71","code_sha256_prefix":"d7110ab0bcc85f71","entry":"compute_lcm_batched","repo":"intell-sci-comput/pts","repo_kind":"official","path":"model/functions.py","file_url":"https://github.com/intell-sci-comput/pts/blob/HEAD/model/functions.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"A:Tensor/2/int, B:Tensor/2/int, batch_size:int/0/int","fixture_out_type":"Tensor","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"d7110ab0bcc85f71"}},{"code_sha256":"36b9e29872a5d07c","code_sha256_prefix":"36b9e29872a5d07c","entry":"compute_lcm_cartesian","repo":"intell-sci-comput/pts","repo_kind":"official","path":"model/functions.py","file_url":"https://github.com/intell-sci-comput/pts/blob/HEAD/model/functions.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"x:Tensor/1/int","fixture_out_type":"Tensor","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"36b9e29872a5d07c"}},{"code_sha256":"f4f4fe93c57181f3","code_sha256_prefix":"f4f4fe93c57181f3","entry":"densify","repo":"intell-sci-comput/pts","repo_kind":"official","path":"model/regressor.py","file_url":"https://github.com/intell-sci-comput/pts/blob/HEAD/model/regressor.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"expr_c:str/0/str, variables:list/1/str","fixture_out_type":"tuple","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":"/code/densify","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"f4f4fe93c57181f3"}},{"code_sha256":"617ae7880b57eb8f","code_sha256_prefix":"617ae7880b57eb8f","entry":"densify","repo":"intell-sci-comput/pts","repo_kind":"official","path":"result_analyze_chaotic.py","file_url":"https://github.com/intell-sci-comput/pts/blob/HEAD/result_analyze_chaotic.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"expr_c:str/0/str, variables:list/1/str","fixture_out_type":"tuple","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":"/code/densify","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"617ae7880b57eb8f"}},{"code_sha256":"0e79e24d7998726a","code_sha256_prefix":"0e79e24d7998726a","entry":"if_is_exist","repo":"intell-sci-comput/pts","repo_kind":"official","path":"run_benchmark_all.py","file_url":"https://github.com/intell-sci-comput/pts/blob/HEAD/run_benchmark_all.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"path:str/0/str, name:str/0/str","fixture_out_type":"bool","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","retrieve_with":{"tool":"get_code","code_sha256":"0e79e24d7998726a"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0e79e24d7998726a"}},{"code_sha256":"3bb6258085cf43d0","code_sha256_prefix":"3bb6258085cf43d0","entry":"insert_B_on_Add","repo":"intell-sci-comput/pts","repo_kind":"official","path":"model/regressor.py","file_url":"https://github.com/intell-sci-comput/pts/blob/HEAD/model/regressor.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"expr_sympy:Add/0/?","fixture_out_type":"Add","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"3bb6258085cf43d0"}},{"code_sha256":"0fc1b4f7def536a3","code_sha256_prefix":"0fc1b4f7def536a3","entry":"insert_B_on_Add","repo":"intell-sci-comput/pts","repo_kind":"official","path":"result_analyze_chaotic.py","file_url":"https://github.com/intell-sci-comput/pts/blob/HEAD/result_analyze_chaotic.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"expr_sympy:Add/0/?","fixture_out_type":"Add","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0fc1b4f7def536a3"}},{"code_sha256":"5a4f02271f2d9e3c","code_sha256_prefix":"5a4f02271f2d9e3c","entry":"condense","repo":"intell-sci-comput/pts","repo_kind":"official","path":"model/regressor.py","file_url":"https://github.com/intell-sci-comput/pts/blob/HEAD/model/regressor.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"5a4f02271f2d9e3c"}},{"code_sha256":"f80baa01571282bd","code_sha256_prefix":"f80baa01571282bd","entry":"condense","repo":"intell-sci-comput/pts","repo_kind":"official","path":"result_analyze_chaotic.py","file_url":"https://github.com/intell-sci-comput/pts/blob/HEAD/result_analyze_chaotic.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"f80baa01571282bd"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"e4e24fba94f0534506a979fe178c88e71db051d87afdd9bbbd3b73975ce5e4d9","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}