mlsanityData to 7 Oct 2026

Discovering an interpretable mathematical expression for a full wind-turbine wake with artificial intelligence enhanced symbolic regression

arXiv 2406.00695 ↗First posted 2 Jun 2024physics.flu-dyn cs.LG cs.SCcited by 2

Not on the map. Why?

Abstract (arXiv)

The rapid expansion of wind power worldwide underscores the critical significance of engineering-focused analytical wake models in both the design and operation of wind farms. These theoretically-derived ana lytical wake models have limited predictive capabilities, particularly in the near-wake region close to the turbine rotor, due to assumptions that do not hold. Knowledge discovery methods can bridge these gaps by extracting insights, adjusting for theoretical assumptions, and developing accurate models for physical processes. In this study, we introduce a genetic symbolic regression (SR) algorithm to discover an interpretable mathematical expression for the mean velocity deficit throughout the wake, a previously unavailable insight. By incorporating a double Gaussian distribution into the SR algorithm as domain knowledge and designing a hierarchical equation structure, the search space is reduced, thus efficiently finding a concise, physically informed, and robust wake model. The proposed mathematical expression (equation) can predict the wake velocity deficit at any location in the full-wake region with high precision and stability. The model's effectiveness and practicality are validated through experimental data and high-fidelity numerical simulations.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 23 of its 70 references that are in the map. First posted on arXiv 2 Jun 2024.

Builds on

23 of 70 references.

References · 23

  1. 2019AI Feynman: a Physics-Inspired Method for Symbolic Regressioncited by 536
  2. 2020Discovering Symbolic Models from Deep Learning with Inductive Biasescited by 335
  3. 2019Deep symbolic regression: Recovering mathematical expressions from data via risk-seeking policy gradientscited by 294
  4. 2021Contemporary Symbolic Regression Methods and their Relative Performancecited by 209
  5. 2022End-to-end symbolic regression with transformerscited by 195
  6. 2020Physics-informed learning of governing equations from scarce datacited by 167
  7. 2016Extrapolation and learning equationscited by 106
  8. 2022Interpretable Scientific Discovery with Symbolic Regression: A Reviewcited by 105
  9. 2019Bayesian Symbolic Regressioncited by 77
  10. 2023Deep symbolic regression for physics guided by units constraints: toward the automated discovery of physical lawscited by 55
  11. 2020DLGA-PDE: Discovery of PDEs with incomplete candidate library via combination of deep learning and genetic algorithmcited by 45
  12. 2019DL-PDE: Deep-learning based data-driven discovery of partial differential equations from discrete and noisy datacited by 38
11 more
  1. 2021Any equation is a forest: Symbolic genetic algorithm for discovering open-form partial differential equations (SGA-PDE)cited by 38
  2. 2023Interpretable Machine Learning for Science with PySR and SymbolicRegression.jlcited by 36
  3. 2021Robust discovery of partial differential equations in complex situationscited by 21
  4. 2023Controllable Neural Symbolic Regressioncited by 19
  5. 2022Integration of knowledge and data in machine learningcited by 13
  6. 2023Physics-constrained robust learning of open-form partial differential equations from limited and noisy datacited by 8
  7. 2023Interpretable Symbolic Regression for Data Science: Analysis of the 2022 Competitioncited by 6
  8. 2023Active Learning in Symbolic Regression with Physical Constraintscited by 3
  9. 2020Physics-constrained indirect supervised learningcited by 2
  10. 2021Physical Constraint Embedded Neural Networks for inference and noise regulationcited by 1
  11. 2024Empowering Machines to Think Like Chemists: Unveiling Molecular Structure-Polarity Relationships with Hierarchical Symbolic Regressioncited by 1

Built on by

Cited by year

Citing papers per year: 2025: 2.

2 papers.