Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “machine learning optimization”

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 1,477 records · Page 82
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Global fire modelling and control attributions based on the ensemble machine learning and satellite observations

Contemporary fire dynamics is one of the most complex and least understood land surface phenomena. Global fire controls related to climate, vegetation, and anthropogenic activity are usually intertwined, and difficult to disentangle in a quantitative way. Here, we leveraged an ensemble of five machine learning (ML) models and multiple satellite-based observations to conduct global fire modeling for three fire metrics (burned area, fire number, and fire size), and quantified driving mechanisms underlying annual fire changes in a spatially resolved manner for the period 2003–2019. Ensemble learning is a meta-approach that combines multiple ML predictions to improve accuracy, robustness, and generalization performance. We found that the optimized ensemble ML well reproduced annual dynamics of global burned area (R 2 = 0.90, P < 0.001), total fire numbers (R 2 = 0.86, P < 0.001), and averaged fire size (R 2 = 0.70, P < 0.001). Additionally, the ensemble ML captured key spatial patterns of multi-year mean magnitudes, annual variabilities, anomalies, and trends for different fire metrics. Our ML-based fire attributions further highlighted the dominant role of enhanced anthropogenic activity in reducing global burned area (–1.9 Mha/yr, P < 0.01), followed by climate control (–1.3 Mha/yr, P < 0.01) and insignificant positive vegetation control (0.4 Mha/yr, P = 0.60). Spatially, climate dominated a much larger burned area (53.7%) than human (23.4%) or vegetation control (22.9%); however, the counteracting effects from regional wetting and drying trends weakened the net climate impacts on global burned area. The fire number and fire size exhibited similar spatial control patterns with burned area; globally, however, fire number tended to be more affected by climate while fire size more influenced by human activities. Overall, our study confirmed the feasibility and efficiency of ensemble ML in global fire modeling and subsequent control attributions, providing a better understanding of contemporary fire regimes and contributing to robust fire projections in a changing environment.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

Absorption dissymmetry factor enhancement: A data-driven approach to unravel the synthesis knobs of chiral 2D perovskites

Chiral 2D metal halide perovskites (MHPs) are promising for spin-optoelectronic applications, yet their absorption dissymmetry factor (g abs ) exhibits significant variability due to complex, co-dependent structural and experimental factors. Here, we established a data-driven framework using Pearson’s correlation, ANOVA, and Gaussian process regression to identify and model key synthesis “knobs” governing these properties. The analysis revealed that solvent choice is the primary factor driving variability. For acetonitrile-based films, g abs was maximized by optimizing annealing temperature and film thickness. Conversely, films from higher boiling point solvents showed complex dependencies on annealing temperature, excitonic integral intensity, and film texture. These statistical correlations provide a roadmap for the rational design of high-performance chiral MHPs and establish a foundation for future machine learning-driven material exploration.

ANOVA↗
DOE OSTI2025

Inference of response functions with the help of machine-learning algorithms

Response functions are a key quantity to describe the near-equilibrium dynamics of strongly interacting many-body systems. Recent techniques that attempt to overcome the challenges of calculating these ab initio have employed expansions in terms of orthogonal polynomials. We employ a neural network prediction algorithm to reconstruct a response function 𝑆⁡(𝜔) defined over a range in frequencies 𝜔. Here, we represent the calculated response function as a truncated Chebyshev series whose coefficients can be optimized to reduce the representation error. We compare the quality of response functions obtained using coefficients calculated using a neural network (NN) algorithm with those computed using the Gaussian integral transform (GIT) method. In the regime where only a small number of terms in the Chebyshev series are retained, we find that the NN scheme outperforms the GIT method.

Kurkcuoglu, Doga Murat [Fermi National Accelerator↗
DOE OSTI2023

Driving Next-Generation Workflows from the Data Plane

We observe the emergence of a new generation of scientific workflows that process data produced at a sustained rate by scientific instruments and large scale numerical simulations. This data is consumed by multiple analysis, visualization, or Machine Learning components not only to enable inference and justify the scientific program, but also to monitor and steer the evolution of these experiments. In such workflows, moving intermediate data efficiently is key to performance, more than efficiently scheduling computational tasks. However, most traditional workflow management systems focus on optimizing task scheduling and then deal with data management, assuming a “move little, compute for long” model, which makes them unfit to the efficient management of this new generation of workflows. Therefore, we advocate for a new way to manage scientific workflows. We propose to consider an efficiently and independently managed data plane that can store and stream data. Workflows compute components, in the application plane can then interact with the data plane, abstracted from complexities of data management. Then, the role of a workflow management system would become that of a control plane that allows users to connect services together to execute the workflow and manages connections between the application and data planes. In this position paper, we characterize several next-generation workflow motifs and describe how their interaction with the data plane is a challenge to traditional workflow management systems. Then, we express a set of requirements that a workflow management system should meet to efficiently manage next-generation workflows at different scales. Based on these requirements, we expose our vision of driving next-generation workflows from the data plane and list remaining open challenges.

Suter, Fred↗
DOE OSTI2020

Concurrent Relaxation through Accelerated Deep Learning

CRADL captures performance metrics of machine learning algorithms operating on mesh data from multiphysics codes This proxy application is a tool to explore scalability of inference on HPC platforms, and also gather performance metrics for inference on new machine learning specific hardware. CRADL is designed to give users as fine a control as possible over an inference simulation. Users may select the number of cycles, amount of data, and batch size to pass to the accelerator of choice. Additionally the user may select a number of performance optimization libraries and flags. CRADL comes packaged with a repository of anonymized multi-physics simulation data, as well as a pretrained model for inference. The code allows a user to load their own pre-trained model and data if they wish. The code can operate in multiple parallelization schemes, with performance enhancing options such as half-precision libraries, PyTorch benchmarking, and pinned memory with non-blocking data transfers.

Zieb, KristoferJ.↗
DOE OSTI2020

DPM: A deep learning PDE augmentation method with application to large-eddy simulation

A framework is introduced that leverages known physics to reduce overfitting in machine learning for scientific applications. The partial differential equation (PDE) that expresses the physics is augmented with a neural network that uses available data to learn a description of the corresponding unknown or unrepresented physics. Training within this combined system corrects for missing, unknown, or erroneously represented physics, including discretization errors associated with the PDE's numerical solution. For optimization of the network within the PDE, an adjoint PDE is solved to provide high-dimensional gradients, and a stochastic adjoint method (SAM) further accelerates training. Additionally, the approach is demonstrated for large-eddy simulation (LES) of turbulence. High-fidelity direct numerical simulations (DNS) of decaying isotropic turbulence provide the training data used to learn sub-filter-scale closures for the filtered Navier–Stokes equations. Out-of-sample comparisons show that the deep learning PDE method outperforms widely-used models, even for filter sizes so large that they become qualitatively incorrect. It also significantly outperforms the same neural network when a priori trained based on simple data mismatch, not accounting for the full PDE. Measures of discretization errors, which are well-known to be consequential in LES, point to the importance of the unified training formulation's design, which without modification corrects for them. For comparable accuracy, simulation runtime is significantly reduced. A relaxation of the typical discrete enforcement of the divergence-free constraint in the solver is also successful, instead allowing the DPM to approximately enforce incompressibility physics. Since the training loss function is not restricted to correspond directly to the closure to be learned, training can incorporate diverse data, including experimental data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Optimal decision trees for categorical data via integer programming

Decision trees have been a very popular class of predictive models for decades due to their interpretability and good performance on categorical features. However, they are not always robust and tend to overfit the data. Additionally, if allowed to grow large, they lose interpretability. In this paper, we present a mixed integer programming formulation to construct optimal decision trees of a prespecified size. We take the special structure of categorical features into account and allow combinatorial decisions (based on subsets of values of features) at each node. Our approach can also handle numerical features via thresholding. Here we show that very good accuracy can be achieved with small trees using moderately-sized training sets. The optimization problems we solve are tractable with modern solvers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Neural Network-Based Electric Vehicle Range Prediction for Smart Charging Optimization

Range prediction is a standard feature in most modern road vehicles, allowing drivers to make informed decisions about when to refuel. Most vehicles make range predictions through data- or model-driven means, monitoring the average fuel consumption rate or using a tuned vehicle model to predict fuel consumption. The uncertainty of future driving conditions makes the range prediction problem challenging, particularly for less pervasive battery electric vehicles (BEV). Most contemporary machine learning-based methods attempt to forecast the battery SOC discharge profile to predict vehicle range. In this work, we propose a novel approach using two recurrent neural networks (RNNs) to predict the remaining range of BEVs and the minimum charge required to safely complete a trip. Each RNN has two outputs that can be used for statistical analysis to account for uncertainties; the first loss function leads to mean and variance estimation (MVE), while the second results in bounded interval estimation (BIE). These outputs of the proposed RNNs are then used to predict the probability of a vehicle completing a given trip without charging, or if charging is needed, the remaining range and minimum charging required to finish the trip with high probability. Training data was generated using a low-order physics model to estimate vehicle energy consumption from historical drive cycle data collected from medium-duty last-mile delivery vehicles. Here, the proposed method demonstrated high accuracy in the presence of day-to-day route variability, with the root-mean-square error (RMSE) below 6% for both RNN models.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2021

Coreset Clustering on Small Quantum Computers

Many quantum algorithms for machine learning require access to classical data in superposition. However, for many natural data sets and algorithms, the overhead required to load the data set in superposition can erase any potential quantum speedup over classical algorithms. Recent work by Harrow introduces a new paradigm in hybrid quantum-classical computing to address this issue, relying on coresets to minimize the data loading overhead of quantum algorithms. We investigated using this paradigm to perform k-means clustering on near-term quantum computers, by casting it as a QAOA optimization instance over a small coreset. We used numerical simulations to compare the performance of this approach to classical k-means clustering. We were able to find data sets with which coresets work well relative to random sampling and where QAOA could potentially outperform standard k-means on a coreset. However, finding data sets where both coresets and QAOA work well—which is necessary for a quantum advantage over k-means on the entire data set—appears to be challenging.

42 ENGINEERING↗
DOE OSTI2024

CORN (Crop Optimization Realized through Neuralnets)

Traditional models of predicting plant traits are limited because they often rely on linear assumptions that do not fully capture the complexity of biological interactions and DNA-based markers which are static across environments. This project generated a set of RNA-based data from large multi-environment field trials and combined it with advanced machine learning techniques to account for these complex interactions and improve the accuracy of predictions.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

4th Big Data for Nuclear Power Plants Workshop 2023

The Ohio State University and Idaho National Laboratory organized the 4 th Big Data for Nuclear Power Plants Workshop in November, 2023 in Columbus, Ohio. Workshop topics were chosen to understand the challenges and gaps that need to be addressed to maximize the impact of data on the nuclear industry, as well as the associated applications and risks. Discussions were focused around six specific application areas: Operation and Maintenance; Machine Learning in Nuclear Materials and Advanced Manufacturing; Cybersecurity; High-Performance Computing and Massive Computation; Big Data and Digital Twins; and Nuclear Non-Proliferation. The opportunities, challenges, and risks identified in the six focus areas explored in this workshop are diverse, but some common themes emerge, such as the importance of data integrity, quality, coverage, privacy, and traceability. Big data and AI/ML tools can be leveraged to reduce costs, optimize human tasking, and reduce human error across various application areas. In order for the nuclear industry to benefit from big data and advanced analytic capabilities, it is essential to address challenges and risks, such as data privacy, model reliability, and computational resource availability. Learning from other industries that have successfully implemented big data and AI/ML technologies, like the aerospace industry, can help the nuclear industry successfully integrate these technologies.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

Comparing the Expense and Accuracy of Methods to Simulate Atomic Vibrations in Rubrene

Atomic vibrations can inform about materials properties from hole transport in organic semiconductors to correlated disorder in metal–organic frameworks. Currently, there are several methods for predicting these vibrations using simulations, but the accuracy–efficiency tradeoffs have not been examined in depth. In this work, rubrene is used as a model system to predict atomic vibrational properties using six different simulation methods: density functional theory, density functional tight binding, density functional tight binding with a Chebyshev polynomial-based correction, a trained machine learning model, a pretrained machine learning model called ANI-1, and a classical forcefield model. The accuracy of each method is evaluated by comparison to the experimental inelastic neutron scattering spectrum. All methods discussed here show some accuracy across a wide energy region, though the Chebyshev-corrected tight-binding method showed the optimal combination of high accuracy with low expense. We then offer broad simulation guidelines to yield efficient, accurate results for inelastic neutron scattering spectrum prediction.

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

A review of non-cognitive applications for neuromorphic computing

Abstract Though neuromorphic computers have typically targeted applications in machine learning and neuroscience (‘cognitive’ applications), they have many computational characteristics that are attractive for a wide variety of computational problems. In this work, we review the current state-of-the-art for non-cognitive applications on neuromorphic computers, including simple computational kernels for composition, graph algorithms, constrained optimization, and signal processing. We discuss the advantages of using neuromorphic computers for these different applications, as well as the challenges that still remain. The ultimate goal of this work is to bring awareness to this class of problems for neuromorphic systems to the broader community, particularly to encourage further work in this area and to make sure that these applications are considered in the design of future neuromorphic systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A Novel Machine Learning Algorithm for Planetary Boundary Layer Height Estimation Using AERI Measurement Data

Accurately determining the height of the planetary boundary layer (PBL) is important since it can affect the climate, weather, and air quality. Ground-based infrared hyperspectral remote sensing is an effective way to obtain this parameter. Compared with radiosonde measurements, its temporal resolution is much higher. In this study, a method to retrieve the PBL height (PBLH) from the ground-based infrared hyperspectral radiance data is proposed based on machine learning. In this method, the channels that are sensitive to temperature and humidity profiles are selected as the feature vectors, and the PBLHs derived from radiosonde are taken as the true values. The support vector machine (SVM) is applied to train and test the data set, and the parameters are optimized in the process. The data set collected at the Atmospheric Radiation Measurement (ARM) program Southern Great Plains (SGP) from 2012 to 2015 is analyzed. The instruments used in this letter include Atmospheric Emitted Radiance Interferometer (AERI), Vaisala CL31 ceilometer, and radiosonde. It shows that the root mean square error (RMSE) between the PBLHs calculated by the proposed method using AERI data and those from radiosonde data can be within 370 m, and the square correlation coefficient (SCC) is greater than 0.7. Compared with the PBLHs derived from the ceilometer, it can be found that the new method is more stable and less affected by clouds.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

ASAP: Automatic Synthesis of Area-Efficient and Precision-Aware CGRAs

Coarse-grained reconfigurable accelerators (CGRAs) are a promising accelerator design choice that strikes a balance between performance and adaptability to different computing patterns across various applications domains. Designing a CGRA for a specific application domain involves enormous software/hardware engineering effort. Recent research works explore loop transformations, functional unit types, network topology, and memory size to identify optimal CGRA designs given a set of kernels from a specific application do- main. Unfortunately, the impact of functional units with different precision support has rarely been investigated. To address this gap, we propose ASAP – a hardware/software co-design framework that automatically identifies and synthesizes optimal precision-aware CGRA for a set of applications of interest. Our evaluation shows that ASAP generates specialized designs 3.2×, 4.21×, and 5.8× more efficient (in terms of performance per unit of energy or area) than non-specialized homogeneous CGRAs, for the scientific computing, embedded, and edge machine learning domains, respectively, with limited accuracy loss. Moreover, ASAP provides more efficient designs than other state-of-the-art synthesis frameworks for specialized CGRAs.

artificial intelligence↗
DOE OSTI2023

A semi-agnostic ansatz with variable structure for variational quantum algorithms

Quantum machine learning—and specifically Variational Quantum Algorithms (VQAs)—offers a powerful, flexible paradigm for programming near-term quantum computers, with applications in chemistry, metrology, materials science, data science, and mathematics. Here, one trains an ansatz, in the form of a parameterized quantum circuit, to accomplish a task of interest. However, challenges have recently emerged suggesting that deep ansatzes are difficult to train, due to flat training landscapes caused by randomness or by hardware noise. This motivates our work, where we present a variable structure approach to build ansatzes for VQAs. Our approach, called VAns (Variable Ansatz), applies a set of rules to both grow and (crucially) remove quantum gates in an informed manner during the optimization. Consequently, VAns is ideally suited to mitigate trainability and noise-related issues by keeping the ansatz shallow. We employ VAns in the variational quantum eigensolver for condensed matter and quantum chemistry applications, in the quantum autoencoder for data compression and in unitary compilation problems showing successful results in all cases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Machine learning inversion of interatomic force constants from single-crystal inelastic neutron scattering

Atomic vibrations govern many macroscopic properties of materials, but experiments to comprehensively probe them remain challenging. Inelastic neutron scattering (INS) is a powerful technique to map phonon dispersions in crystals, especially when leveraging modern time-of-flight (ToF) spectrometers with large detectors. However, efficiently and robustly extracting interatomic force constants (FCs) parameterizing phonon dynamics from experimental spectra remains a bottleneck due to the complexity and high dimensionality of ToF INS datasets. Here, we present a machine learning approach for the direct inversion of FCs from single-crystal INS measurements. The framework leverages synthetic training data generated using universal machine-learned force fields and an efficient physics-based forward model. We benchmark two neural architectures–one emphasizing structured latent representation learning and the other direct, supervised spectral regression–across simulated datasets for two materials under idealized and noisy conditions. The latent-representation model is subsequently applied to experimental single-crystal INS data on germanium. The model is shown to reproduce FCs derived from both first-principles simulations and from iterative optimization, and furthermore achieves reliable inference even from sparse, single-orientation measurements representing short data acquisitions. Analysis of the learned latent space reveals semantically continuous and physically interpretable encodings that support strong cross-domain generalization. By bridging theoretical and experimental domains, we establish a path toward rapid inversion of experimental spectra and data-driven interpretation of temperature-dependent lattice dynamics.

42 ENGINEERING↗