Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “empirical machine learning”

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 325 records · Page 18

Nonequilibrium statistical mechanics and optimal prediction of partially-observed complex systems

Abstract Only a subset of degrees of freedom are typically accessible or measurable in real-world systems. As a consequence, the proper setting for empirical modeling is that of partially-observed systems. Notably, data-driven models consistently outperform physics-based models for systems with few observable degrees of freedom; e.g. hydrological systems. Here, we provide an operator-theoretic explanation for this empirical success. To predict a partially-observed system’s future behavior with physics-based models, the missing degrees of freedom must be explicitly accounted for using data assimilation and model parametrization. Data-driven models, in contrast, employ delay-coordinate embeddings and their evolution under the Koopman operator to implicitly model the effects of the missing degrees of freedom. We describe in detail the statistical physics of partial observations underlying data-driven models using novel maximum entropy and maximum caliber measures. The resulting nonequilibrium Wiener projections applied to the Mori–Zwanzig formalism reveal how data-driven models may converge to the true dynamics of the observable degrees of freedom. Additionally, this framework shows how data-driven models infer the effects of unobserved degrees of freedom implicitly, in much the same way that physics models infer the effects explicitly. This provides a unified implicit-explicit modeling framework for predicting partially-observed systems, with hybrid physics-informed machine learning methods combining both implicit and explicit aspects.

97 MATHEMATICS AND COMPUTING↗

Physics-Informed and Data-Driven Prediction of Residual Stress in Three-Dimensional Machining

Efficient and reliable prediction of machining-induced residual stress (RS) is a key requirement for truly integrated computational materials engineering (ICME). Currently available process modeling approaches, including empirical, analytical, and numerical methodologies lack predictive power and require substantial calibration and validation data. Moreover, most model-based approaches consider only two-dimensional (2D) (i.e., orthogonal), cutting processes. Meanwhile, industrial processes such as milling, turning, and drilling are inherently three-dimensional (3D). The present work attempts to bridge the gap between 2D and 3D through careful consideration of the process physics, including geometric, kinematic, and size-effect constraints to realize robust prediction of how RS develops in 3D machining. Using a novel in-situ experimental technique and digital image correlation (DIC) to determine equivalent Hertzian contact widths, contact pressures, and friction coefficients, the proposed methodology leverages a discretized conversion algorithm that includes multi-pass shakedown effects. This paper presents a semi-analytical model to predict machining-induced RS in 3D turning operations, which are used representatively for 3D processes more generally. Rather than follow a ‘brute force’ 3D FEM approach or conduct countless experiments to train a purely data-driven machine learning algorithm, the proposed approach builds on previous 2D modeling work. Through careful consideration of the process physics, including complex geometry/kinematic considerations of 3D turning, the authors demonstrated an experimentally calibrated approach, as well as validation based on published RS data. Model predictions and previously published measurement data of RS depth profiles for turning of Inconel 718 were compared for a range of process parameters. Correlation between the proposed 3D model and validation data was found to be within the margin of experimental error for most conditions. The proposed model appears to capture the overall behavior of 3D RS depth profiles with acceptable accuracy, particularly the key metrics of near-surface stress, peak stress magnitude and location, as well as overall stress profile depth. This report presents a physics-informed, data-driven approach for efficient calibration of a 2D model for machining-induced RS through DIC analysis of in-situ characterized subsurface displacement fields.

42 ENGINEERING↗

Microstructure modeling of nuclear structural materials: Recent progress and future directions

Modeling and simulation of microstructures are essential to understand the complex responses and behaviors of nuclear materials in extreme environments. The needs to assess the extended life operation as well as the growing interest in accelerating nuclear materials development and qualification have stimulated the use of high-fidelity multiscale models aided by empirical and ab initio data. This paper reviews the role of various models across different length and time scales in investigating irradiation effects on microstructure evolution and degradation, in particular the embrittlement caused by radiation induced or enhanced formation of nanoscale chemical heterogeneities. The strength and limitations of these models, including classical rate theories, cluster dynamics, phase-field methods, and atomistic models informed by ab initio energies, are discussed with seminal examples. Challenges regarding the lack of thermo-kinetic data and theoretical treatments considering chemical complexities and magnetic excitations, as well as the stabilizing effect by excess point defects in nuclear structural materials are presented, along with potential solutions based on ab initio informed surrogate energy models and statistical sampling by Monte Carlo simulations. Further, the review then highlights the opportunities to leverage the advantages of different methods by establishing hybrid models by shared variables or coupled codes and applications. Finally, the review concludes with forward-looking remarks on how the use of physics-based models can aid the improvement of machine-learning models of property degradation and vice versa.

36 MATERIALS SCIENCE↗

Smart Preprocessing & Robust Integration Emulator

To achieve the desired particle size of biomass feedstocks during preprocessing for trouble-free handling and conversion to produce biofuels and bioproducts, the raw materials must undergo a crucial milling process. The particle size of biomass plays a critical role in subsequent biofuel manufacturing, where a larger area-to-volume ratio facilitates efficient synthesis while balancing the impact of moisture on biomass storage. To optimize biofuel production efficiency and overcome these challenges, it is imperative to accurately predict the particle size distribution (PSD) of the biomass in the design of efficient preprocessing systems. The population balance model (PBM), upon empirical calibration and validation, can provide rapid prediction of post-milling PSD of granular biomass. However, PSD has limitations related to mass conservation and the absence of moisture considerations. To overcome these drawbacks, a deep learning model called the enhanced deep neural operator (DNO+) is implemented in the code. This model not only retains the capabilities of the PBM in handling complex mapping functions but also incorporates additional factors influencing the system. By considering various experimental conditions such as sieve size and moisture content, the trained DNO+ model can effectively predict the PSD after milling for any given feed PSD. To further reduce the reliance on experimental data, the PBM is integrated into the DNO+ model, resulting in a physics-informed DNO+ (PIDNO+). The PIDNO+ model addresses the non-conservation of quality exhibited by the PBM while inheriting the advantages of the DNO+ model in considering multiple influencing factors. Moreover, the PIDNO+ model significantly reduces the amount of data required for model training. Both deep learning models, i.e., DNO+ and PIDNO+, are excellent in predictive performance, offering swift and accurate machine learning-based predictions. The use of this code that contains these models will assist in guiding the proper milling equipment selection and operational conditions to achieve the desired biomass particle sizes, ensuring the efficiency of subsequent biofuel and bioproduct production processes.

Xia, Yidong [Idaho National Laboratory (INL), Idah↗

End-to-End Differentiable Modeling and Management of the Environment

Focal Area: (2) Data acquisition and assimilation enabled by machine learning, AI, and advanced methods including experimental/network design/optimization. We emphasize the importance of leveraging optimization techniques from AI/machine learning (ML) to solve challenging problems in Earth system modeling. Science Challenge: Automatic differentiation has had a transformative effect on ML by allowing the calculation of gradients of arbitrary functions in an incredibly large class of models. We can potentially realize similar improvements in parameter estimation and control for Earth system models (ESMs) by reimplementing them in computational frameworks from ML. Practitioners working with large (>10 7 parameters) models in ML and AI can obtain good predictive performance in a range of spatiotemporal tasks by making use of optimization via stochastic gradient descent and incorporating prior knowledge at multiple levels. We propose writing ESMs in open-source computational frameworks such as Torch, Tensorflow, and JAX to greatly expand the scope of environmental forecasting and management challenges, which can be addressed by leveraging automatic differentiation and gradient descent-like algorithms. We do not call for a wholesale replacement of physical models with data-driven surrogates, but rather advocate for interleaving physical and empirical equations in a manner that is most faithful to the extent of our scientific knowledge and observational data. Central to this topic is the merging of differentiable physical simulations with differentiable optimization layers, which are now both beginning to come to the forefront.

54 ENVIRONMENTAL SCIENCES↗

Testing convolutional neural network based deep learning systems: a statistical metamorphic approach

Machine learning technology spans many areas and today plays a significant role in addressing a wide range of problems in critical domains,i.e., healthcare, autonomous driving, finance, manufacturing, cybersecurity,etc. Metamorphic testing (MT) is considered a simple but very powerful approach in testing such computationally complex systems for which either an oracle is not available or is available but difficult to apply. Conventional metamorphic testing techniques have certain limitations in verifying deep learning-based models (i.e., convolutional neural networks (CNNs)) that have a stochastic nature (because of randomly initializing the network weights) in their training. In this article, we attempt to address this problem by using a statistical metamorphic testing (SMT) technique that does not require software testers to worry about fixing the random seeds (to get deterministic results) to verify the metamorphic relations (MRs). We propose seven MRs combined with different statistical methods to statistically verify whether the program under test adheres to the relation(s) specified in the MR(s). We further use mutation testing techniques to show the usefulness of the proposed approach in the healthcare space and test two CNN-based deep learning models (used for pneumonia detection among patients). The empirical results show that our proposed approach uncovers 85.71% of the implementation faults in the classifiers under test (CUT). Furthermore, we also propose an MRs minimization algorithm for the CUT, thus saving computational costs and organizational testing resources.

Computer Science↗

What regulates decomposition in agroecosystems? Insights from reading the tea leaves

Litter decomposition is a critical Earth process, recycling nutrients and setting a portion of plant tissue on a path toward soil organic matter. Despite this importance, we still lack a good understanding of local factors that regulate decomposition, especially in agroecosystems where management plays an outsized role. Using a narrow range of climate and soils, we buried 1,308 pre-manufactured “litter bags” of differing residue quality (i.e., green and rooibos tea leaves) in 109 plots across several management practices to (1) explore the local controls on decomposition in agroecosystems and (2) test the robustness of the Tea Bag Index (TBI). We found that management practices intended to increase soil ecosystem services, that is, soil health, altered the decomposition of both teas. For example, adding nitrogen fertilizer and implementing perennial cropping decreased the extent of green tea decomposition (carbon-to-nitrogen ratio, or C:N = 12.8). No-tillage increased, but perennial cropping decreased, the rate of rooibos tea decomposition (C:N = 50.1). Cropped prairie accelerated green tea decomposition and increased the extent of red tea decomposition. A random forest regression model showed that soil temperature was the strongest predictor of green tea decomposition, but a soil health score also played a significant role in predicting the mass remaining. Soil texture and nutrient availability best predicted rooibos tea decomposition. Finer textured soils seemed to decelerate rooibos decomposition but increased the extent of decomposition. Furthermore, we demonstrated that the TBI metrics correlated somewhat well with empirically derived decomposition constants and were similarly sensitive to the effects of management. Still, the green tea stabilization factor had a substantial prediction bias. Our study increased our basic understanding of what regulates decomposition in agroecosystems. It also showed that the TBI can be a scientifically rigorous citizen science approach to monitoring changes in soil health.

60 APPLIED LIFE SCIENCES↗

Prediction of High-Latitude Ionospheric Electrodynamics Using the Machine Learning Based Auroral Ionospheric Electrodynamics Model

We introduce a new framework for Machine-Learning (ML) based Auroral Ionosphere Model (ML-AIM). ML-AIM solves a current continuity equation by utilizing the ML model of Field Aligned Currents (FACs) of Kunduri et al., 2020 (https://doi.org/10.1029/2020JA027908), the FAC-derived aurora conductance model of Robinson et al., 2020 (https://doi.org/10.1029/2020JA028008), and the solar irradiance conductance model of Moen & Brekke (1993). The ML-AIM inputs are 60min time histories of solar wind plasma, interplanetary magnetic fields (IMF), and geomagnetic indices, and its outputs are ionospheric electric potential, electric fields, Pederson/Hall currents, and Joule Heating. We conduct two ML-AIM simulations for a weak geomagnetic activity on 14 May 2013 and a geomagnetic storm on 7-8 September 2017. ML-AIM produces reasonable ionospheric potential patterns such as two cell convection patterns and the enhancement of electric potentials during active times. The cross polar cap potential drop from ML-AIM is also comparable to the ones from the Weimer 2005 model, Super Dual Auroral Radar Network (SuperDARN), and Defense Meteorological Satellite Program (DMSP) F17 observations. ML-AIM is unique in a sense that it predicts ionospheric responses to the time-varying solar wind and geomagnetic conditions, while other traditional empirical model like Weimer 2005 is designed to provide static ionospheric conditions under steady solar wind/IMF conditions. In future, ML-AIM will include ML-based models of aurora precipitation and ionospheric conductance, improving its performance during active times.

H. K. Connor↗

Navigating the Noise: Bringing Clarity to ML Parameterization Design With O $\boldsymbol{\mathcal{O}}$(100) Ensembles

Abstract Machine‐learning (ML) parameterizations of subgrid processes (here of turbulence, convection, and radiation) may one day replace conventional parameterizations by emulating high‐resolution physics without the cost of explicit simulation. However, uncertainty about the relationship between offline and online performance (i.e., when integrated with a large‐scale general circulation model) hinders their development. Much of this uncertainty stems from limited sampling of the noisy, emergent effects of upstream ML design decisions on downstream online hybrid simulation. Our work rectifies the sampling issue via the construction of a semi‐automated, end‐to‐end pipeline for size ensembles of hybrid simulations, revealing important nuances in how systematic reductions in offline error manifest in changes to online error and online stability. For example, removing dropout and switching from a Mean Squared Error to a Mean Absolute Error loss both reduce offline error, but they have opposite effects on online error and online stability. Other design decisions, like incorporating memory, converting moisture input from specific humidity to relative humidity, using batch normalization, and training on multiple climates do not come with any such compromises. Finally, we show that ensemble sizes of may be necessary to reliably detect causally relevant differences online. By enabling rapid online experimentation at scale, we can empirically settle debates regarding subgrid ML parameterization design that would have otherwise remained unresolved in the noise.

Lin, Jerry [Department of Earth System Sciences Un↗

Open-source Numerical Modeling of Solidification Cracking Susceptibility: Application to Refractory Alloy Systems

Introduction. Alloys such as aluminum, nickel-base, and austenitic stainless steels are susceptible to solidification cracking during welding and 3D printing. Compositional optimization is one method used to effectively mitigate solidification cracking of those alloy systems. With the surge in hypersonic and in-space propulsion activities, refractory metals (Nb, Mo, Ta, W, and Re) and their alloy derivatives are increasing in importance due to their extreme high melting point and retention of high-temperature strength; however, their chemistry was most typically optimized to promote ductility during mechanical operations such as drawing and forming. Welding of such alloys has been a challenge due to a number of issues including solidification cracking, atmospheric contamination (O, C, and N), as well as a shift in ductile-to-brittle transition to higher temperature following grain growth induced by welding. Compositional optimization of refractory alloys for solidification cracking resistance in particular is desirable as their usage increases with the advent of advanced manufacturing methods such as 3D printing. This work evaluates the effect of compositional variation in refractory metal systems on the solidification cracking susceptibility with the goals of optimizing existing alloys and joining process techniques, and formulating new alloys with increased solidification cracking resistance. Experimental Procedures. A python code was developed in a Jupyter notebook environment (Michael and Sowards, 2023) to facilitate the calculation of crack susceptibility index proposed by Kou (2015). Composition is entered as a single point, or as a 1-D or 2-D array. The notebook calls pycalphad (Otis and Liu, 2017 and Bocklund et al, 2020) to calculate the evolution of fraction solid as a function of temperature (under either Scheil or equilibrium assumptions) and then evaluates steepness of the fraction solid curve near the terminal stage of solidification to predict solidification cracking resistance. Open source thermodynamic databases available at online repositories are used (van de Walle). The process is setup in an automated fashion to generate plots that show variation in solidification cracking susceptibility according to composition on 1-D line plots or 2-D contour plots. The Jupyter notebook and crack susceptibility algorithm was also integrated with a widely used commercial CALPHAD code for validation and alloy exploration. Results and Discussion. The crack susceptibility model was first validated against a series of refractory alloy compositions evaluated in past work which utilized a specialized Varestraint test built inside a vacuum chamber environment (Lessman and Gold, 1971). The alloys tested in the Varestraint apparatus included T-111 (Ta-8W-2Hf), ASTAR-811C (Ta-8W-1Re-0.7Hf-0.025C), FS-85 (Nb-27Ta-10W-1Zr), T-222 (Ta-9.6W-2.4Hf-0.01C), Ta-10W, B-66 (Nb-5Mo-5V-1Zr), and SCb-291 (Nb-10W-10Ta). The initial test of the model showed a strong correlation with empirical Varestraint data, i.e., a Spearman rank correlation between model predictions and hot cracking measurements was observed to be greater than 0.8. Following the validation, a set of refractory metal binary mixtures was investigated to evaluate sensitivity of Nb, Mo, W, and Ta to C, N, and O content. A series of plots were produced that suggest ppmw ranges of C, N, and O where solidification cracking increases significantly and reaches a maximum. Also comparative ranking of each primary refractory metal to each interstitial was produced. For example C produces greater cracking response in Mo whereas O produces greater cracking response in Ta and Nb. Such compositional values have utility in setting limits on pickup of these interstitial elements during welding and printing rather than using a one-size-fits-all approach. Furthermore, the results have use in determining additive powder recycling requirements, which is especially pertinent for refractory metal powders due to their high cost compared to conventional alloys. Another application created thousands of hypothetical alloys within the nominal specified composition range of two widely used refractory alloys C103 (Nb-10Hf-1Ti) and TZM (Mo-0.5Ti-0.1Zr). The cracking index was calculated for the alloys and results were fed into machine learning regression techniques including Multiple Linear Regression, Ridge Regression, and Lasso Regression to determine relative potency each alloying element had on computed solidification cracking index. A series of linear equations were produced that relate composition of C103 and TZM to solidification cracking index. The crack susceptibility of C103 for example is described by an equation of the form: cracking index ~ O + 0.667*C + 0.635*N + 0.00037*Ta – 0.0008*Hf (in wt.%) From that equation, it is clear that O has strong propensity to induce solidification cracking. Interestingly, Hf is shown to reduce calculated cracking response. Finally, realizing the potential of this method to discover new refractory alloy formulations across the period table that have low solidification cracking sensitivity, the code was applied to new untested alloy systems including W-Zr-C, W-Ta-C, and others. Conclusions. In summary, an open source numerical method has been developed using Python code to calculate Kou’s crack susceptibility index. The method was applied to refractory metals which are inherently difficult to study from a weldability testing standpoint since inert shielding gas is not sufficient and welding is typically done in vacuum, especially in light of findings presented here where oxygen has profound influence on solidification cracking. This work revealed the effect of compositional variations on a series of refractory metals and showed the framework defined here will be useful in 1) the development of new alloys that have improved weldability and 3D printability, 2) placing compositional limits on existing alloys, and 3) ensuring adequate controls of manufacturing processes such as 3D printing where powder reuse is critical. Keywords. pycalphad; Python; refractory metals; solidification cracking. References. B. Bocklund et. al. (2020) http://doi.org/10.5281/zenodo.3630657. S. Kou. (2015) https://doi.org/10.1016/j.actamat.2015.01.034. G.G. Lessmann and R.E. Gold. Welding Journal, issue 1, pp. 1-s – 8-s (1971). F.N. Michael and J.W. Sowards. NASA/TM-20230002218 (2023). R. Otis and Z.-K. Liu. (2017) http://doi.org/10.5334/jors.140. A. Van de Wallle et. al. (2018) https://doi.org/10.1016/j.calphad.2018.04.003.

pycalphad↗

Modeling Combustion Reaction ODEs with Neural Networks

The chemistry of combustion reactions is complex as it involves many species and reactions. In practice, such a system is often modeled computationally using an empirically derived chemical mechanism. Given the large range of reaction rates, the system is then time evolved using a stiff ODE solver. However, even when reduced chemical mechanisms are employed, the system can become computationally expensive for two-dimensional or three-dimensional systems. Such systems can also face problems with instability. As such, it is desirable to find a cheaper, stable alternative to solving the reaction system. Neural networks offer the potential to learn these reaction ODEs and time evolve a combustion reaction in a more cost-efficient manner than stiff ODE solvers. In this study, a variety of neural networks are trained on zero-dimensional Cantera simulations of methane combustion with varying initial conditions. Several predictive approaches as well as several neural network architectures (artificial neural network with dropout, ResNet, and Neural ODE) are compared in their ability to predict combustion trajectories. Promising models are then identified.

combustion kinetics↗

Organic Photovoltaic Efficiency Predictor: Data-Driven Models for Non-Fullerene Acceptor Organic Solar Cells

In the design of organic solar cells, there has been a need for materials with high power conversion efficiencies. Scharber’s model is commonly used to predict efficiency; however, it exhibits poor performance with new non-fullerene acceptor (NFA) devices, since it was designed for fullerene-based devices. In this work, an empirical model is proposed that can be a more accurate alternative for NFA organic solar cells. Additionally, many screening studies use computationally expensive methods. A model based on using semiempirical simplified time-dependent density functional theory (sTD-DFT) as an alternative method can accelerate the calculations and yield a similar accuracy. The models presented in this paper, termed organic photovoltaic efficiency predictor (OPEP) models, have shown significantly lower errors than previous models, with OPEP/B3LYP yielding errors of 1.53% and OPEP/sTD- DFT of 1.55%. As a result, the proposed computational models can be used for the fast and accurate screening of new high-efficiency NFAs/donor pairs.

14 SOLAR ENERGY↗

A Field Guide to Corralling the Chaos: A Conceptual Framework for Using Models to Guide Opportunistic Field Studies of Natural Disturbances

Watersheds regulate biogeochemical processes and provide ecosystem services to human societies, but disturbances can fundamentally alter these processes across space and time. Determining when and where to sample to capture disturbance impacts in watersheds remains a central challenge. Manipulation studies and long-term monitoring are often constrained by scope, and opportunistic studies often lack pre-disturbance data needed to statistically determine disturbance impacts. We identify a persistent knowledge gap: the absence of a clear, transferable framework to guide opportunistic disturbance research where pre-disturbance data collection is not a feasible option. To address this gap, we present a conceptual framework that intentionally integrates modeling and empirical observation in an iterative, stepwise model–experiment workflow. We demonstrate its application through two contrasting case studies: wildfire impacts on headwater streams using a pre-disturbance preparedness approach, and saltwater flooding impacts on coastal forests using an ‘ex-post-facto’ approach. From these applications, we assess strengths, limitations, and the critical role of team science for transferability across disturbance types and study designs. Broadly, this framework offers a scalable path towards more rigorous, timely, and actionable disturbance science that can inform watershed management, hazard risk reduction, and ecosystem resilience.

Coastal Biogeochemistry↗

Streaming Matching and Edge Cover in Practice

Graph algorithms with polynomial space and time requirements often become infeasible for massive graphs with billions of edges or more. State-of-the-art approaches therefore employ approximate serial, parallel, and distributed algorithms to tackle these challenges. However, such approaches require storing the entire graph in memory and thus need access to costly computing resources such as clusters and supercomputers. In this paper, we present practical streaming approaches for solving massive graph problems using limited memory for two prototypical graph problems: maximum weighted matching and minimum weighted edge cover. For matching, we conduct a thorough computational study on two of the semi-streaming algorithms including a recent breakthrough result that achieves a $1/(2+\varepsilon)$-approximation of the weight while using $O( n \log W /\epsilon)$ memory (here $n$ is the number of vertices and $W$ is the maximum edge weight), designed by Paz and Schwartzman [SODA, 2017]. Empirically, we show that the semi-streaming algorithms produce matchings whose weight is close to the best $1/2$-approximate offline algorithm while requiring less time and an order-of-magnitude less memory. For minimum weighted edge cover, we develop three novel semi-streaming algorithms. Two of these algorithms require a single pass through the input graph, require $O(n \log n)$ memory, and provide a 2-approximation guarantee on the objective. We also leverage a relationship between approximate maximum weighted matching and approximate minimum weighted edge cover to develop a two-pass $3/2+\epsilon$-approximate algorithm with the memory requirement of Paz and Schwartzman's semi-streaming matching algorithm. These streaming approaches are compared against the state-of-the-art 3/2-approximate offline algorithm. The semi-streaming matching and the novel edge cover algorithms proposed in this paper can process graphs with several billions of edges in under 30 minutes using 6 GB of memory, which is at least an order of magnitude improvement from the offline (non-streaming) algorithms. For the largest graph, the best alternative offline parallel approximation algorithm (GPA+ROMA) could not finish in three hours even while employing hundreds of processors and 1 TB of memory. We also demonstrate an application of the semi-streaming algorithm by computing a matching using linearly bounded memory on item intersection graphs derived from three machine learning datasets, whereas the existing offline algorithms could not complete on one of these datasets since their memory requirements exceeded 1TB.

Ferdous, S M.↗

Statistical Learning for Nonlinear Model Reduction from Local Simulations of Stochastic and Particle- and Agent-Based Systems

Stochastic physical systems across the sciences that have very high-dimensional state spaces, with a large number of fast degrees of freedom that force direct simulators to proceed by integration steps that are orders of magnitude smaller than events of interests (e.g., particle collisions). Examples range from molecular motion to dynamics of large populations of cells. A grand challenge in the simulation and understanding of such systems is the systematic construction of accurate, interpretable, reduced models, enabling faster simulations, revealing fundamental properties of the dynamics, and predicting phenomena of interest that the original simulator could not reached with sufficient accuracy or within a given computational budget. In this projected we developed novel statistical estimation/machine learning techniques for analyzing and building empirical reduced models for important families of high-dimensional stochastic systems, in particular: - we developed techniques for estimating interaction kernels in interacting particle- and agent-based systems, which are ubiquitous in Physics, Biology and many other sciences, given observed trajectories of the system; - we developed techniques for nonlinear model reduction for high-dimensional stochastic systems that have a small number of unknown, nonlinear slow variables, and a large number of fast modes, that are possibly of large magnitude, given observed short trajectories of the system in the form of bursts of trajectories from different initial conditions; - we developed novel techniques for estimating linear dynamical systems on graphs when both the dynamics and the underlying graph are unknown, and we have a sparse set of space-time observations; - we considered the problem of estimating an unknown nonlinear observation function of a standard process (e.g. Brownian motion), so that we can recognized if an observed dynamics is "just" a nonlinear version of a known dynamics; we also developed benchmarks for learning algorithms aimed at learning and classifying diffusion processes.

97 MATHEMATICS AND COMPUTING↗

Towards a more general understanding of the algorithmic utility of recurrent connections

Lateral and recurrent connections are ubiquitous in biological neural circuits. Yet while the strong computational abilities of feedforward networks have been extensively studied, our understanding of the role and advantages of recurrent computations that might explain their prevalence remains an important open challenge. Foundational studies by Minsky and Roelfsema argued that computations that require propagation of global information for local computation to take place would particularly benefit from the sequential, parallel nature of processing in recurrent networks. Such “tag propagation” algorithms perform repeated, local propagation of information and were originally introduced in the context of detecting connectedness, a task that is challenging for feedforward networks. Here, we advance the understanding of the utility of lateral and recurrent computation by first performing a large-scale empirical study of neural architectures for the computation of connectedness to explore feedforward solutions more fully and establish robustly the importance of recurrent architectures. In addition, we highlight a tradeoff between computation time and performance and construct hybrid feedforward/recurrent models that perform well even in the presence of varying computational time limitations. We then generalize tag propagation architectures to propagating multiple interacting tags and demonstrate that these are efficient computational substrates for more general computations of connectedness by introducing and solving an abstracted biologically inspired decision-making task. Our work thus clarifies and expands the set of computational tasks that can be solved efficiently by recurrent computation, yielding hypotheses for structure in population activity that may be present in such tasks.

59 BASIC BIOLOGICAL SCIENCES↗

Uncertainty Quantification for Multiphase Computational Fluid Dynamics Closure Relations with a Physics-Informed Bayesian Approach

Multiphase Computational Fluid Dynamics (MCFD) based on the two-fluid model is considered a promising tool to model complex two-phase flow systems. MCFD simulation can predict local flow features without resolving interfacial information. As a result, the MCFD solver relies on closure relations to describe the interaction between the two phases. Those empirical or semi-mechanistic closure relations constitute a major source of uncertainty for MCFD predictions. In this paper, we leverage a physics-informed uncertainty quantification (UQ) approach to inversely quantify the closure relations’ model form uncertainty in a physically consistent manner. This proposed approach considers the model form uncertainty terms as stochastic fields that are additive to the closure relation outputs. Combining dimensionality reduction and Gaussian processes, the posterior distribution of the stochastic fields can be effectively quantified within the Bayesian framework with the support of experimental measurements. As this UQ approach is fully integrated into the MCFD solving process, the physical constraints of the system can be naturally preserved in the UQ results. Here, in a case study of adiabatic bubbly flow, we demonstrate that this UQ approach can quantify the model form uncertainty of the MCFD interfacial force closure relations, thus effectively improving the simulation results with relatively sparse data support.

42 ENGINEERING↗

Correlation of the L-mode density limit with edge collisionality

The "density limit'' is one of the fundamental bounds on tokamak operating space, and is commonly estimated via the empirical Greenwald scaling. This limit has garnered renewed interest in recent years as it has become clear that ITER and many tokamak pilot plant concepts must operate near or above the widely-used Greenwald limit to achieve their objectives. Evidence has also grown that the Greenwald scaling - in its remarkable simplicity - may not capture the full complexity of the disruptive density limit. In this study, we assemble a multi-machine database to quantify the effectiveness of the Greenwald limit as a predictor of the L-mode density limit and identify alternative stability metrics. We find that a two-parameter dimensionless boundary in the plasma edge, $\nu_{*\rm, edge}^{\rm limit} = 3.0 \beta_{T,{\rm edge}}^{-0.4}$, achieves significantly higher accuracy (true negative rate of 97.7\% at a true positive rate of 95\%) than the Greenwald limit (true negative rate 86.1\% at a true positive rate of 95\%) across a multi-machine dataset including metal- and carbon-wall tokamaks (AUG, C-Mod, DIII-D, and TCV). The collisionality boundary presented here can be applied for density limit avoidance in current devices and in ITER, where it can be measured and responded to in real time.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗