SEARCH · Engineering Papers

Results for “Local regression”

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.

SourceResearch connectionFrom yearThrough year

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

At least 91 records · Page 5

All sources NASA NTRS DOE OSTI

DOE OSTI2021

Analytical gradients for molecular-orbital-based machine learning

We report molecular-orbital-based machine learning (MOB-ML) enables the prediction of accurate correlation energies at the cost of obtaining molecular orbitals. Here, we present the derivation, implementation, and numerical demonstration of MOB-ML analytical nuclear gradients, which are formulated in a general Lagrangian framework to enforce orthogonality, localization, and Brillouin constraints on the molecular orbitals. The MOB-ML gradient framework is general with respect to the regression technique (e.g., Gaussian process regression or neural networks) and the MOB feature design. We show that MOB-ML gradients are highly accurate compared to other ML methods on the ISO17 dataset while only being trained on energies for hundreds of molecules compared to energies and gradients for hundreds of thousands of molecules for the other ML methods. The MOB-ML gradients are also shown to yield accurate optimized structures at a computational cost for the gradient evaluation that is comparable to a density-corrected density functional theory calculation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2022

Accurate parameterization of the kinetic energy functional

The absence of a reliable formulation of kinetic energy density functional has hindered the development of orbital free density functional theory. Using the data-aided learning paradigm, we propose a simple prescription to accurately model the kinetic energy density of any system. Our method relies on a dictionary of functional forms for local and nonlocal contributions which have been proposed in the literature and the appropriate coefficients are calculated via a linear regression framework. To model the nonlocal contributions, we explore two new nonlocal functionals - a functional that captures fluctuations in electronic density and a functional that incorporates gradient information. Since, the analytical functional forms of the kernels present in these nonlocal terms are not known from theory, we propose a basis function expansion to model these seemingly difficult nonlocal quantities. This allows us to easily reconstruct kernels for any system using only a few structures. The proposed method is able to learn kinetic energy densities and total kinetic energies of molecular and periodic systems, such as H 2 , LiH, LiF and a one-dimensional chain of 8 hydrogens using data from Kohn-Sham density functional theory calculations for only a few structures. For the ease of reproduction, codes used to generate the models are provided in the supporting materials.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2020

Model independent comparison of supernova and strong lensing cosmography: Implications for the Hubble constant tension

We use supernovae measurements, calibrated by the local determination of the Hubble constant $H_0$ by SH0ES, to interpolate the distance-redshift relation using Gaussian process regression. We then predict, independent of the cosmological model, the distances that are measured with strong lensing time delays to test their mutual agreement. In this work we find excellent agreement between these predictions and the measurements. The agreement holds when we consider only the redshift dependence of the distance-redshift relation, independent of the value of $H_0$. Our results disfavor the possibility that lens mass modeling contributes a 10% bias or uncertainty in the strong lensing analysis, as suggested recently in the literature. In general our analysis strengthens the case that residual systematic errors in both measurements are below the level of the current discrepancy with the CMB determination of $H_0$, and supports the possibility of new physical phenomena on cosmological scales. With additional data our methodology can provide more stringent tests of unaccounted for systematics in the determinations of the distance-redshift relation in the late universe.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2022

J-PLUS: Support vector regression to measure stellar parameters

Stellar parameters are among the most important characteristics in studies of stars which, in traditional methods, are based on atmosphere models. However, time, cost, and brightness limits restrain the efficiency of spectral observations. The Javalambre Photometric Local Universe Survey (J-PLUS) is an observational campaign that aims to obtain photometry in 12 bands. Owing to its characteristics, J-PLUS data have become a valuable resource for studies of stars. Machine learning provides powerful tools for efficiently analyzing large data sets, such as the one from J-PLUS, and enables us to expand the research domain to stellar parameters. The main goal of this study is to construct a support vector regression (SVR) algorithm to estimate stellar parameters of the stars in the first data release of the J-PLUS observational campaign. The training data for the parameter's regressions are featured with 12-waveband photometry from J-PLUS and are crossidentified with spectrum-based catalogs. These catalogs are from the Large Sky Area Multi-Object Fiber Spectroscopic Telescope, the Apache Point Observatory Galactic Evolution Experiment, and the Sloan Extension for Galactic Understanding and Exploration. We then label them with the stellar effective temperature, the surface gravity, and the metallicity. Ten percent of the sample is held out to apply a blind test. We develop a new method, a multi-model approach, in order to fully take into account, the uncertainties of both the magnitudes and the stellar parameters. The method utilizes more than 200 models to apply the uncertainty analysis. We present a catalog of 2 493 424 stars with the root mean square error of 160 K in the effective temperature regression, 0.35 in the surface gravity regression, and 0.25 in the metallicity regression. We also discuss the advantages of this multi-model approach and compare it to other machine-learning methods.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2024

Tensor decompositions for count data that leverage stochastic and deterministic optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the maximum likelihood estimator (MLE) of the Poisson CPD model. Here, this work presents two new algorithms that extend state-of-the-art local methods for Poisson CPD. Hybrid GCP-CPAPR combines Generalized Canonical Decomposition (GCP) with stochastic optimization and CP Alternating Poisson Regression (CPAPR), a deterministic algorithm, to increase the probability of converging to the MLE over either method used alone. Restarted CPAPR with SVDrop uses a heuristic based on the singular values of the CPD model unfoldings to identify convergence toward optimizers that are not the MLE and restarts within the feasible domain of the optimization problem, thus reducing overall computational cost when using a multi-start strategy. We provide empirical evidence that indicates our approaches outperform existing methods with respect to converging to the Poisson CPD MLE.

CPAPR↗

DOE OSTI2024

Efficient Parallelization of Irregular Applications on GPU Architectures

With the enlarging computation capacity of general Graphics Processing Units (GPUs), leveraging GPUs to accelerate parallel applications has become a critical topic in academia and industry. However, a wide range of irregular applications with the computation-/memory-intensive nature cannot easily achieve high GPU utilization. The challenges mainly involve the following aspects: first, data dependence leads to coarse-grained kernel and inefficient parallelism; second, heavy GPU memory usage may cause frequent memory evictions and extra overhead of I/O; third, specific computation patterns produce memory redundancies; last, workload balance and data reusability conjunctly benefit the overall performance, but there may exist a dynamic trade-off between them. Targeting these challenges, this dissertation proposes multiple optimizations to accelerate two real-world applications: many-body correlation functions to simulate nuclear physics in a large-scale scientific system; the other is the eALS-based matrix factorization recommendation system. To accelerate the calculations of many-body correlation functions, this dissertation presents three frameworks in GPU memory management and multi-GPU scheduling. Firstly, an optimized systematic GPU memory management framework, MemHC, utilizes a series of new memory reduction designs in GPU memory allocation, CPU/GPU communications, and GPU memory oversubscription. Secondly, an enhanced multi-GPU scheduling framework, MICCO, particularly by taking both data dimension (e.g., data reuse and data eviction) and computation dimension into account. MICCO designs a heuristic scheduling algorithm and a machine learning-based regression model to generate the optimal settings of a proposed new concept to manage the trade-off. Thirdly, a locality-aware multi-GPU scheduling framework. This scheduler leverages pipeline batch generation with a looking-ahead strategy by building local dependency graphs for memory transfer reduction and better data reuse, achieving up to 79.92% memory cost reduction and 1.67x speedup. To parallelize the eALS-based recommendation system, this dissertation proposes an efficient CPU/GPU heterogeneous recommendation system, HEALS. HEALS employs newly designed architecture-adaptive data formats to achieve load balance and good data locality on CPU and GPU. To mitigate the data dependence, HEALS presents a CPU/GPU collaboration model for both task parallelism and data parallelism with multiple kernel computation optimizations. In summary, this dissertation efficiently accelerates two typical irregular applications on GPUs by building four frameworks, including CPU/GPU collaboration, GPU memory management, and multi-GPU scheduling.

Wang, Qihan↗

DOE OSTI2023

FastACE

SAND2024-01893O The Fast Adaptive Cosine Estimator (FastACE) algorithm modifies the well-known Adaptive Cosine Estimator for target detection in hyperspectral imagery. Specifically, FastACE modifies the computation of the background precision matrix (C_b^-1) under a Vecchia approximation. That is, each spectral band, conditioned on a local neighborhood of bands around that band, is independent of the other spectral bands. The FastACE algorithm leverages a parameterizable, auto-regressive neighborhood for the conditional independence assumption. The underlying math used for computing detection scores is equivalent to ACE, but it is implemented within FastACE. The software implements a target detection algorithm and associated utilities for target detection in hyperspectral imagery. Provided with a hyperspectral image and corresponding target signature, it produces relevant background statistics and the corresponding detection scores for the target signature in the image. The software is designed to integrate into other end-user applications or processing. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

VanderLaan, John↗

DOE OSTI2021

Revisit the Scalability of Deep Auto-Regressive Models for Graph Generation

As a new promising approach to graph generations, deep auto-regressive graph generation has drawn increasing attention. It however has been commonly deemed as hard to scale up to work with large graphs. In existing studies, it is perceived that the consideration of the full non-local graph dependences is indispensable for this approach to work, which entails the needs for keeping the entire graph’s info in memory and hence the perceived “inherent” scalability limitation of the approach. This paper revisits the common perception. It proposes three ways to relax the dependences and conducts a series of empirical measurements. It concludes that the perceived “inherent” scalability limitation is a misperception; with the right design and implementation, deep auto-regressive graph generation can be applied to graphs much larger than the device memory. The rectified perception removes a fundamental barrier for this approach to meet practical needs.

Yang, Shuai↗

DOE OSTI2021

Statistical learning for predicting density–matrix-based electron dynamics

In this study, we consider the problem of learning density-dependent molecular Hamiltonian matrices from time series of electron density matrices, all in the context of Hartree–Fock theory. Prior work developed a solution to this problem for small molecular systems with density and Hamiltonian matrices of size at most 6 × 6. Here, using a battery of techniques, we scale prior methods to larger molecular systems with, for example, 29 × 29 matrices. This includes systems that either have more electrons or are expressed in large basis sets such as 6-311++G**. Scaling the method to larger systems enhances its relevance for realistic applications in chemistry and physics. To achieve this scaling, we apply dimensionality reduction, ridge regression and analytic computation of Hessians. Through the combination of these techniques, we are able to learn Hamiltonians by minimizing an objective function that encodes local propagation error. Importantly, these learned Hamiltonians can then be used to predict electron dynamics for thousands of steps: When we use our learned Hamiltonians to numerically solve the time-dependent Hartree–Fock equation, we obtain predicted dynamics that are in close quantitative agreement with ground truth dynamics. This includes field-off trajectories similar to the training data and field-on trajectories outside of the training data.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2022

Machine learning pipeline to predict defect behavior in metallic alloy systems

The interaction between defect and solute atoms is critical to the thermodynamic and kinetic behavior of metallic alloys under exposure to high-energy radiation, causing irradiation damage in materials. Radiation can generate non-equilibrium concentrations of point defects such as vacancies and interstitials. The excess point defects not only accelerate diffusional processes such as precipitation that cause radiation embrittlement, but also change the pathway of phase transformations, including nucleation processes. Understanding these defect behaviors is complicated by the challenge and complexity of addressing each possible local and discrete distribution of environments and chemical interactions around targeted defects-solute or solute-solute complexes. To resolve the challenge, machine learning regression techniques have emerged as powerful tools that can train and construct an energy model to accurately describe the chemical interactions of solutes and defects. In Fiscal Year 2022, the work focused on the workflow development and demonstration using machine learning regression, density functional theory, cluster expansion, and Monte Carlo simulation to predict the effects of ternary solute elements (e.g., aluminum and molybdenum) and point defects on the Cr-rich $\alpha^{\prime}$ precipitation in multicomponent FeCr model alloys. The computational outcomes include the prediction of the ternary phase diagram, vacancy formation energy for different compositions, and the effect of vacancies on the nucleation of Cr-rich clusters. The simulations predict a pronounced change of Cr solubility in bcc Fe by the addition of Al and the rejection of Al atoms from $\alpha^{\prime}$ precipitates. Additionally, the simulations show the formation of Cr-vacancy clusters as the initial nuclei for stable nucleation and growth of $\alpha^{\prime}$ particles. The results demonstrate important outcomes and applications of using machine learning pipeline to study model or commercial alloys with multicomponent solute species and point defects.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

DOE OSTI2026

Unraveling Fundamental Activity–Stability Relationships in Rutile Oxides

The oxygen evolution reaction (OER) is a key anodic half-cell reaction that accompanies several critical electrochemical reduction reactions of interest to a variety of applications. Despite steady advances in understanding and qualitatively predicting OER activity and selectivity trends, a comprehensive description or prediction of material aqueous (in)stability and degradation mechanisms remains elusive, even though these processes critically influence device lifetime and economic feasibility. In this work, we investigate the interplay, or lack thereof, between OER activity and material aqueous stability across rutile oxides, with a particular focus on iridium oxide (IrO 2 ). By applying a Born–Haber cycle, we calculate the thermodynamic driving force for metal dissolution as a function of the applied bias and electrolyte conditions. We apply interpretable machine learning techniques, including principal component analysis and symbolic regression, to analyze trends across rutile oxides and find that key thermodynamic descriptors for OER activity and surface stability are only very weakly correlated. Instead, the local atomic environment─especially electronic structure signatures for interactions between the active site and its neighbors─plays a more important role in predicting material stability. Leveraging these insights, we investigate the impact of doping IrO 2 with a range of transition metals and show that the stability of Ir active sites can be tuned largely independently of its predicted OER activity. These insights lay the foundation for material design to improve stability with respect to corrosion, with the ultimate aim to enhance long-term stability without sacrificing catalytic performance in the OER.

evolution reactions↗

DOE OSTI2022

Supervised Learning for Distribution Secondary Systems Modeling: Improving Solar Interconnection Processes

The current interconnection process and hosting capacity analysis for distributed energy resources (DERs), such as photovoltaics (PV) and battery energy storage systems, are based on analyzing grid network constraints (voltage and thermal) using only medium-voltage distribution network models. This is because most utilities do not have secondary low-voltage system models that connect service transformers and residential customers. This is important because in many cases the main impact of interconnecting DERs could occur on the low-voltage distribution systems. This paper proposes a supervised learning method to approximate local secondary models to improve the interconnection process. The proposed supervised learning method includes a decision tree model that predicts the secondary topology and a logistic regression model that predicts conductor types. The case studies demonstrate the benefits of including secondary low-voltage circuits in the interconnection process. We report the proposed modeling methodology is readily scalable and thus can reduce the cost and effort of PV interconnection for the industry and stakeholders.

14 SOLAR ENERGY↗

DOE OSTI2021

Estimation of the Ambient Wind Field From Wind Turbine Measurements Using Gaussian Process Regression

In the search for a lower levelized cost of wind energy, one approach is to increase the accuracy of wind turbine measurements such as wind speed and wind direction. The sensors available on wind turbines are susceptible to local turbulence and measurement bias, which can result in suboptimal turbine performance. As an alternative, recent research has considered using the sensor measurements in a coordinated manner. With such a cooperative approach, the local wind conditions can be estimated more accurately and reliably without the need for additional measurement equipment. In this paper, a novel wind field estimation approach is presented that estimates the local wind conditions based on turbine measurements using Gaussian processes. We show that the estimation framework is able to improve the accuracy of the wind direction estimate both in an offline and online manner, as well as identify possible biases in the sensors and reduce unnecessary wind turbine yaw activity.

49 EE - Wind and Water Power Program - Wind (EE-4W↗

DOE OSTI2021

Development of heavy-duty vehicle representative driving cycles via decision tree regression

Previously, researchers who developed representative driving cycles mainly focused on light-duty vehicles and only considered vehicle speed and related derivations. In this paper, we propose a novel approach to develop representative cycles for heavy-duty vehicles. By implementing decision tree regression (DTR) to the Fleet DNA on-road vehicle data, a broader set of metrics, such as engine power and fuel consumption, can be used for more robust cycle development. Additionally, the influence of each metric on the regression target is also accounted for by a weighted number derived through the DTR to enhance the representativenss of the developed cycle. As case studies, we applied the proposed method to five heavy-duty vocations (drayage, long haul, regional haul, local delivery, and transit bus) and derived the most representative cycle, as well as four extreme cycles (maximal energy consumption, maximal power-weighted work, maximal fraction of high speed, and minimal fuel economy) to advance the related alternative powertrain design.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2021

AI-Batt (Autonomous Identification of Battery Life Models) [SWR 21-36]

Autonomous Identification of Battery Life Models (AI-Batt) AI-Batt is a MATLAB code base for developing lifetime models for batteries from accelerated aging data. The code base provides many functions for processing, visualizing, and modeling battery aging data, making the data processing, exploration, and modeling workflow substantially faster. These tools are tailored for working with battery aging data sets, which usually consist of many separate time-series for each cell, with many test conditions and possible replicates at each condition, which makes it difficult to simply process or visualize the data set. Complex modeling tasks, such as cross-validation, sensitivity analysis, and uncertainty quantification have been implemented to enable thorough statistical investigation of model predictions. Additionally, several machine-learning algorithms are implemented to autonomously identify suitable models via symbolic regression. Data processing functions automatically cast data from the struct data type, which is commonly used to store experimental data, but is not an acceptable input for most algorithms, to the table data type, which can be easily used as input to any optimization algorithm. Also, the data can be separated into time-invariant and time-variant data tables, which is helpful for exploring the data set as well as developing separate models for time-variant and time-invariant aging mechanisms. For example, in aging tests with constant temperature, temperature is a time-invariant experimental condition. Visualization tools enable plotting of data, model fits, and model simulations possible with single-line function calls, empowering data exploration of complex data sets with both time-varying and time-invariant trends. Plots can be automatically generated for the whole data set, or separated by data group (groups of test replicates) or individual data series. Data points or data series can be automatically colored by the value of a variable with a variety of color maps, and model predictions can also be colored by the value of a fit statistic. Comparisons between data sets and the predictions/simulations of different models on the same data set can be easily plotted as well. Distributions of parameter values from bootstrap resampling can be plotted to visualize the reliability of parameter estimation, or determine any correlations between parameters. Modeling tools handle the complex task of creating and parsing symbolic equations for modeling battery lifetime. Equations are parsed to grab relevant data variables, parameter values, or specified sub-models for input into optimization, evaluation, or simulation functions. Models can be optimized locally (one set of parameters for each data series), bi-level (some parameters shared across the data set), or globally (single set of parameters for all data). Functions implementing symbolic regression algorithms help users to discover effective model equations, even in poorly sampled, high-dimensional data.

Smith, Kandler↗

DOE OSTI2022

Time-series forecasting using manifold learning, radial basis function interpolation, and geometric harmonics

We address a three-tier numerical framework based on nonlinear manifold learning for the forecasting of high-dimensional time series, relaxing the “curse of dimensionality” related to the training phase of surrogate/machine learning models. At the first step, we embed the high-dimensional time series into a reduced low-dimensional space using nonlinear manifold learning (local linear embedding and parsimonious diffusion maps). Then, we construct reduced-order surrogate models on the manifold (here, for our illustrations, we used multivariate autoregressive and Gaussian process regression models) to forecast the embedded dynamics. Finally, we solve the pre-image problem, thus lifting the embedded time series back to the original high-dimensional space using radial basis function interpolation and geometric harmonics. The proposed numerical data-driven scheme can also be applied as a reduced-order model procedure for the numerical solution/propagation of the (transient) dynamics of partial differential equations (PDEs). In conclusion, we assess the performance of the proposed scheme via three different families of problems: (a) the forecasting of synthetic time series generated by three simplistic linear and weakly nonlinear stochastic models resembling electroencephalography signals, (b) the prediction/propagation of the solution profiles of a linear parabolic PDE and the Brusselator model (a set of two nonlinear parabolic PDEs), and (c) the forecasting of a real-world data set containing daily time series of ten key foreign exchange rates spanning the time period 3 September 2001–29 October 2020.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2022

Bundle Networks: Fiber Bundles, Local Trivializations, and a Generative Approach to Exploring Many-to-one Maps

Many-to-one maps are ubiquitous in machine learning, from the image recognition model that assigns a multitude of distinct images to the concept of ``cat'' to the time series forecasting model which assigns a range of distinct time-series to a single scalar regression value. While the primary use of such models is naturally to associate correct output to each input, in many problems it is also useful to be able to explore, understand, and sample from a model's fibers, which are the set of input values x such that f(x) = y, for fixed y in the output space. In this paper we show that popular generative architectures are ill-suited to such tasks. Motivated by this we introduce a novel generative architecture, a Bundle Network, based on the concept of a fiber bundle from (differential) topology. BundleNets exploit the idea of a local trivialization wherein a space can be locally decomposed into a product space that cleanly encodes the many-to-one nature of the map. By enforcing this decomposition in BundleNets and by utilizing state-of-the-art invertible components, investigating a network's fibers becomes natural.

Courts, Nicolas C.↗

DOE OSTI2025

Machine learning-enabled multiscale modeling of mechanical deformation of aluminum and Al-SiC nanocomposites

A machine learning-enabled multiscale framework is developed for modeling the mechanical response of both pure metal and nanoparticle-reinforced metal matrix nanocomposites (MMNCs). Using aluminum–silicon carbide (Al-SiC) as an example MMNC, atomistic simulations reveal three distinct deformation mechanisms (i.e., defect-free, dislocation-based, and interface separation) governed by the interfaces between the Al matrix and SiC nanoparticles. As compared with single crystal Al, the lattice undergoes a more abrupt failure once the dislocation network becomes extensive and void nucleation initiates, whereas in Al-SiC, nanoparticle interfaces enable a more gradual progression of damage. These mechanisms are captured through a combined classification-regression neural network surrogate model that bridges atomic-scale insights with continuum-scale finite element analysis. Machine learning-enabled multiscale modeling of pure Al accurately predicted strain localization and confirmed by in-situ scanning electron microscopic tensile testing on perforated Al specimens. This study underscores the promise of integrating physics-informed machine learning with hierarchical modeling to capture the interface dominated phenomena and guide the design of advanced MMNCs.

Al-SiC↗