Discovery of Interpretable Physical Laws in Materials via Language-Model-Guided Symbolic Regression
Authors: Yifeng Guan, Chuyi Liu, Dongzhan Zhou, Lei Bai, Wan-jian Yin, Jingyuan Li, Mao Su
Organizations: Shanghai Artificial Intelligence Laboratory, Shanghai, 200232, China. · School of Physics, Zhejiang University, Hangzhou, 310058, China. · Soochow Institute for Energy and Materials Innovations (SIEMIS), Soochow University, Suzhou, 215006, China. · Hefei National Laboratory,Hefei,230088,China. · Institute for Advanced Study in Physics, Zhejiang University, Hangzhou, 310058, China. · Shenzhen Institute of Advanced Technology, Chinese Academy of Sciences, Shenzhen, 518055, China.
Discovering interpretable physical laws from high-dimensional data is a fundamental challenge in scientific research. Traditional methods, such as symbolic regression, often produce complex, unphysical formulas when searching a vast space of possible forms. We introduce a framework that guides the search process by leveraging the embedded scientific knowledge of large language models, enabling efficient identification of physical laws in the data. We validate our approach by modeling key properties of perovskite materials. Our method mitigates the combinatorial explosion commonly encountered in traditional symbolic regression, reducing the effective search space by a factor of approximately 105. A set of novel formulas for bulk modulus, band gap, and oxygen evolution reaction activity are identified, which not only provide meaningful physical insights but also outperform previous formulas in accuracy and simplicity.
Figures & tables
Figure 1: Overview of the LangLaw framework. The workflow is organized into four interconnected phases forming a closed loop: LLM inference (top left): The Large Language Model (LLM) acts as a reasoning agent. It analyzes the data description (e.g., crystal structure) and previous experience to generate search constraints, including feature selection, iteration counts, and tree depth. Regression (top right): These parameters act as control signals (purple dashed lines) to guide the Symbolic Regression (PySR) engine. The engine performs evolutionary searches using a parallel island model, evolving formula populations via genetic operations like crossover and mutation (details are shown in Supplementary Note S1). Evaluation (bottom right): Candidate formulas on the Pareto front are screened. The optimal formula is selected based on a score function that balances fitting loss and complexity Schmidt and Lipson (2009) . Then if the error is lower enough or comes to the end round, the formula will be output, else the formula will be added into the Formulas Library. Experience (bottom left): The selected formulas and their performance metrics are stored in a formula library. This knowledge is formatted into prompts to update the LLM’s experience, refining the search strategy for subsequent rounds.
Figure 2: Performance comparison on the Perovskite Bulk Modulus dataset. This plot shows the complexity and Mean Absolute Error of formulas of Bulk Modulus found by different methods: Verma and Kumar’s formula (gray points), LangLaw (green points), HI-SISSO (blue points) and LLM-SR (yellow points). The gray line is the Pareto front.
Figure 3: Evaluation of out of distribution generalization capability. The bar chart compares the absolute prediction error of our discovered linear formula against the high-complexity HI-SISSO model on 10 screened perovskite materials not seen during training. Our method (green bars) consistently yields lower prediction errors across diverse compositions compared to HI-SISSO (blue bars), demonstrating superior transferability and robustness in data-scarce scenarios.
Figure 4: Performance comparison on the Band Gap dataset. This plot shows the complexity and Mean Absolute Error of formulas of Band Gap found by LangLaw (green points) and SISSO (blue points). The gray line is the Pareto front.
Figure 5: Performance comparison on the OER activity dataset. This plot shows the complexity and Mean Absolute Error of formulas of OER activity found by LangLaw (green points) and GPSR (blue points). The gray line is the Pareto front.
Symbolic regression is a powerful tool for knowledge discovery, enabling the extraction of interpretable mathematical expressions directly from data. However, conventional symbolic discovery typically follows an end-to-end, "one-step" process, which often generates lengthy and physically meaningless expressions when dealing with real physical systems, leading to poor model generalization. This limitation fundamentally stems from its deviation from the basic path of scientific discovery: physical laws do not exist in a single form but follow a hierarchical and progressive pattern from simplicity to complexity. Motivated by this principle, we propose Chain of Symbolic Regression (CoSR), a novel framework that models the discovery of physical laws as a chain of symbolic knowledge. This knowledge chain is formed by progressively combining multiple knowledge units with clear physical meanings along a specific logic, ultimately enabling the precise discovery of the underlying physical laws from data. CoSR fully recapitulates the progressive discovery path from Kepler's third law to the law of universal gravitation in classical mechanics, and is applied to three types of problems: turbulent Rayleigh-Benard convection, viscous flows in a circular pipe, and laser-metal interaction, demonstrating its ability to improve classical scaling theories. Finally, CoSR showcases its capability to discover new knowledge in the complex engineering problem of aerodynamic coefficients scaling for different aircraft.
Mingkun Xia, Weiwei Zhang
School of Aeronautics, Northwestern Polytechnical University, Xi’an 710072, China · International Joint Institute of Intelligent Fluid Mechanics, Northwestern Polytechnical University, Xi’an 710072, China · National Key Laboratory of Aircraft Configuration Design, Xi’an 710072, China
Scientific equation discovery must combine broad domain priors with strict numerical testing. Symbolic regression supplies numerical grounding but faces a combinatorial search space, whereas many language-model systems ask the model to propose or select formulas directly. We test a different division of labour. We compare role specifications in which the language model acts as equation author, candidate decider or search controller, alongside end-to-end language-model and purely numerical baselines. In the controller setting we propose here, implemented as LLM-PySR, language models specify variables, operators, transformations and search depth; symbolic regression enumerates and fits expressions; and deterministic metrics govern retention. Across 74 AI-Feynman equations and seven complex formula-recovery tasks, search control achieved the strongest observed balance of accuracy, complexity, stability and cost. On an independent battery dataset, LLM-PySR identified a compact piecewise-linear relation between early voltage-curve displacement and cycle life. The results suggest that language models should shape hypothesis exploration rather than decide which equations survive.
Zikai Xie, Wenmei Li, Man Luo +2
State Key Laboratory of Precision and Intelligent Chemistry, Hefei National Research Center for Physical Sciences at the Microscale, School of Chemistry and Materials Science, University of Science and Technology of China, Hefei, China. · Center for Scientific Intelligence Innovation, Hefei, China · School of Chemistry, School of Computer Science, University of Birmingham, Birmingham, UK
Large Language Models (LLMs) offer a promising avenue for scientific discovery, yet their application to symbolic regression is often constrained by inefficient search strategies and coarse feedback signals. Current methods typically guide LLMs using scalar metrics (e.g., global Mean Squared Error), which fail to identify which components of a proposed equation are driving performance or causing error. We introduce Influence-Guided Symbolic Regression (IGSR), a method that frames equation discovery as an iterative two-step process combining diverse term generation with rigorous selection: an LLM generates candidate basis functions ψj(x) for a linear model, which are then evaluated using granular influence scores Δj. These scores quantify each term's marginal contribution to generalization accuracy, enabling an influence-guided pruning process that systematically refines the model structure. Integrating this mechanism into a Monte Carlo Tree Search (MCTS) enables navigating the combinatorial search space while balancing exploration of novel functional forms with exploitation of high-influence components. We demonstrate IGSR's effectiveness on a diverse suite of benchmarks, including LLM-SRBench, pharmacological PKPD models, an epidemiological simulation, and real-world genomic data. Notably, we validate the framework's capacity for genuine discovery in a case study using a high-dimensional biological dataset, in which IGSR identified a novel relationship between DNA methylation and RNA Polymerase II pausing; a hypothesis that was subsequently supported via wet-lab experimentation.
Evgeny S. Saveliev, Samuel Holt, Nabeel Seedat +3
University of Cambridge · Thomson Reuters Foundational Research · U. Colorado, Anschutz Medical Campus +1