The University of Southampton
University of Southampton Institutional Repository

Gradient information and regularisation for gene expression programming to develop data-driven physics closure models

Gradient information and regularisation for gene expression programming to develop data-driven physics closure models
Gradient information and regularisation for gene expression programming to develop data-driven physics closure models

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 L2 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.

Gene Expression Programming, Model complexity, Nonlinear optimization, Regularization
1386-6184
Waschkowski, Fabian
b98ddf08-f427-448a-9a24-84a80df4b29e
Li, Haochen
492769a5-b35b-4249-b1d5-bae78a912494
Deshmukh, Abhishek
f742182f-5891-4f28-a1f7-4d60de974e03
Grenga, Temistocle
be0eba30-74b5-4134-87e7-3a2d6dd3836f
Zhao, Yaomin
7178210e-47cc-4047-850a-756321017477
Pitsch, Heinz
3dc0eb6e-deca-4742-98a1-f0cdd62ff8b8
Klewicki, Joseph
ea1a0bdf-6118-4948-b705-68c33fa7d227
Sandberg, Richard D.
41d03f60-5d12-4f2d-a40a-8ff89ef01cfa
Waschkowski, Fabian
b98ddf08-f427-448a-9a24-84a80df4b29e
Li, Haochen
492769a5-b35b-4249-b1d5-bae78a912494
Deshmukh, Abhishek
f742182f-5891-4f28-a1f7-4d60de974e03
Grenga, Temistocle
be0eba30-74b5-4134-87e7-3a2d6dd3836f
Zhao, Yaomin
7178210e-47cc-4047-850a-756321017477
Pitsch, Heinz
3dc0eb6e-deca-4742-98a1-f0cdd62ff8b8
Klewicki, Joseph
ea1a0bdf-6118-4948-b705-68c33fa7d227
Sandberg, Richard D.
41d03f60-5d12-4f2d-a40a-8ff89ef01cfa

Waschkowski, Fabian, Li, Haochen, Deshmukh, Abhishek, Grenga, Temistocle, Zhao, Yaomin, Pitsch, Heinz, Klewicki, Joseph and Sandberg, Richard D. (2024) Gradient information and regularisation for gene expression programming to develop data-driven physics closure models. Flow, Turbulence and Combustion. (doi:10.1007/s10494-024-00579-7).

Record type: Article

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 L2 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.

Text
s10494-024-00579-7 - Version of Record
Available under License Creative Commons Attribution.
Download (2MB)

More information

Accepted/In Press date: 8 August 2024
e-pub ahead of print date: 15 August 2024
Additional Information: Publisher Copyright: © The Author(s) 2024.
Keywords: Gene Expression Programming, Model complexity, Nonlinear optimization, Regularization

Identifiers

Local EPrints ID: 493756
URI: http://eprints.soton.ac.uk/id/eprint/493756
ISSN: 1386-6184
PURE UUID: 70717d3d-8e1f-42ba-8f24-94827066a87a
ORCID for Temistocle Grenga: ORCID iD orcid.org/0000-0002-9465-9505
ORCID for Richard D. Sandberg: ORCID iD orcid.org/0000-0001-5199-3944

Catalogue record

Date deposited: 12 Sep 2024 16:36
Last modified: 13 Sep 2024 02:08

Export record

Altmetrics

Contributors

Author: Fabian Waschkowski
Author: Haochen Li
Author: Abhishek Deshmukh
Author: Temistocle Grenga ORCID iD
Author: Yaomin Zhao
Author: Heinz Pitsch
Author: Joseph Klewicki
Author: Richard D. Sandberg ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×