FePySR: A Neural Feature Extraction Framework for Efficient and Scalable Symbolic Regression

• URL: http://arxiv.org/abs/2605.12704v1
• Date: Tue, 12 May 2026 20:04:59 GMT
• Title: FePySR: A Neural Feature Extraction Framework for Efficient and Scalable Symbolic Regression
• Abstract summary: We introduce FePySR, a two-stage framework that reduces the SR search space by extracting valid features prior to equation search.<n>Across five standard benchmarks, FePySR outperforms state-of-the-art methods by achieving higher equation recovery rates.<n>FePySR is a generalizable framework that can enhance the SR solvers, enabling the efficient and reliable recovery of symbolic expressions.
• Score: 4.327979408469824
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: 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.

Related papers

• SMILE: Bridging Continuous Optimization and Discrete Symbolic Recovery [29.456350389050574]
  Symbolic regression discovers closed-form mathematical expressions from data, offering interpretability beyond black-box models.<n>We introduce SMILE, a hybrid framework that unifies continuous gradient-based optimization with discrete symbolic recovery.<n>We evaluate SMILE on SRBench across ground-truth and black-box datasets, with ablation studies validating each component.
  arXiv  Detail & Related papers  (2026-09-04T02:20:00Z)
• MeanSR: Restoration Trajectory Learning for One-Step Perceptual Super-Resolution [50.60539317126614]
  MeanSR learns an LR-conditioned average velocity field to directly capture the finite-time transition from noisy inputs to plausible HR outputs.<n>Experiments show that MeanSR outperforms CTMSR on CLIPIQA, MUSIQ, and MANIQA while substantially reducing FLOPs and inference latency.
  arXiv  Detail & Related papers  (2026-08-10T10:33:18Z)
• Influence-Guided Symbolic Regression: Scientific Discovery via LLM-Driven Equation Search with Granular Feedback [56.69850045068714]
  We introduce textitInfluence-Guided Regression (IGSR), a method that frames equation discovery as an iterative two-step process.<n>We demonstrate IGSRs effectiveness on a diverse suite of benchmarks, including LLM-SRBench, pharmacological PKPD models, an epidemiological simulation, and real-world genomic data.
  arXiv  Detail & Related papers  (2026-05-27T23:48:01Z)
• When Good Equations Get Bad Scores: Improving Symbolic Regression Through Better Parameter Optimization [24.34939435234426]
  Symbolic Regression (SR) plays a central role in scientific knowledge discovery by distilling mathematical equations from observational data.<n>We propose SAGE-Fit, an SR fitting framework that exploits the dual priors of symbolic expressions.
  arXiv  Detail & Related papers  (2026-05-22T06:23:28Z)
• Breaking the Simplification Bottleneck in Amortized Neural Symbolic Regression [8.351253396371686]
  SimpliPy is a rule-based simplification engine achieving a 100-fold speed-up over SymPy at comparable quality.<n>We demonstrate these advantages in our Flash-ANSR framework, which achieves much better accuracy than amortized baselines.
  arXiv  Detail & Related papers  (2026-02-09T16:47:00Z)
• Current Challenges of Symbolic Regression: Optimization, Selection, Model Simplification, and Benchmarking [0.0]
  Symbolic Regression (SR) aims to discover mathematical expressions that describe the relationship between variables.<n>Current methods must be constantly re-evaluated to understand the SR landscape.<n>This thesis addresses these challenges through a sequence of studies conducted throughout the doctorate.
  arXiv  Detail & Related papers  (2025-12-01T13:48:07Z)
• AdaptSR: Low-Rank Adaptation for Efficient and Scalable Real-World Super-Resolution [50.584551250242235]
  AdaptSR is a low-rank adaptation framework that efficiently repurposes bi-cubic-trained SR models for real-world tasks.<n>Our experiments demonstrate that AdaptSR outperforms GAN and diffusion-based SR methods by up to 4 dB in PSNR and 2% in perceptual scores on real SR benchmarks.
  arXiv  Detail & Related papers  (2025-03-10T18:03:18Z)
• Ab Initio Nonparametric Variable Selection for Scalable Symbolic Regression with Large $p$ [2.222138965069487]
  Symbolic regression (SR) is a powerful technique for discovering symbolic expressions that characterize nonlinear relationships in data.<n>Existing SR methods do not scale to datasets with a large number of input variables, which is common in modern scientific applications.<n>We propose PAN+SR, which combines ab initio nonparametric variable selection with SR to efficiently pre-screen large input spaces.
  arXiv  Detail & Related papers  (2024-10-17T15:41:06Z)
• Discovering physical laws with parallel symbolic enumeration [67.36739393470869]
  We introduce parallel symbolic enumeration (PSE) to efficiently distill generic mathematical expressions from limited data.<n>Experiments show that PSE achieves higher accuracy and faster computation compared to the state-of-the-art baseline algorithms.<n> PSE represents an advance in accurate and efficient data-driven discovery of symbolic, interpretable models.
  arXiv  Detail & Related papers  (2024-07-05T10:41:15Z)
• Transforming Image Super-Resolution: A ConvFormer-based Efficient Approach [58.57026686186709]
  We introduce the Convolutional Transformer layer (ConvFormer) and propose a ConvFormer-based Super-Resolution network (CFSR) CFSR inherits the advantages of both convolution-based and transformer-based approaches. Experiments demonstrate that CFSR strikes an optimal balance between computational cost and performance.
  arXiv  Detail & Related papers  (2024-01-11T03:08:00Z)
• Deep Generative Symbolic Regression [83.04219479605801]
  Symbolic regression aims to discover concise closed-form mathematical equations from data. Existing methods, ranging from search to reinforcement learning, fail to scale with the number of input variables. We propose an instantiation of our framework, Deep Generative Symbolic Regression.
  arXiv  Detail & Related papers  (2023-12-30T17:05:31Z)
• ICF-SRSR: Invertible scale-Conditional Function for Self-Supervised Real-world Single Image Super-Resolution [60.90817228730133]
  Single image super-resolution (SISR) is a challenging problem that aims to up-sample a given low-resolution (LR) image to a high-resolution (HR) counterpart. Recent approaches are trained on simulated LR images degraded by simplified down-sampling operators. We propose a novel Invertible scale-Conditional Function (ICF) which can scale an input image and then restore the original input with different scale conditions.
  arXiv  Detail & Related papers  (2023-07-24T12:42:45Z)
• Exhaustive Symbolic Regression [0.0]
  Exhaustive Symbolic Regression (ESR) is a rigorous method for combining preferences into a single objective. We apply it to a catalogue of cosmic chronometers and the Pantheon+ sample of supernovae to learn the Hubble rate. We make our code and full equation sets publicly available.
  arXiv  Detail & Related papers  (2022-11-21T13:48:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.