Gradient Information and Regularization for Gene Expression Programming to Develop Data-Driven Physics Closure Models

Abstract Learning accurate numerical constants when developing algebraic models is a known challenge for evolutionary algorithms, such as Gene Expression Programming (GEP). This paper introduces the concept of adaptive symbols to the GEP framework by Weatheritt and Sandberg (J Comput Phys 325:22–37, 2016a) to develop advanced physics closure models. Adaptive symbols utilize gradient information to learn locally optimal numerical constants during model training, for which we investigate two types of nonlinear optimization algorithms. The second contribution of this work is implementing two regularization techniques to incentivize the development of implementable and interpretable closure models. We apply $$L_2$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>L</mml:mi> <mml:mn>2</mml:mn> </mml:msub> </mml:math> regularization to ensure small magnitude numerical constants and devise a novel complexity metric that supports the development of low complexity models via custom symbol complexities and multi-objective optimization. This extended framework is employed to four use cases, namely rediscovering Sutherland’s viscosity law, developing laminar flame speed combustion models and training two types of fluid dynamics turbulence models. The model prediction accuracy and the convergence speed of training are improved significantly across all of the more and less complex use cases, respectively. The two regularization methods are essential for developing implementable closure models and we demonstrate that the developed turbulence models substantially improve simulations over state-of-the-art models.

Authors

Institutions

Publication Details

Journal
Flow Turbulence and Combustion
Published
2024-08-15
DOI
https://doi.org/10.1007/s10494-024-00579-7
Citations
2
Primary Topic
Evolutionary Algorithms and Applications
Type
article
Field-Weighted Citation Impact
0.69

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Gradient Information and Regularization for Gene Expression Programming to Develop Data-Driven Physics Closure Models

Richard D. Sandberg, Abhishek Deshmukh, Haochen Li, Joseph Klewicki et al.
2 citations
Flow Turbulence and Combustion
Evolutionary Algorithms and Applications
0.69
article

Gradient Information and Regularization for Gene Expression Programming to Develop Data-Driven Physics Closure Models

Richard D. Sandberg, Abhishek Deshmukh, Haochen Li, Joseph Klewicki, Temistocle Grenga, Heinz Pitsch, Yaomin Zhao, Fabian Waschkowski
article en
2 citations

Abstract

Abstract Learning accurate numerical constants when developing algebraic models is a known challenge for evolutionary algorithms, such as Gene Expression Programming (GEP). This paper introduces the concept of adaptive symbols to the GEP framework by Weatheritt and Sandberg (J Comput Phys 325:22–37, 2016a) to develop advanced physics closure models. Adaptive symbols utilize gradient information to learn locally optimal numerical constants during model training, for which we investigate two types of nonlinear optimization algorithms. The second contribution of this work is implementing two regularization techniques to incentivize the development of implementable and interpretable closure models. We apply $$L_2$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>L</mml:mi> <mml:mn>2</mml:mn> </mml:msub> </mml:math> regularization to ensure small magnitude numerical constants and devise a novel complexity metric that supports the development of low complexity models via custom symbol complexities and multi-objective optimization. This extended framework is employed to four use cases, namely rediscovering Sutherland’s viscosity law, developing laminar flame speed combustion models and training two types of fluid dynamics turbulence models. The model prediction accuracy and the convergence speed of training are improved significantly across all of the more and less complex use cases, respectively. The two regularization methods are essential for developing implementable closure models and we demonstrate that the developed turbulence models substantially improve simulations over state-of-the-art models.

Flow Turbulence and CombustionVol. 114(1)
The University of Melbourne (AU), Peking University (CN), RWTH Aachen University (DE)
University of Melbourne, National Natural Science Foundation of China, Australian Research Council, Melbourne Research, University of Melbourne
Openalex Percentile: Top 25%
Evolutionary Algorithms and Applications
0.69
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.