Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “constrained 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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Feature-adjacent multi-fidelity physics-informed machine learning for partial differential equations

Physics-informed neural networks have emerged as an alternative method for solving partial differential equations. However, for complex problems, the training of such networks can still require high-fidelity data which can be expensive to generate. To reduce or even eliminate the dependency on high-fidelity data, we propose a novel multi-fidelity architecture which is based on a feature space shared by the low- and high-fidelity solutions. In the feature space, the projections of the low-fidelity and high-fidelity solutions are adjacent by constraining their relative distance. The feature space is represented with an encoder and its mapping to the original solution space is effected through a decoder. In conclusion, the proposed multi-fidelity approach is validated on forward and inverse problems for steady and unsteady problems described by partial differential equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A high-throughput approach for statistical process optimization in Laser Powder Bed Fusion

Process variability is inherent in metal additive manufacturing (AM). However, it is often overlooked in process optimization frameworks, constraining the understanding of process uncertainties and their influence on parameter selection. To address this, we present an integrated framework that combines high-throughput single-track experiments, GAN-based melt pool geometry extraction, robust statistical and machine learning modeling, and uncertainty-quantified process mapping. Process variability is characterized through single-track melt pool behaviors, and its influence on defect formation is systematically quantified to enable statistically guided process parameter optimization. This approach is demonstrated on Laser Powder Bed Fusion (L-PBF) of stainless steel 316L, effectively capturing the interplay between process parameters, melt pool variability, and defect probability. By integrating uncertainty quantification into process optimization, this study provides a structured methodology for addressing variability challenges in AM quality control, ultimately contributing to enhanced manufacturing reliability.

Laser Powder Bed Fusion↗
DOE OSTI2020

Incorporating Electronic Information into Machine Learning Potential Energy Surfaces via Approaching the Ground-State Electronic Energy as a Function of Atom-Based Electronic Populations

Machine learning (ML) approximations to density functional theory (DFT) potential energy surfaces (PESs) are showing great promise for reducing the computational cost of accurate molecular simulations, but at present, they are not applicable to varying electronic states, and in particular, they are not well suited for molecular systems in which the local electronic structure is sensitive to the medium to long-range electronic environment. With this issue as the focal point, we present a new machine learning approach called "BpopNN" for obtaining efficient approximations to DFT PESs. Conceptually, the methodology is based on approaching the true DFT energy as a function of electron populations on atoms; in practice, this is realized with available density functionals and constrained DFT (CDFT). Additionally, the new approach creates approximations to this function with neural networks. These approximations thereby incorporate electronic information naturally into a ML approach, and optimizing the model energy with respect to populations allows the electronic terms to self-consistently adapt to the environment, as in DFT. We confirm the effectiveness of this approach with a variety of calculations on LinHn clusters.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Active oversight and quality control in standard Bayesian optimization for autonomous experiments

The fusion of experimental automation and machine learning has catalyzed a new era in materials research, prominently featuring Gaussian Process (GP) Bayesian Optimization (BO) driven autonomous experiments. Here we introduce a Dual-GP approach that enhances traditional GPBO by adding a secondary surrogate model to dynamically constrain the experimental space based on real-time assessments of the raw experimental data. This Dual-GP approach enhances the optimization efficiency of traditional GPBO by isolating more promising space for BO sampling and more valuable experimental data for primary GP training. We also incorporate a flexible, human-in-the-loop intervention method in the Dual-GP workflow to adjust for unanticipated results. We demonstrate the effectiveness of the Dual-GP model with synthetic model data and implement this approach in autonomous pulsed laser deposition experimental data. This Dual-GP approach has broad applicability in diverse GPBO-driven experimental settings, providing a more adaptable and precise framework for refining autonomous experimentation for more efficient optimization.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Electron Neutrino Selection for Neutrino Oscillation Searches in the SBN Program

The Short- Baseline Neutrino (SBN) Pprogram at Fermilab employs a near detector, SBND, and a far detector, ICARUS, to search for baseline-dependent changes to the measure muon neutrino disappearance and electron neutrino appearance and disappearance from the muon neutrino-dominated Booster Neutrino Beam flux. The use of the same liquid argon time projection chamber (LArTPC) technology in both detectors and the same neutrino beam enables a systematically well-constrained oscillation measurement, by leveraging the high statistics of O(10 million) neutrino interactions expected at SBND through 2027 to constrain flux and cross-section systematics. In this poster, we present high-statistics, high-purity electron neutrino selections in SBND and ICARUS and related electron shower energy calibration measurements in SBND enabled by the SPINE deep learning-based particle reconstruction framework. Furthermore, we discuss how these samples can enable high sensitivity to '3+1' sterile neutrino oscillations in a combined fit accounting for systematic uncertainties and correlations.

Oza, Nupur [Nevis Labs, Columbia U.; Columbia U.]↗
DOE OSTI2021

Physics-constrained, low-dimensional models for magnetohydrodynamics: First-principles and data-driven approaches

Plasmas are highly nonlinear and multiscale, motivating a hierarchy of models to understand and describe their behavior. However, there is a scarcity of plasma models of lower fidelity than magnetohydrodynamics (MHD), although these reduced models hold promise for understanding key physical mechanisms, efficient computation, and real-time optimization and control. Galerkin models, obtained by projection of the MHD equations onto a truncated modal basis, and data-driven models, obtained by modern machine learning and system identification, can furnish this gap in the lower levels of the model hierarchy. This work develops a reduced-order modeling framework for compressible plasmas, leveraging decades of progress in projection-based and data-driven modeling of fluids. We begin by formalizing projection-based model reduction for nonlinear MHD systems. To avoid separate modal decompositions for the magnetic, velocity, and pressure fields, we introduce an energy inner product to synthesize all of the fields into a dimensionally consistent, reduced-order basis. Next, we obtain an analytic model by Galerkin projection of the Hall-MHD equations onto these modes. We illustrate how global conservation laws constrain the model parameters, revealing symmetries that can be enforced in data-driven models, directly connecting these models to the underlying physics. We demonstrate the effectiveness of this approach on data from high-fidelity numerical simulations of a three-dimensional spheromak experiment. Finally, this manuscript builds a bridge to the extensive Galerkin literature in fluid mechanics and facilitates future principled development of projection-based and data-driven models for plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Knowledge Distillation for Anomaly Detection

Unsupervised deep learning techniques are widely used to identify anomalous behaviour. The performance of such methods is a product of the amount of training data and the model size. However, the size is often a limiting factor for the deployment on resource-constrained devices. Here, we present a novel procedure based on knowledge distillation for compressing an unsupervised anomaly detection model into a supervised deployable one and we suggest a set of techniques to improve the detection sensitivity. Compressed models perform comparably to their larger counterparts while significantly reducing the size and memory footprint.

Pol, Adrian Alan↗
DOE OSTI2024

What Can We Learn about the Unstable Equation-of-state Branch from Neutron Star Mergers?

Abstract The equation of state (EOS) of dense strongly interacting matter can be probed by astrophysical observations of neutron stars (NS), such as X-ray detections of pulsars or the measurement of the tidal deformability of NSs during the inspiral stage of NS mergers. These observations constrain the EOS at most up to the density of the maximum-mass configuration, n TOV , which is the highest density that can be explored by stable NSs for a given EOS. However, under the right circumstances, binary neutron star (BNS) mergers can create a postmerger remnant that explores densities above n TOV . In this work, we explore whether the EOS above n TOV can be measured from gravitational-wave or electromagnetic observations of the postmerger remnant. We perform a total of 25 numerical-relativity simulations of BNS mergers for a range of EOSs and find no case in which different descriptions of the matter above n TOV have a detectable impact on postmerger observables. Hence, we conclude that the EOS above n TOV can likely not be probed through BNS merger observations for the current and next generation of detectors.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

ORBIT-2: Scaling Exascale Vision Foundation Models for Weather and Climate Downscaling

Sparse observations and coarse-resolution climate models limit effective regional decision-making, underscoring the need for robust downscaling. However, existing AI methods struggle with generalization across variables and geographies and are constrained by the quadratic complexity of Vision Transformer (ViT) self-attention. We introduce ORBIT-2, a scalable foundation model for global, hyper-resolution climate downscaling. ORBIT-2 incorporates two key innovations: (1) Residual Slim ViT (Reslim), a lightweight architecture with residual learning and Bayesian regularization for efficient, robust prediction; and (2) TILES, a tile-wise sequence scaling algorithm that reduces self-attention complexity from quadratic to linear, enabling long-sequence processing and massive parallelism. ORBIT-2 scales to 10 billion parameters across 65,536 GPUs, achieving up to 4.1 ExaFLOPS sustained throughput and 74–98% strong scaling efficiency. It supports downscaling to 0.9 km global resolution and processes sequences up to 4.2 billion tokens. On 7 km resolution benchmarks, ORBIT-2 achieves high accuracy with R2 scores in range of 0.98–0.99 against observation data.

Wang, Xiao [ORNL] (ORCID:0000000165451943)↗
DOE OSTI2025

Data-Driven Kinetic Reaction Networks for Separation Chemistry

Understanding complex, multistep chemical reactions at the molecular level is a major challenge whose solution would greatly benefit the design and optimization of numerous chemical processes. The separation of rare-earth (4f) and actinide (5f) elements is an example where improving our chemical understanding is important for designing and optimizing new chemistries, even with a limited number of observations. Here, in this work, we leverage data-driven artificial intelligence and machine-learning approaches to develop kinetic reaction networks that describe the liquid–liquid extraction mechanism of uranium using N,N-di-2-ethylhexyl-isobutyramide (DEHiBA). Specifically, we compare and contrast the properties of two classes of models: (1) purely data-driven models that are regularized using chemistry-agnostic, L1 regression and (2) chemistry-informed models that are regularized using relative reaction energies provided by quantum mechanical calculations. We observe that purely data-driven models are unbiased, simple, and accurate in their predictions of experimental measurements when provided with sufficient data but are difficult to fully constrain and interpret. In contrast, chemistry-informed models exhibit significantly improved chemical interpretability and consistency, providing a detailed description of the separation process while achieving high accuracy through ensemble averaging. Overall, the dominant species predicted to be extracted into the organic phase is UO 2 (NO 3 ) 2 (DEHiBA) 2 , agreeing with experimental slope analysis, thermodynamic modeling, EXAFS, and crystal structures. This work demonstrates that leveraging the fundamental structure of the problem can lead to efficient learning schemes that provide both accurate predictions and chemical insights at a low computational cost.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Exploratory analysis of machine learning techniques in the Nevada geothermal play fairway analysis

Play fairway analysis (PFA) is commonly used to generate geothermal potential maps and guide exploration studies, with a particular focus on locating and characterizing blind geothermal systems. This study evaluates the application of machine learning techniques to PFA in the Great Basin region of Nevada. Following the evaluation of various techniques, we identified two approaches to PFA that produced promising results, 1) supervised Bayesian probabilistic neural networks to generate geothermal potential maps with confidence intervals, and 2) unsupervised principal component analysis paired with k-means clustering to generate both cluster maps to help identify spatial patterns, as well as new combined feature inputs. We applied these techniques to perform a comparative analysis between two principal sets of geological and geophysical features related to permeability and heat and a set of positive (known geothermal resources) and negative training sites (known drill sites with unsuitable geothermal conditions). We found that these methods constrain previously unrecognized feature controls on geothermal favorability, many of which are spatially organized within the extent of cluster groups and the major structural-hydrologic domains of the study area. Furthermore, we utilized exploratory unsupervised modeling to highlight spatial relationships between input data and predictive output results of our supervised modeling. As a result, we demonstrate how our models compare to the previous Nevada PFA and how the rapid insights these machine learning techniques offer may support future assessments of both known and undiscovered blind geothermal systems in the Great Basin region of Nevada and beyond.

15 GEOTHERMAL ENERGY↗
DOE OSTI2026

Detection of the pairwise kinematic Sunyaev-Zel’dovich effect and pairwise velocity with DESI DR1 galaxies and ACT DR6 and Planck CMB data

We present a 9.3⁢𝜎 detection of the pairwise kinematic Sunyaev-Zel’dovich (kSZ) effect by combining a sample of 913,286 Luminous Red Galaxies (LRGs) from the Dark Energy Spectroscopic Instrument Data Release 1 (DESI DR1) catalog and coadded Atacama Cosmology Telescope (ACT DR6) and Planck cosmic microwave background (CMB) temperature maps. This represents the highest-significance pairwise kSZ measurement to date. The analysis uses three ACT CMB temperature maps: coadded 150 GHz, total frequency maps, and a component separated Internal Linear Combination (ILC) map, all of which cover 19,000 square degrees of the sky from Advanced ACTPol observations conducted between 2017 and 2022. Comparison of the results of these three maps serves as a consistency check for potential foreground contamination that may depend on the observation frequency. An estimate of the best-fit mass-averaged optical depth is obtained by comparing the pairwise kSZ curve with the linear theory prediction of the pairwise velocity under the best-fit Planck cosmology and is compared with predictions from simulations. This estimate serves as a reference point for future comparisons with thermal SZ–derived optical depth measurements for the same DESI cluster samples, which will be presented in a companion paper. Finally, we employ a machine learning approach, trained on simulations to estimate the optical depth for 456,803 DESI LRG-identified clusters within the simulated mass range ( ≳ 10 13 ⁢𝑀 ⊙ ). These are combined with the measured kSZ signal to infer the individual cluster peculiar velocities, providing the opportunity to constrain the behavior of gravity and the dark sector over a range of cosmic scales and epochs.

Gong, Yulin [Cornell University] (ORCID:0000000346↗
DOE OSTI2024

Combining lattice QCD and phenomenological inputs on generalised parton distributions at moderate skewness

Abstract We present a systematic study demonstrating the impact of lattice QCD data on the extraction of generalised parton distributions (GPDs). For this purpose, we use a previously developed modelling of GPDs based on machine learning techniques fulfilling the theoretical requirements of polynomiality, a form of positivity constraint and known reduction limits. A special care is given to estimate the uncertainty stemming from the ill-posed character of the connection between GPDs and the experimental processes usually considered to constrain them, like deeply virtual Compton scattering (DVCS). Moke lattice QCD data inputs are included in a Bayesian framework to a prior model based on an Artificial Neural Network. This prior model is fitted to reproduce the most experimentally accessible information of a phenomenological extraction by Goloskokov and Kroll. We highlight the impact of the precision, correlation and kinematic coverage of lattice data on GPD extraction at moderate $$\xi $$ ξ which has only been brushed in the literature so far, paving the way for a joint extraction of GPDs.

Physics↗
DOE OSTI2023

Retrospective Search for Strongly Lensed Supernovae in the DESI Legacy Imaging Surveys

The introduction of deep wide-field surveys in recent years and the adoption of machine-learning techniques have led to the discoveries of $\mathcal{O}$(10 4 ) strong gravitational lensing systems and candidates. However, the discovery of multiply-lensed transients remains a rarity. Lensed transients and especially lensed supernovae are invaluable tools to cosmology because they allow us to constrain cosmological parameters via lens modeling and the measurements of their time delays. In this paper, we develop a pipeline to perform a targeted lensed transient search. We apply this pipeline to 5807 strong lenses and candidates, which were identified in the literature, in the DESI Legacy Imaging Surveys Data Release 9 (DR9) footprint. For each system, we analyze every exposure in all of the observed bands (DECam g, r, and z). Our pipeline finds, groups, and ranks detections that are in sufficient proximity temporally and spatially. After the first round of inspection, for promising candidate systems, we further examine the newly available DR10 data (with additional i and Y bands). Here we present our targeted lensed supernova search pipeline and seven new lensed supernova candidates, including a very likely lensed supernova—probably a Type Ia—in a system with an Einstein radius of ~1$^{"}_{.}$5.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Searching for multimessenger transients and lensed supernovae with the dark energy survey

Advances in data collection technology for optical astronomy, such as the Dark Energy Camera, have facilitated the collection of some of the largest astronomical datasets in terms of sky area, depth, number of objects, number of observations, and frequency of observations. Consequentially, physical systems that have been historically rare become represented in small, but discoverable, numbers. I have developed techniques to identify rare physical systems (counterparts to high-energy neutrinos, counterparts to gravitational waves, and gravitationally lensed supernovae) that can shed new light on the physical processes that govern the Universe. For each system of interest, I collect new or search archival observations with the Dark Energy Camera, develop selection methodologies to find the system of interest in the observations, and quantify the efficiency of the search using simulations. Each of the three analyses has its own scientific implications: I constrain the observing program required to determine the contribution of supernovae to the diffuse high-energy neutrino flux; I set constraints on the physical properties of an optical counterpart to a compact object merger; and I identify candidate lensed supernovae using a novel machine learning technique. Looking forward, the work presented in this dissertation informs future rare object searches and facilitates measurements of the underlying properties of the Universe during the next era of optical survey astronomy.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Plug & play directed evolution of proteins with gradient-based discrete MCMC

Abstract A long-standing goal of machine-learning-based protein engineering is to accelerate the discovery of novel mutations that improve the function of a known protein. We introduce a sampling framework for evolving proteins in silico that supports mixing and matching a variety of unsupervised models, such as protein language models, and supervised models that predict protein function from sequence. By composing these models, we aim to improve our ability to evaluate unseen mutations and constrain search to regions of sequence space likely to contain functional proteins. Our framework achieves this without any model fine-tuning or re-training by constructing a product of experts distribution directly in discrete protein space. Instead of resorting to brute force search or random sampling, which is typical of classic directed evolution, we introduce a fast Markov chain Monte Carlo sampler that uses gradients to propose promising mutations. We conduct in silico directed evolution experiments on wide fitness landscapes and across a range of different pre-trained unsupervised models, including a 650 M parameter protein language model. Our results demonstrate an ability to efficiently discover variants with high evolutionary likelihood as well as estimated activity multiple mutations away from a wild type protein, suggesting our sampler provides a practical and effective new paradigm for machine-learning-based protein engineering.

59 BASIC BIOLOGICAL SCIENCES↗