Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “symbolic”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 181 records · Page 10

Complementing a continuum thermodynamic approach to constitutive modeling with symbolic regression

Here, an interpretable machine learning method, physics-informed genetic programming-based symbolic regression (P-GPSR), is integrated into a continuum thermodynamic approach to developing constitutive models. The proposed strategy for combining a thermodynamic analysis with P-GPSR is demonstrated by generating a yield function for an idealized material with voids, i.e., the Gurson yield function. First, a thermodynamic-based analysis is used to derive model requirements that are exploited in a custom P-GPSR implementation as fitness criteria or are strongly enforced in the solution. The P-GPSR implementation improved accuracy, generalizability, and training time compared to the same GPSR code without physics-informed fitness criteria. The yield function generated through the P-GPSR framework is in the form of a composite function that describes a class of materials and is characteristically more interpretable than GPSR-derived equations. The physical significance of the input functions learned by P-GPSR within the composite function is acquired from the thermodynamic analysis. Fundamental explanations of why the implemented P-GPSR capabilities improve results over a conventional GPSR algorithm are provided.

42 ENGINEERING↗

Symbolic regression development of empirical equations for diffusion in Lennard-Jones fluids

Symbolic regression (SR) with a multi-gene genetic program has been used to elucidate new empirical equations describing diffusion in Lennard-Jones (LJ) fluids. Some examples include equations to predict self-diffusion in pure LJ fluids and equations describing the finite-size correction for self-diffusion in binary LJ fluids. The performance of the SR-obtained equations was compared to that of both the existing empirical equations in the literature and to the results from artificial neural net (ANN) models recently reported. It is found that the SR equations have improved predictive performance in comparison to the existing empirical equations, even though employing a smaller number of adjustable parameters, but show an overall reduced performance in comparison to more extensive ANNs.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

AutoTG: Reinforcement Learning-Based Symbolic Optimization for AI-Assisted Power Converter Design

Power converters are pervasive in modern electronic component design. They can be found in all electronic devices from household appliances and cellphone chargers to vehicles. Currently, designing new circuit topologies is hard because it requires human expertise based on experience and is difficult to automate. However, artificial-intelligence-assisted design can significantly facilitate the development of new power converters and/or improve the final result. Intelligently designed highly efficient power converters can have a significant effect on many important attributes, such as power efficiency, layout size, cost, heat dissemination, energy requirements, etc. We propose Autonomous Topology Generator (AutoTG), a reinforcement-learning-based framework that generates power converter topology candidates based on user specifications, optimized for user preferences. By modeling power converter design as a symbolic optimization problem, we sequentially sample components in an autoregressive manner until new topologies are formed, providing both the topology specification and the sizing (magnitude of each component parameter) of the proposed power converter. Here, we provide an empirical evaluation and show that AutoTG is able to generate varied high-efficiency topologies within component restrictions based on user input and show that previously unknown topologies can be found for further evaluation.

(AI)-based design↗

Learning Symbolic Expressions: Mixed-Integer Formulations, Cuts, and Heuristics

Here, in this paper, we consider the problem of learning a regression function without assuming its functional form. This problem is referred to as symbolic regression. An expression tree is typically used to represent a solution function, which is determined by assigning operators and operands to the nodes. Cozad and Sahinidis propose a nonconvex mixed-integer nonlinear program (MINLP), in which binary variables are used to assign operators and nonlinear expressions are used to propagate data values through nonlinear operators, such as square, square root, and exponential. We extend this formulation by adding new cuts that improve the solution of this challenging MINLP. We also propose a heuristic that iteratively builds an expression tree by solving a restricted MINLP. We perform computational experiments and compare our approach with a mixed-integer program–based method and a neural network–based method from the literature.

97 MATHEMATICS AND COMPUTING↗

SDA: a symbolic differential algebra package in C++

Truncated Power Series Algebra (TPSA), or Differential Algebra (DA), is a well-established tool in accelerator physics, commonly used for generating high-order maps of dynamic systems, as well as in symplectic tracking, normal form analysis, verified integration, optimization, and fast multipole methods. This package is the first to perform symbolic DA computations, enabling traceability of initial condition contributions and runtime reduction for repeated DA calculations, potentially expanding DA’s applications.

97 MATHEMATICS AND COMPUTING↗

Bayesian Model Selection for Reducing Bloat and Overfitting in Genetic Programming for Symbolic Regression

When performing symbolic regression using genetic programming, overfitting and bloat can negatively impact generalizability and interpretability of the resulting equations as well as increase computation times. A Bayesian fitness metric is introduced and its impact on bloat and overfitting during population evolution is studied and compared to common alternatives in the literature. The proposed approach was found to be more robust to noise and data sparsity in numerical experiments, guiding evolution to a level of complexity appropriate to the dataset. Further evolution of the population resulted not in overfitting or bloat, but rather in slight simplifications in model form. The ability to identify an equation of complexity appropriate to the scale of noise in the training data was also demonstrated. In general, the Bayesian model selection algorithm was shown to be an effective means of regularization which resulted in less bloat and overfitting when any amount of noise was present in the training data.

Uncertainty quantification↗

Refining T c Prediction in Hydrides via Symbolic‐Regression‐Enhanced Electron‐Localization‐Function‐Based Descriptors

Hydrogen‐based materials are able to possess extremely high superconducting critical temperatures, T c s , due to hydrogen's low atomic mass and strong electron–phonon interaction. Recently, a descriptor based on the Electron Localization Function (ELF) has enabled the rapid estimation of the T c of hydrogen‐containing compounds from electronic networking properties, but its applicability has been limited by the small size and homogeneity of the training dataset used. Herein, the model is re‐examined, compiling a publicly available combined dataset of 244 binary and ternary hydride superconductors. The analysis shows that though ELF‐based networking remains a valuable descriptor, its predictive power declines with increasing compositional complexity. However, by introducing the molecularity index, defined as the highest value of the ELF at which two hydrogen atoms connect, and applying symbolic regression, the accuracy of the predictions can be substantially enhanced. These results establish a more robust framework for assessing superconductivity in hydride materials, facilitating accelerated screening of novel candidates through integration with crystal structure prediction methods or high‐throughput searches.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Symbol alphabets from plabic graphs III: n = 9

Symbol alphabets of n-particle amplitudes in N = 4 super-Yang-Mills theory are known to contain certain cluster variables of G(4, n) as well as certain algebraic functions of cluster variables. In this paper we solve the C Z = 0 matrix equations associated to several cells of the totally non-negative Grassmannian, combining methods of arXiv:2012.15812 for rational letters and arXiv:2007.00646 for algebraic letters. We identify sets of parameterizations of the top cell of G + (5, 9) for which the solutions produce all of (and only) the cluster variable letters of the 2-loop nine-particle NMHV amplitude, and identify plabic graphs from which all of its algebraic letters originate.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stress intensity factor models using mechanics-guided decomposition and symbolic regression

The finite element method can be used to compute accurate stress intensity factors (SIFs) for cracks with complex geometries and boundary conditions. In contrast, handbook solutions act as surrogate SIF models that provide significantly faster evaluation times. However, the development of conventional surrogate SIF models relies on manual development based on low-order parameterizations. This limits surrogate model accuracy and generalizability. Here, in this paper, we develop a framework for the automated development of mechanics-guided handbook SIF solutions by using interpretable machine learning via genetic programming for symbolic regression (GPSR). Formalizing the mechanics-based approach of Raju and Newman, SIF training data is decomposed into multiple subsets. This decomposition enables parallel GPSR model development of subfunctions, each of which accounts for specific geometrical corrections with respect to a known analytical model. Using this mechanics-based approach with GPSR allows for equations to be learned with improved accuracy and reduced complexity relative to the Raju Newman equations while maintaining the inherent interpretability of mathematical expressions. In this paper, we present equations that match the complexity of the Raju Newman equations while having reduced error, as well as equations with similar errors and reduced complexity.

42 ENGINEERING↗

Simple descriptor derived from symbolic regression accelerating the discovery of new perovskite catalysts

Symbolic regression (SR) is an approach of interpretable machine learning for building mathematical formulas that best fit certain datasets. In this work, SR is used to guide the design of new oxide perovskite catalysts with improved oxygen evolution reaction (OER) activities. A simple descriptor, μ/t, where μ and t are the octahedral and tolerance factors, respectively, is identified, which accelerates the discovery of a series of new oxide perovskite catalysts with improved OER activity. We successfully synthesise five new oxide perovskites and characterise their OER activities. Remarkably, four of them, Cs 0.4 La 0.6 Mn 0.25 Co 0.75 O 3 , Cs 0.3 La 0.7 NiO 3 , SrNi 0.75 Co 0.25 O 3 , and Sr 0.25 Ba 0.75 NiO 3 , are among the oxide perovskite catalysts with the highest intrinsic activities. Our results demonstrate the potential of SR for accelerating the data-driven design and discovery of new materials with improved properties.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

SYMBA: symbolic computation of squared amplitudes in high energy physics with machine learning

The cross section is one of the most important physical quantities in high-energy physics and the most time consuming to compute. While machine learning has proven to be highly successful in numerical calculations in high-energy physics, analytical calculations using machine learning are still in their infancy. In this work, we use a sequence-to-sequence model, specifically, a transformer, to compute a key element of the cross section calculation, namely, the squared amplitude of an interaction. We show that a transformer model is able to predict correctly 97.6% and 99% of squared amplitudes of quantum chromodynamics and quantum electrodynamics processes, respectively, at a speed that is up to orders of magnitude faster than current symbolic computation frameworks. We discuss the performance of the current model, its limitations and possible future directions for this work.

97 MATHEMATICS AND COMPUTING↗

Machine learning of Kondo physics using variational autoencoders and symbolic regression

In this work, we employ variational autoencoders to extract physical insight from a dataset of one-particle Anderson impurity model spectral functions. Autoencoders are trained to find a low-dimensional, latent space representation that faithfully characterizes each element of the training set, as measured by a reconstruction error. Variational autoencoders, a probabilistic generalization of standard autoencoders, further condition the learned latent space to promote highly interpretable features. In our study, we find that the learned latent variables strongly correlate with well known, but nontrivial, parameters that characterize emergent behaviors in the Anderson impurity model. In particular, one latent variable correlates with particle-hole asymmetry, while another is in near one-to-one correspondence with the Kondo temperature, a dynamically generated low-energy scale in the impurity model. Using symbolic regression, we model this variable as a function of the known bare physical input parameters and "rediscover" the nonperturbative formula for the Kondo temperature. The machine learning pipeline we develop suggests a general purpose approach, which opens opportunities to discover new domain knowledge in other physical systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Symbolic pregression: Discovering physical laws from distorted video

In this work, we present a method for unsupervised learning of equations of motion for objects in raw and optionally distorted unlabeled synthetic video (or, more generally, for discovering and modeling predictable features in time-series data). We first train an autoencoder that maps each video frame into a low-dimensional latent space where the laws of motion are as simple as possible, by minimizing a combination of nonlinearity, acceleration, and prediction error. Differential equations describing the motion are then discovered using Pareto-optimal symbolic regression. We find that our pre-regression (“pregression”) step is able to rediscover Cartesian coordinates of unlabeled moving objects even when the video is distorted by a generalized lens. Using intuition from multidimensional knot theory, we find that the pregression step is facilitated by first adding extra latent space dimensions to avoid topological problems during training and then removing these extra dimensions via principal component analysis. An inertial frame is autodiscovered by minimizing the combined equation complexity for multiple experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stellarator Design Exploration Using Symbolic-Regression Neutronics Surrogates

Systems codes require fast, simplified models to rapidly evaluate fusion power plant concepts, but neutronics analyses are often a computational bottleneck. Here, to address this, surrogate models for key neutronics responses have been developed using 3-D neutronics-ready models built with the open-source code ParaStell from a database of stellarator equilibria. Neutronics responses such as tritium breeding ratio (TBR), nuclear heating, and neutron-induced radiation damage displacements per atom (dpa) were simulated using OpenMC. Through sensitivity analysis and symbolic regression (SR), simple power-law formulas were derived connecting these neutronics responses to global stellarator parameters, including fusion power, plasma surface area, and plasma elongation. Validation shows these formulas can predict the simulation results with low error, enabling quick and accurate assessment of neutronics requirements in stellarator design exploration activities with systems codes.

Modeling↗