Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “physical 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 847 records · Page 47
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

De Novo Design of High‐Affinity Miniprotein Binders Targeting Francisella Tularensis Virulence Factor

Abstract Francisella tularensis poses considerable public health risk due to its high infectivity and potential for bioterrorism. Francisella‐like lipoprotein (Flpp3), a key virulence factor unique to Francisella, plays critical roles in infection and immune evasion, making it a promising target for therapeutic development. However, the lack of well‐defined binding pockets and structural information on native interactions has hindered structure‐guided ligand discovery against Flpp3. Here, we used a combination of physics‐based and deep‐learning methods to design high‐affinity miniprotein binders targeting two distinct sites on Flpp3. We identified four binders for site I with binding affinities ranging between 24–110 nM. For the second site, an initial binder showed a dissociation constant ( K D ) of 81 nM, and subsequent site saturation mutagenesis yielded variants with sub‐nanomolar affinities. Circular dichroism confirmed the topology of designed miniproteins. The X‐ray crystal structure of Flpp3 in complex with a site I binder is nearly identical to the design model (Cα root‐mean‐square deviation (RMSD): 0.9 Å). These designed miniproteins provide research tools to explore the roles of Flpp3 in tularemia and should enable the development of new therapeutic candidates.

Gokce‐Alpkilic, Gizem [Molecular Engineering and S↗
DOE OSTI2023

Internal calibration of transient kinetic data via machine learning

The temporal analysis of products (TAP) reactor provides a vast amount of transient kinetic information that may be used to describe a variety of chemical features including residence time distributions, kinetic coefficients, number of active sites, reaction mechanism, etc. However, as with any measurement device, the TAP reactor signal is convoluted with noise and drift is common. In order to reduce the uncertainty of the kinetic measurement and any derived parameters or mechanisms, proper preprocessing must be performed prior to any advanced type of analysis. This preprocessing includes baseline correction, i.e., a shift in the voltage response, and calibration, i.e., a scaling of the flux response based on prior experiments. The traditional methodology of preprocessing requires significant user discretion and reliance on separate calibration experiments that may drift over time. Herein we use machine learning techniques combined with physical constraints to understand the noise and drift that is being generated within and between experiments for enhancement of the chemical kinetic signal. As such, the proposed methodology demonstrates clear benefits over the traditional preprocessing approach by eliminating the need for separate calibration experiments or heuristic input from the user.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Respecting causality for training physics-informed neural networks

While the popularity of physics-informed neural networks (PINNs) is steadily rising, to this date PINNs have not been successful in simulating dynamical systems whose solution exhibits multi-scale, chaotic or turbulent behavior. In this work we attribute this shortcoming to the inability of existing PINNs formulations to respect the spatio-temporal causal structure that is inherent to the evolution of physical systems. We argue that this is a fundamental limitation and a key source of error that can ultimately steer PINN models to converge towards erroneous solutions. We address this pathology by proposing a simple re-formulation of PINNs loss functions that can explicitly account for physical causality during model training. We demonstrate that this simple modification alone is enough to introduce significant accuracy improvements, as well as a practical quantitative mechanism for assessing the convergence of a PINNs model. Here we provide state-of-the-art numerical results across a series of benchmarks for which existing PINNs formulations fail, including the chaotic Lorenz system, the Kuramoto–Sivashinsky equation in the chaotic regime, and the Navier–Stokes equations. To the best of our knowledge, this is the first time that PINNs have been successful in simulating such systems, introducing new opportunities for their applicability to problems of industrial complexity.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Accelerating Hamiltonian Monte Carlo for Bayesian inference in neural networks and neural operators

Hamiltonian Monte Carlo (HMC) is a powerful and accurate method to sample from the posterior distribution in Bayesian inference. However, HMC techniques are computationally demanding for Bayesian neural networks due to the high dimensionality of the network’s parameter space and the non-convexity of their posterior distributions. Therefore, various approximation techniques, such as variational inference (VI) or stochastic gradient MCMC, are often employed to infer the posterior distribution of the network parameters. Such approximations introduce inaccuracies in the inferred distributions, resulting in unreliable uncertainty estimates. In this work, we propose a hybrid approach that combines inexpensive VI and accurate HMC methods to efficiently and accurately quantify uncertainties in neural networks and neural operators. The proposed approach leverages an initial VI training on the full network. We examine the influence of individual parameters on the prediction uncertainty, which shows that a large proportion of the parameters do not contribute substantially to uncertainty in the network predictions. This information is then used to significantly reduce the dimension of the parameter space, and HMC is performed only for the subset of network parameters that strongly influence prediction uncertainties. This yields a framework for accelerating the full batch HMC for posterior inference in neural networks. We demonstrate the efficiency and accuracy of the proposed framework on deep neural networks and operator networks, showing that inference can be performed for large networks with tens to hundreds of thousands of parameters. Finally, we show that this method can effectively learn surrogates for complex physical systems by modeling the operator that maps from upstream conditions to wall-pressure data on a cone in hypersonic flow.

Bayesian inference↗
DOE OSTI2020

SubTSBR to tackle high noise and outliers for data-driven discovery of differential equations

Data-driven discovery of differential equations has been an emerging research topic. We propose a novel algorithm subsampling-based threshold sparse Bayesian regression (SubTSBR) to tackle high noise and outliers. The subsampling technique is used for improving the accuracy of the Bayesian learning algorithm. It has two parameters: subsampling size and the number of subsamples. When the subsampling size increases with fixed total sample size, the accuracy of our algorithm goes up and then down. When the number of subsamples increases, the accuracy of our algorithm keeps going up. We demonstrate how to use our algorithm step by step and compare our algorithm with threshold sparse Bayesian regression (TSBR) for the discovery of differential equations. We show that our algorithm produces better results. We also discuss the merits of discovering differential equations from data and demonstrate how to discover models with random initial and boundary condition as well as models with bifurcations. The numerical examples are: (1) predator-prey model with noise, (2) shallow water equations with outliers, (3) heat diffusion with random initial and boundary condition, and (4) fish-harvesting problem with bifurcations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Efficient Bayesian inference with latent Hamiltonian neural networks in No-U-Turn Sampling

When sampling for Bayesian inference, one popular approach in the computational field is to use Hamiltonian Monte Carlo (HMC) and specifically the No-U-Turn Sampler (NUTS), which automatically decides the end time of the Hamiltonian trajectory. However, HMC and NUTS can require numerous numerical gradients of the target density and can prove slow in practice when relying on computationally expensive forward models. We propose Latent Hamiltonian neural networks (L-HNNs) with HMC and NUTS for solving Bayesian inference problems. Once trained, L-HNNs do not require numerical gradients of the target density during sampling, and hence numerous evaluations of the forward computational model. Moreover, L-HNNs satisfy important properties such as perfect time reversibility and Hamiltonian conservation, making them well-suited for use within HMC and NUTS because stationarity can be shown. We also propose the integration of L-HNNs in an online error monitoring scheme, in which numerical gradients of the target density are used for a few samples whenever the L-HNNs prediction errors are large. This online error monitor scheme prevents sample degeneracy in regions of low probability density and ensures robust uncertainty quantification. We demonstrate L-HNNs in NUTS with online error monitoring on several analytical examples involving complex, heavy-tailed, and high-local-curvature probability densities. We then demonstrate the applicability of L-HNNs in NUTS to two computational case studies, namely the Allen-Cahn stochastic partial differential equation and an elliptic partial differential equation with 25 and 50 inference parameters, respectively. Overall, the L-HNNs in NUTS with online error monitoring satisfactorily inferred these probability densities. In conclusion, compared to traditional NUTS, L-HNNs in NUTS with online error monitoring required 1–2 orders of magnitude fewer numerical gradients of the target density and improved the effective sample size (ESS) per gradient (which is a measure of both the sampling quality and the computational expense) by an order of magnitude.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Search for CP violation in events with top quarks and Z bosons at $\sqrt{s}$ = 13 and 13.6 TeV

A search for the violation of the charge-parity (CP) symmetry in the production of top quarks in association with Z bosons is presented, using events with at least three charged leptons and additional jets. The search is performed in a sample of proton-proton collision data collected by the CMS experiment at the CERN LHC in 2016–2018 at a center-of-mass energy of 13 TeV and in 2022 at 13.6 TeV, corresponding to a total integrated luminosity of 173 fb –1 . For the first time in this final state, observables that are odd under the CP transformation are employed. Also for the first time, physics-informed machine-learning techniques are used to construct these observables. While for standard model (SM) processes the distributions of these observables are predicted to be symmetric around zero, CP-violating modifications of the SM would introduce asymmetries. Two CP-odd operators $\mathcal{O}$$^{I}_{tW}$ and $\mathcal{O}$$^{I}_{tZ}$ in the SM effective field theory are considered that may modify the interactions between top quarks and electroweak bosons. The obtained results are consistent with the SM prediction within two standard deviations, and exclusion limits on the associated Wilson coefficients of –2.7 < $c$$^{I}_{tW}$ < 2.5 and –0.2 < $c$$^{I}_{tZ}$ < 2.0 and are set at 95 % confidence level. The largest discrepancy is observed in $c$$^{I}_{tZ}$ where data is consistent with positive values, with an observed local significance with respect to the SM hypothesis of 2.5 standard deviations, when only linear terms are considered.

CMS↗
DOE OSTI2025

Autonomous Synthesis and Inverse Design of Electrochromic Polymers with High Efficiency and Accuracy

Here, the design and synthesis of functional polymers, aimed at targeted properties through specific structures, have long been challenged by their complex and often nonlinear structure–property relationships. Key processes, including knowledge accumulation for predictive design and experimental refinement and validation, are traditionally labor-insensitive and time-consuming, making it difficult to balance accuracy and efficiency. Here, we introduce an accelerated, autonomous system for the on-demand synthesis of electronic polymers that achieves the desired electrochromic functionality with high accuracy and efficiency. Our approach leverages large language model-assisted data mining, a physics-informed copolymer machine learning model, and an AI-driven autonomous robotic workflow in the Polybot lab. Within 72 h, Polybot autonomously synthesized electrochromic polymers (ECPs) with targeted, previously-unreported color values, including green polymers with specific absorption profiles, precisely fine-tuning copolymer structures with a 5% step size in comonomer composition within a three-monomer system. A publicly accessible ECP informatics database has also been created to foster knowledge exchange.

AI-driven Robotic Lab↗
DOE OSTI2022

Preparing for the next pandemic via transfer learning from existing diseases with hierarchical multi-modal BERT: a study on COVID-19 outcome prediction

Abstract Developing prediction models for emerging infectious diseases from relatively small numbers of cases is a critical need for improving pandemic preparedness. Using COVID-19 as an exemplar, we propose a transfer learning methodology for developing predictive models from multi-modal electronic healthcare records by leveraging information from more prevalent diseases with shared clinical characteristics. Our novel hierarchical, multi-modal model ( $${\textsc {TransMED}}$$ T R A N S MED ) integrates baseline risk factors from the natural language processing of clinical notes at admission, time-series measurements of biomarkers obtained from laboratory tests, and discrete diagnostic, procedure and drug codes. We demonstrate the alignment of $${\textsc {TransMED}}$$ T R A N S MED ’s predictions with well-established clinical knowledge about COVID-19 through univariate and multivariate risk factor driven sub-cohort analysis. $${\textsc {TransMED}}$$ T R A N S MED ’s superior performance over state-of-the-art methods shows that leveraging patient data across modalities and transferring prior knowledge from similar disorders is critical for accurate prediction of patient outcomes, and this approach may serve as an important tool in the early response to future pandemics.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Merger identification through photometric bands, colours, and their errors

Aims. We present the application of a fully connected neural network (NN) for galaxy merger identification using exclusively photometric information. Our purpose is not only to test the method’s efficiency, but also to understand what merger properties the NN can learn and what their physical interpretation is. Methods. We created a class-balanced training dataset of 5860 galaxies split into mergers and non-mergers. The galaxy observations came from SDSS DR6 and were visually identified in Galaxy Zoo. The 2930 mergers were selected from known SDSS mergers and the respective non-mergers were the closest match in both redshift and r magnitude. The NN architecture was built by testing a different number of layers with different sizes and variations of the dropout rate. We compared input spaces constructed using: the five SDSS filters: u, g, r, i, and z; combinations of bands, colours, and their errors; six magnitude types; and variations of input normalization. Results. We find that the fibre magnitude errors contribute the most to the training accuracy. Studying the parameters from which they are calculated, we show that the input space built from the sky error background in the five SDSS bands alone leads to 92.64 ± 0.15% training accuracy. We also find that the input normalization, that is to say, how the data are presented to the NN, has a significant effect on the training performance. Conclusions. We conclude that, from all the SDSS photometric information, the sky error background is the most sensitive to merging processes. This finding is supported by an analysis of its five-band feature space by means of data visualization. Moreover, studying the plane of the g and r sky error bands shows that a decision boundary line is enough to achieve an accuracy of 91.59%.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Nonlinear proper orthogonal decomposition for convection-dominated flows

Autoencoder techniques find increasingly common use in reduced order modeling as a means to create a latent space. This reduced order representation offers a modular data-driven modeling approach for nonlinear dynamical systems when integrated with a time series predictive model. In this Letter, we put forth a nonlinear proper orthogonal decomposition (POD) framework, which is an end-to-end Galerkin-free model combining autoencoders with long short-term memory networks for dynamics. By eliminating the projection error due to the truncation of Galerkin models, a key enabler of the proposed nonintrusive approach is the kinematic construction of a nonlinear mapping between the full-rank expansion of the POD coefficients and the latent space where the dynamics evolve. We test our framework for model reduction of a convection-dominated system, which is generally challenging for reduced order models. Our approach not only improves the accuracy, but also significantly reduces the computational cost of training and testing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Laboratory earthquake forecasting: A machine learning competition

Earthquake prediction, the long-sought holy grail of earthquake science, continues to confound Earth scientists. Could we make advances by crowdsourcing, drawing from the vast knowledge and creativity of the machine learning (ML) community? We used Google’s ML competition platform, Kaggle, to engage the worldwide ML community with a competition to develop and improve data analysis approaches on a forecasting problem that uses laboratory earthquake data. The competitors were tasked with predicting the time remaining before the next earthquake of successive laboratory quake events, based on only a small portion of the laboratory seismic data. The more than 4,500 participating teams created and shared more than 400 computer programs in openly accessible notebooks. Complementing the now well-known features of seismic data that map to fault criticality in the laboratory, the winning teams employed unexpected strategies based on rescaling failure times as a fraction of the seismic cycle and comparing input distribution of training and testing data. In addition to yielding scientific insights into fault processes in the laboratory and their relation with the evolution of the statistical properties of the associated seismic data, the competition serves as a pedagogical tool for teaching ML in geophysics. The approach may provide a model for other competitions in geosciences or other domains of study to help engage the ML community on problems of significance.

58 GEOSCIENCES↗
DOE OSTI2022

A high-dimensional neural network potential for molecular dynamics simulations of condensed phase nickel and phase transitions

A high-dimensional neural network interatomic potential was developed and used in molecular dynamics simulations of condensed phase Ni and Ni systems with liquid–solid phase coexistence. The reference data set was generated by sampling the potential energy surface over a broad temperature-pressure domain using ab initio MD simulations to train a unified potential. Excellent agreement was achieved between bulk face-centered cubic nickel thermal expansion simulations and relevant experimental data. The same potential also yields accurate structures and diffusivities in the liquid state. The phase transition between liquid and solid phases was simulated using the two-phase interface method. The predicted melting point temperature is within a few kelvins of the literature value. Here, the general methodology could be applied to describe crystals with much more complex phase behaviors.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2025

Fast jet tagging with MLP-Mixers on FPGAs

We explore the innovative use of MLP-Mixer models for real-time jet tagging and establish their feasibility on resource-constrained hardware like FPGAs. MLP-Mixers excel in processing sequences of jet constituents, achieving state-of-the-art performance on datasets mimicking Large Hadron Collider conditions. By using advanced optimization techniques such as High-Granularity Quantization and Distributed Arithmetic, we achieve unprecedented efficiency. These models match or surpass the accuracy of previous architectures, reduce hardware resource usage by up to 97%, double the throughput, and half the latency. Additionally, non-permutation-invariant architectures enable smart feature prioritization and efficient FPGA deployment, setting a new benchmark for machine learning in real-time data processing at particle colliders.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2020

Assessing three closed-loop learning algorithms by searching for high-quality quantum control pulses

Designing a high-quality control is crucial for reliable quantum computation. Among the existing approaches, closed-loop leaning control is an effective choice. Its efficiency depends on the learning algorithm employed, thus deserving algorithmic comparisons for its practical applications. Here we assess three representative learning algorithms, including GRadient Ascent Pulse Engineering (GRAPE), improved Nelder-Mead (NMplus), and Differential Evolution (DE), by searching for high-quality control pulses to prepare the Bell state. We first implement each algorithm experimentally in a nuclear magnetic resonance system and then conduct a numerical study considering the impact of some possible significant experimental uncertainties. The experiments report the successful preparation of the high-fidelity target state by the three algorithms, while NMplus converges fastest, and these results coincide with the numerical simulations when potential uncertainties are negligible. However, under certain significant uncertainties, these algorithms possess distinct performance with respect to their resulting precision and efficiency, and DE shows the best robustness. Finally, this study provides insight to aid in the practical application of different closed-loop learning algorithms in realistic physical scenarios.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗