Data-Efficient Symbolic Regression via Foundation Model Distillation
Not on the map. Why?
Abstract (arXiv)
Discovering interpretable mathematical equations from observed data (a.k.a. equation discovery or symbolic regression) is a cornerstone of scientific discovery, enabling transparent modeling of physical, biological, and economic systems. While foundation models pre-trained on large-scale equation datasets offer a promising starting point, they often suffer from negative transfer and poor generalization when applied to small, domain-specific datasets. In this paper, we introduce EQUATE (Equation Generation via QUality-Aligned Transfer Embeddings), a data-efficient fine-tuning framework that adapts foundation models for symbolic equation discovery in low-data regimes via distillation. EQUATE combines symbolic-numeric alignment with evaluator-guided embedding optimization, enabling a principled embedding-search-generation paradigm. Our approach reformulates discrete equation search as a continuous optimization task in a shared embedding space, guided by data-equation fitness and simplicity. Experiments across three standard public benchmarks (Feynman, Strogatz, and black-box datasets) demonstrate that EQUATE consistently outperforms state-of-the-art baselines in both accuracy and robustness, while preserving low complexity and fast inference. These results highlight EQUATE as a practical and generalizable solution for data-efficient symbolic regression in foundation model distillation settings.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 25 of its 50 references that are in the map. First posted on arXiv 27 Aug 2025.
Builds on
25 of 50 references.
References · 25
- 2018Hierarchical Neural Story Generationcited by 1,193
- 2019AI Feynman: a Physics-Inspired Method for Symbolic Regressioncited by 548
- 2020Discovering Symbolic Models from Deep Learning with Inductive Biasescited by 344
- 2019Deep symbolic regression: Recovering mathematical expressions from data via risk-seeking policy gradientscited by 309
- 2021Contemporary Symbolic Regression Methods and their Relative Performancecited by 215
- 2022End-to-end symbolic regression with transformerscited by 203
- 2020AI Feynman 2.0: Pareto-optimal symbolic regression exploiting graph modularitycited by 144
- 2017PMLB: A Large Benchmark Suite for Machine Learning Evaluation and Comparisoncited by 140
- 2016Sequence-to-Sequence Learning as Beam-Search Optimizationcited by 127
- 2021SymbolicGPT: A Generative Transformer Model for Symbolic Regressioncited by 105
- 2021Symbolic Regression via Neural-Guided Genetic Programming Population Seedingcited by 101
- 2019Integration of Neural Network-Based Symbolic Regression in Deep Learning for Scientific Discoverycited by 93
13 more
- 2023Transformer-based Planning for Symbolic Regressioncited by 79
- 2023SNIP: Bridging Mathematical Symbolic and Numeric Realms with Unified Pre-trainingcited by 47
- 2019Epsilon-Lexicase Selection for Regressioncited by 31
- 2023Self-optimizing Feature Generation via Categorical Hashing Representation and Hierarchical Reinforcement Crossingcited by 30
- 2022Deep Learning and Symbolic Regression for Discovering Parametric Equationscited by 23
- 2024Feature Selection as Deep Sequential Generative Learningcited by 21
- 2024Unsupervised Generative Feature Transformation via Graph Contrastive Pre-training and Multi-objective Fine-tuningcited by 21
- 2025CT-PatchTST: Channel-Time Patch Time-Series Transformer for Long-Term Renewable Energy Forecastingcited by 16
- 2024Reinforcement Feature Transformation for Polymer Property Performance Predictioncited by 13
- 2024Revolutionizing Biomarker Discovery: Leveraging Generative AI for Bio-Knowledge-Embedded Continuous Space Explorationcited by 11
- 2024Topology-aware Reinforcement Feature Space Reconstruction for Graph Datacited by 11
- 2025Image-to-Image Translation with Diffusion Transformers and CLIP-Based Image Conditioningcited by 6
- 2025Bridging the Domain Gap in Equation Distillation with Reinforcement Feedbackcited by 4
Built on by
Citing papers per year: 2026: 1.
1 paper.