FePySR: A Neural Feature Extraction Framework for Efficient and Scalable Symbolic Regression
Not on the map. Why?
Abstract (arXiv)
A fundamental challenge in symbolic regression (SR) is efficiently recovering complex mathematical expressions from observational data. Although this problem is NP-hard, many expressions of practical interest decompose naturally into combinations of nonlinear feature modules, concentrating structural complexity into a small number of reusable components. Here, we introduce FePySR, a two-stage framework that reduces the SR search space by extracting valid features prior to equation search. FePySR first employs a heterogeneous neural network to constrain observational data to a set of candidate expressions, then performs structural optimization within this refined expression space using PySR. Across five standard benchmarks, FePySR outperforms state-of-the-art methods by achieving higher equation recovery rates. On a set of 75 highly complex synthesized equations, FePySR recovers 36 equations, while producing substantially smaller mean squared errors on the remaining unrecovered cases, with reduced computation time compared to PySR. FePySR's first stage also maintains consistent performance under varying numbers of selected top features and increasing levels of noise in the observational data. Applied to ordinary differential equations governing biological systems, FePySR successfully identifies governing equations in 24 out of 100 tests where PySR recovers none. Taken together, FePySR is a generalizable framework that can enhance the SR solvers, enabling the efficient and reliable recovery of symbolic expressions across scientific domains.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 22 of its 43 references that are in the map. First posted on arXiv 12 May 2026.
Builds on
22 of 43 references.
References · 22
- 2019AI Feynman: a Physics-Inspired Method for Symbolic Regressioncited by 536
- 2019Deep symbolic regression: Recovering mathematical expressions from data via risk-seeking policy gradientscited by 294
- 2019Deep Learning for Symbolic Mathematicscited by 266
- 2022End-to-end symbolic regression with transformerscited by 195
- 2021Neural Symbolic Regression that Scalescited by 185
- 2018Learning Equations for Extrapolation and Controlcited by 151
- 2020AI Feynman 2.0: Pareto-optimal symbolic regression exploiting graph modularitycited by 140
- 2020SINDy-PI: A Robust Algorithm for Parallel Implicit Sparse Identification of Nonlinear Dynamicscited by 125
- 2021SymbolicGPT: A Generative Transformer Model for Symbolic Regressioncited by 101
- 2021Symbolic Regression via Neural-Guided Genetic Programming Population Seedingcited by 97
- 2019Integration of Neural Network-Based Symbolic Regression in Deep Learning for Scientific Discoverycited by 93
- 2024Symbolic Regression with a Learned Concept Librarycited by 76
10 more
- 2022Symbolic Regression is NP-hardcited by 68
- 2020Guiding Deep Molecular Optimization with Genetic Explorationcited by 51
- 2019Epsilon-Lexicase Selection for Regressioncited by 31
- 2021Improving exploration in policy gradient search: Application to symbolic optimizationcited by 14
- 2024MMSR: Symbolic Regression is a Multi-Modal Information Fusion Taskcited by 13
- 2024ADAM-SINDy: An Efficient Optimization Framework for Parameterized Nonlinear Dynamical System Identificationcited by 10
- 2021Incorporating domain knowledge into neural-guided searchcited by 6
- 2025Noise-Resilient Symbolic Regression with Dynamic Gating Reinforcement Learningcited by 6
- 2024Prove Symbolic Regression is NP-hard by Symbol Graphcited by 3
- 2024DisCo-DSO: Coupling Discrete and Continuous Optimization for Efficient Generative Design in Hybrid Spacescited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.