Search NASA⌕ Search

SEARCH · Search NASA

Results for “Learning Algorithm”

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 OSTI2016

Communication-Avoiding Parallel Sparse-Dense Matrix-Matrix Multiplication

Multiplication of a sparse matrix with a dense matrix is a building block of an increasing number of applications in many areas such as machine learning and graph algorithms. However, most previous work on parallel matrix multiplication considered only both dense or both sparse matrix operands. This paper analyzes the communication lower bounds and compares the communication costs of various classic parallel algorithms in the context of sparse-dense matrix-matrix multiplication. We also present new communication-avoiding algorithms based on a 1D decomposition, called 1.5D, which - while suboptimal in dense-dense and sparse-sparse cases - outperform the 2D and 3D variants both theoretically and in practice for sparse-dense multiplication. Our analysis separates one-time costs from per iteration costs in an iterative machine learning context. Experiments demonstrate speedups up to 100x over a baseline 3D SUMMA implementation and show parallel scaling over 10 thousand cores.

Koanantakool, Penporn↗
DOE OSTI2021

Value of Information and Data Management Platform Promoting Modern Data Analysis Utilization. STTR Phase I, Final Technical Report

The immense growth in weather and river sensor data availability along with increases in computational power and algorithmic sophistication have enabled the widespread application of physical, machine learning, and artificial intelligence algorithms to river forecasting. The forecasts produced by widely varying model approaches are inherently limited in different ways, such as by the number and quality of training observations, producing biased predictions that achieve optimal skill only over specific ranges of weather and river conditions. Thus, despite the growing availability and new sources of forecasts, hydropower owners cannot fully leverage the information because they lack an effective mechanism to determine the “best” forecast for given conditions or objectives. Tools are needed to consolidate forecast information, demonstrate skill, and extract optimal forecast guidance from the range of possibilities. Such tools will increase uptake and beneficial use of the growing wealth of forecast information, and lead to improved operating decisions, optimal power generation, and enhanced system value. This research proposes to improve the value of forecasts by developing a broadly accessible verification framework and applying machine learning techniques to identify the ‘best’ forecast from an ensemble of sources given the current weather, river, and operating conditions.

13 HYDRO ENERGY↗
DOE OSTI2026

RADAI: A Large-Scale Realistic Dataset for Radiation Detection Algorithm Development

Open, realistic datasets are essential for developing and benchmarking radiation detection algorithms, yet they remain scarce. The Radiological Anomaly Detection and Identification (RADAI) project was develop to create datasets that meet the training and testing needs for sophisticated radiation detection algorithms. The RADAI dataset is a large-scale synthetic resource that integrates high-fidelity Monte Carlo simulations with realistic urban scenarios to capture both background variability and source signatures. RADAI models construction-material NORM, people and vehicles, urban clutter, and dynamic environmental effects such as cosmic-ray and rain-induced transients, and they provide list-mode detector data with motion and response modeling suitable for algorithm training and evaluation. The RADAI project resulted in three publicly-released complementary datasets together with an online scoring portal for standardized performance assessment and an open software toolkit that supports data access, augmentation, model development, and evaluation. These resources enable reproducible comparisons across methods and promote rigorous studies at the scale required by contemporary machine learning. By grounding algorithm development in realistic, well-documented conditions, RADAI supports progress toward more robust detection, identification, and localization in complex urban environments.

Ghawaly, James M. [Division of Computer Science an↗
DOE OSTI2023

Reinforcement-Learning-Based Smart Water Heater Control: An Actual Deployment

Utilizing smart control algorithms for electric water heaters (EWHs) is essential for fully harnessing the demand response (DR) potential of EWHs. For this reason, the use of reinforcement learning (RL) algorithms for EWHs has received increasing attention in recent years. However, existing RL approaches are either simulation-based or use pretrained RL agents. To this end, this paper presents the real-world deployment of a set of model-free RL approaches that aim to minimize the electricity cost of a EWH under a time-of-use electricity pricing policy using standard DR commands (e.g., shed, load up). The experiment results showed that the RL agents can help save electricity cost in the range of 11% to 14% compared to the baseline operation. This study demonstrated that RL-based EWH controllers can be deployed in real world without any prior training and can still save electricity cost.

deep learning↗
DOE OSTI2023

HD-Bind: Encoding of Molecular Structure with Low Precision, Hyperdimensional Binary Representations

Publicly available collections of drug-like molecules have grown to comprise tens of billions of compounds due to advances in combinatorial chemistry. Traditional methods for identifying "hit" molecules from a large collection of potential drug-like candidates have relied on biophysical theory to compute approximations to the Gibbs free energy of the binding interaction between the drug and its protein target. These approaches have the major drawback that they require exceptional computing capabilities for even relatively small collections of molecules. Hyperdimensional Computing (HDC) is a recently-proposed learning paradigm that represents data with high-dimension binary vectors; this allows the use of low-precision binary vector arithmetic to create models of the data that can be learned without the need for the gradient-based optimization required in many conventional machine learning and deep learning methods. This algorithmic simplicity allows for acceleration in hardware that has been previously demonstrated in a range of application areas. We consider existing HDC approaches for molecular property classification and introduce two novel encodings of a commonly-used molecular representation, the extended connectivity fingerprint (ECFP). We show that HDC-based inference methods are as much as 91 times more efficient than traditional machine learning methods, and achieve an acceleration of nearly nine orders of magnitude compared to molecular docking. Our results show that HDC accelerated methods retain competitive accuracy on a number of well-studied tasks such as molecular property predictions using the MoleculeNet dataset, and bind/no-bind activity classification using the DUD-E and LIT-PCBA datasets. Our work thus motivates further investigation into molecular representation learning to develop ultraefficient pre-screening tools.

Jones, William↗
DOE OSTI2018

Using Deep Machine Learning to Conduct Object-Based Identification and Motion Detection on Safeguards Video Surveillance

Video surveillance is one of the core monitoring technologies used by the International Atomic Energy Agency (IAEA) Department of Safeguards at safeguarded nuclear facilities worldwide. Current IAEA image-review software has functions for scene-change detection, black image detection and missing scene analysis, but their capabilities are not optimum. The current workflow for the detection of safeguards relevant events heavily depends on inspectors’ laborious visual examination of surveillance videos, which is a time-consuming process and prone to errors. To improve the accuracy of the process and reduce inspectors’ burden, the paper proposes using deep machine learning to detect objects of interest in video streams and to conduct object-based motion detection. The hypothesis of this work is that deep machine learning will reduce the burden on inspectors and reduce errors by automatically locating and identifying objects of interest in video streams. Objects of interest include casks and fuel assemblies that are typically monitored by inspectors. The algorithm being developed in this work is based on a computationally efficient deep machine learning algorithm – You Only Look Once (YOLO) – but is further devised to address specific challenges related to the operation of nuclear facilities. The developed model (which is called YOLO-NSG – YOLO for Nuclear Safeguards) is evaluated with data sets collected at the test facilities at Brookhaven National Laboratory (BNL) and Sandia National Laboratories (SNL). The initial focus of the research is for application at safeguarded nuclear reactors, such as pressurized heavy-water reactors, where video surveillance is broadly deployed, but can be extended to other use cases of nuclear safeguards. The detailed structure of YOLO-NSG model is introduced and the test results are reported in the paper.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Pairing a Global Optimization Algorithm with EXAFS to Characterize Lanthanide Structure in Solution

Ensemble-average sampling of structures from ab initio molecular dynamics (AIMD) simulations can be used to predict theoretical extended X-ray absorption fine structure (EXAFS) signals that closely match experimental spectra. However, AIMD simulations are time-consuming and resource-intensive, particularly for solvated lanthanide ions, which often form multiple nonrigid geometries with high coordination numbers. Here, to accelerate the characterization of lanthanide structures in solution, we employed the Northwest Potential Energy Surface Search Engine (NWPEsSe), an adaptive-learning global optimization algorithm, to efficiently screen first-shell structures. As case studies, we examine two systems: Eu(NO 3 ) 3 dissolved in acetonitrile with a terpyridine ligand (terpyNO 2 ), and Nd(NO 3 ) 3 dissolved in acetonitrile. The theoretical spectra for structures identified by NWPEsSe were compared to both experimental and AIMD-derived EXAFS spectra. The NWPEsSe algorithm successfully identified the proper solvation structure for both Eu(NO 3 ) 3 (terpyNO 2 ) and Nd(NO 3 )(acetonitrile) 3 , with the calculated EXAFS signals closely matching the experimental spectra for the Eu-ligand complex and showing good similarity for the Nd salt; the better agreement with the ligand-containing structure is attributed to a less dynamic coordination environment due to the rigid ligand. The key advantage of the global optimization algorithm lies in its ability to sample the coordination environment across the potential energy surface and reduce the time required to identify structures from generally a month to within a week. Additionally, this approach is versatile and can be adapted to characterize main-group metal complexes.

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

Adaptive Sequential Monte Carlo for Multiple Changepoint Analysis

Process monitoring and control requires detection of structural changes in a data stream in real time. This paper introduces an efficient sequential Monte Carlo algorithm designed for learning unknown changepoints in continuous time. The method is intuitively simple: new changepoints for the latest window of data are proposed by conditioning only on data observed since the most recent estimated changepoint, as these observations carry most of the information about the current state of the process. The proposed method shows improved performance over the current state of the art. Another advantage of the proposed algorithm is that it can be made adaptive, varying the number of particles according to the apparent local complexity of the target changepoint probability distribution. This saves valuable computing time when changes in the changepoint distribution are negligible, and enables re-balancing of the importance weights of existing particles when a significant change in the target distribution is encountered. The plain and adaptive versions of the method are illustrated using the canonical continuous time changepoint problem of inferring the intensity of an inhomogeneous Poisson process, although the method is generally applicable to any changepoint problem. Performance is demonstrated using both conjugate and non-conjugate Bayesian models for the intensity. Lastly, appendices to the article are available online, illustrating the method on other models and applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

GraMeR: Gra ph Me ta R einforcement learning for multi-objective influence maximization

Influence maximization (IM) is a combinatorial problem of identifying a subset of seed nodes in a network (graph), which when activated, provide a maximal spread of influence in the network for a given diffusion model and a budget for seed set size. IM has numerous applications such as viral marketing, epidemic control, sensor placement and other network-related tasks. However, its practical uses are limited due to the computational complexity of current algorithms. Recently, deep reinforcement learning has been leveraged to solve IM in order to ease the computational burden. However, there are serious limitations in current approaches, including narrow IM formulation that only consider influence via spread and ignore self-activation, low scalability to large graphs, and lack of generalizability across graph families leading to a large running time for every test network. In this work, we address these limitations through a unique approach that involves: (1) Formulating a generic IM problem as a Markov decision process that handles both intrinsic and influence activations; (2)incorporating generalizability via meta-learning across graph families. There are previous works that combine deep reinforcement learning with graph neural network, but this work solves a more realistic IM problem and incorporates generalizability across graphs via meta reinforcement learning. Extensive experiments are carried out in various standard networks to validate performance of the proposed Graph Meta Reinforcement learning (GraMeR) framework. Finally, the results indicate that GraMeR is multiple orders faster and generic than conventional approaches when applied on small to medium scale graphs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Towards Automatic and Agile AI/ML Accelerator Design with End-to-End Synthesis

Domain-specific designs offer greater energy efficiency and performance gain than general-purpose processors. For this reason, modern system-on-chips have a significant portion of their silicon area with custom accelerators. However, designing hardware by hand is laborious and time-consuming, given the large design space and the performance, power, and area constraints that are not realized in the software. Moreover, domain-specific algorithms (e.g., machine learning models) are evolving quickly, challenging the accelerator design further. To address these issues, this paper presents SODA Synthesizer, an automated open-source high-level ML framework to Verilog modular compiler targeting AI/ML Application-Specific Integrated Circuits (ASICs) accelerators. SODA tightly couples the Multi- Level Intermediate Representation (MLIR) compiler infrastructure [24] and open-source HLS approaches. Thus, SODA can support various ML frameworks and algorithms and can perform optimizations that combine specialized architecture templates and conventional HLS to generate the hardware modules. In addition, SODA’s closed-loop design space exploration (DSE) engine allows developers to perform end-to-end design space explorations on different metrics and technology nodes.

Zhang, Jeff↗
DOE OSTI2022

Safety-assured, real-time neural active fault management for resilient microgrids integration

Federated-learning-based active fault management (AFM) is devised to achieve real-time safety assurance for microgrids and the main grid during faults. AFM was originally formulated as a distributed optimization problem. Here, federated learning is used to train each microgrid's network with training data achieved from distributed optimization. The main contribution of this work is to replace the optimization-based AFM control algorithm with a learning-based AFM control algorithm. The replacement transfers computation from online to offline. With this replacement, the control algorithm can meet real-time requirements for a system with dozens of microgrids. By contrast, distributed-optimization-based fault management can output reference values fast enough for a system with several microgrids. More microgrids, however, lead to more computation time with optimization-based method. Distributed-optimization-based fault management would fail real-time requirements for a system with dozens of microgrids. Controller hardware-in-the-loop real-time simulations demonstrate that learning-based AFM can output reference values within 10 ms irrespective of the number of microgrids.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Dark Energy Survey Deep Field photometric redshift performance and training incompleteness assessment

Context. The determination of accurate photometric redshifts (photo-zs) in large imaging galaxy surveys is key for cosmological studies. One of the most common approaches are machine learning techniques. These methods require a spectroscopic or reference sample to train the algorithms. Attention has to be paid to the quality and properties of these samples since they are key factors in the estimation of reliable photo-zs. Aims. The goal of this work is to calculate the photo-zs for the Y3 DES Deep Fields catalogue using the DNF machine learning algorithm. Moreover, we want to develop techniques to assess the incompleteness of the training sample and metrics to study how incompleteness affects the quality of photometric redshifts. Finally, we are interested in comparing the performance obtained with respect to the EAzY template fitting approach on Y3 DES Deep Fields catalogue. Methods. We have emulated -- at brighter magnitude -- the training incompleteness with a spectroscopic sample whose redshifts are known to have a measurable view of the problem. We have used a principal component analysis to graphically assess incompleteness and to relate it with the performance parameters provided by DNF. Finally, we have applied the results about the incompleteness to the photo-z computation on Y3 DES Deep Fields with DNF and estimated its performance. Results. The photo-zs for the galaxies on DES Deep Fields have been computed with the DNF algorithm and added to the Y3 DES Deep Fields catalogue. They are available at https://des.ncsa.illinois.edu/releases/y3a2/Y3deepfields. Some techniques have been developed to evaluate the performance in the absence of "true" redshift and to assess completeness. We have studied... (Partial abstract)

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2014

TU-F-17A-01: BEST IN PHYSICS (JOINT IMAGING-THERAPY) - An Automatic Toolkit for Efficient and Robust Analysis of 4D Respiratory Motion

Purpose: To provide an automatic image analysis toolkit to process thoracic 4-dimensional computed tomography (4DCT) and extract patient-specific motion information to facilitate investigational or clinical use of 4DCT. Methods: We developed an automatic toolkit in MATLAB to overcome the extra workload from the time dimension in 4DCT. This toolkit employs image/signal processing, computer vision, and machine learning methods to visualize, segment, register, and characterize lung 4DCT automatically or interactively. A fully-automated 3D lung segmentation algorithm was designed and 4D lung segmentation was achieved in batch mode. Voxel counting was used to calculate volume variations of the torso, lung and its air component, and local volume changes at the diaphragm and chest wall to characterize breathing pattern. Segmented lung volumes in 12 patients are compared with those from a treatment planning system (TPS). Voxel conversion was introduced from CT# to other physical parameters, such as gravity-induced pressure, to create a secondary 4D image. A demon algorithm was applied in deformable image registration and motion trajectories were extracted automatically. Calculated motion parameters were plotted with various templates. Machine learning algorithms, such as Naive Bayes and random forests, were implemented to study respiratory motion. This toolkit is complementary to and will be integrated with the Computational Environment for Radiotherapy Research (CERR). Results: The automatic 4D image/data processing toolkit provides a platform for analysis of 4D images and datasets. It processes 4D data automatically in batch mode and provides interactive visual verification for manual adjustments. The discrepancy in lung volume calculation between this and the TPS is <±2% and the time saving is by 1–2 orders of magnitude. Conclusion: A framework of 4D toolkit has been developed to analyze thoracic 4DCT automatically or interactively, facilitating both investigational and clinical use. More software tools are under development for automatic analysis of other 4D imaging modalities. This research is in part supported by NIH (U54CA137788/132378) and City Seed FY13(Grant No. 93348-14 01). AY would like to thank MSKCC summer medical student research program supported by National Cancer Institute and hosted by Department of Medical Physics at MSKCC.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2016

TH-CD-206-05: Machine-Learning Based Segmentation of Organs at Risks for Head and Neck Radiotherapy Planning

Purpose: Accurate and efficient delineation of tumor target and organs-at-risks is essential for the success of radiotherapy. In reality, despite of decades of intense research efforts, auto-segmentation has not yet become clinical practice. In this study, we present, for the first time, a deep learning-based classification algorithm for autonomous segmentation in head and neck (HaN) treatment planning. Methods: Fifteen HN datasets of CT, MR and PET images with manual annotation of organs-at-risk (OARs) including spinal cord, brainstem, optic nerves, chiasm, eyes, mandible, tongue, parotid glands were collected and saved in a library of plans. We also have ten super-resolution MR images of the tongue area, where the genioglossus and inferior longitudinalis tongue muscles are defined as organs of interest. We applied the concepts of random forest- and deep learning-based object classification for automated image annotation with the aim of using machine learning to facilitate head and neck radiotherapy planning process. In this new paradigm of segmentation, random forests were used for landmark-assisted segmentation of super-resolution MR images. Alternatively to auto-segmentation with random forest-based landmark detection, deep convolutional neural networks were developed for voxel-wise segmentation of OARs in single and multi-modal images. The network consisted of three pairs of convolution and pooing layer, one RuLU layer and a softmax layer. Results: We present a comprehensive study on using machine learning concepts for auto-segmentation of OARs and tongue muscles for the HaN radiotherapy planning. An accuracy of 81.8% in terms of Dice coefficient was achieved for segmentation of genioglossus and inferior longitudinalis tongue muscles. Preliminary results of OARs regimentation also indicate that deep-learning afforded an unprecedented opportunities to improve the accuracy and robustness of radiotherapy planning. Conclusion: A novel machine learning framework has been developed for image annotation and structure segmentation. Our results indicate the great potential of deep learning in radiotherapy treatment planning.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2024

Short-Term Probabilistic Solar Forecasting via Reinforcement Learning over ECMWF

In this paper, we present an innovative reinforcement learning approach for short-term solar forecasting, leveraging data from the European Centre for Medium-Range Weather Forecasts (ECMWF). The methodology begins with the application of the System Advisor Model (SAM) to transform various ECMWF numerical weather prediction members into predictive photovoltaic power generation. To enhance the precision of deterministic forecasting, we introduce a dynamic model selection algorithm based on Q-learning. This algorithm dynamically identifies and utilizes the most accurate ensemble member for forecasting purposes. Furthermore, we employ a support vector regression surrogate model with a Gaussian distribution to generate probabilistic forecasts, providing a holistic view of solar energy generation uncertainty. To expedite the training process and make it more practical for real-world applications, we integrate a rolling update workflow. This innovative workflow reduces the training period from months to a mere 19 days, making our method highly efficient. Numerical results of the case study show that in comparison to benchmark models, the proposed method improves the deterministic and probabilistic solar forecasting accuracy by up to 40.84% and 48.42%, respectively.

ensemble forecasting↗
DOE OSTI2025

Kinetic Deep Learning v0.1

Here, we present a method that uses protein levels to predict times series of metabolite concentrations. Understanding this type of pathway dynamics is important in order to predict the behavior of the pathway and, more pragmatically, to be able to design biological systems (such as strains bioengineered to produce chemical products) reliably. Typically, for this purpose, kinetic models consisting of differential equations based on the Michaelis-Menten dynamics have been used in the past. However, these methods can rarely produce good fits to measured data time series. Possibly, this happens because the kinetic constants are unknown or are different from the ones measured in vivo, or perhaps because Michaelis-Menten dynamics is not a satisfactory description. In order to improve the predictive nature of these kinetic models we have eliminated the Michaelis-Menten description of pathway dynamics and we have substituted it by algorithms that automatically learn these dynamics from previously obtained metabolomics and proteomics data using machine learning approaches. Specifically, kinetic deep learning uses deep learning to map proteomics time series to metabolite concentration time series, instead of learning the first metabolite derivative and integrating in (as in the first version of kinetic learning). This approach is shown to provide good to excellent results with a data set specifically collected for this purpose.

Garcia Martin, Hector [Joint BioEnergy Institute (↗
DOE OSTI2024

Machine learning-guided discovery of polymer membranes for CO 2 separation with genetic algorithm

Designing polymer membranes with high gas permeability and selectivity is a difficult multi-task constrained problem due to the trade-off between these two properties. In this work, we present a machine learning (ML) driven genetic algorithm to tackle the design problem of polymer membranes for CO 2 separation from N 2 and O 2 . Using literature data of permeability for three gases, we constructed multiple ML models with different fingerprinting featurization schemes to predict gas permeabilities. Then, we employed a genetic algorithm to design new polymers and evaluated their performance using our ML models. We were able to identify new polymer membranes that are promising for both CO 2 /N 2 and CO 2 /O 2 separations. Further, the top discovered polymers are predicted to have high glass transition temperatures. Similarly, the pyridine functionality was found in ≈20% of the predicted polymers. This framework can be used to design polymers for any application involving constrained optimization. Finally, we outlined the challenges and opportunities with using ML guided data-driven inverse design of polymers.

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

Composable optimization and control toolkit for scientific applications

Applications of Artificial Intelligence (AI) and Machine Learning (ML) can improve the computational efficiency and scientific research output. In order to improve interoperability and reuse of AI/ML software, a composable approach is required. This talk presents a composable approach for scientific workflow development that allows seamless integration of various modules developed by independent researchers. These practices will reduce redundant software development by allowing re-use of workflow modules across projects, teams, departments and facilities. We will present three use cases that follow the composable approach namely, Scientific Optimization and Control Toolkit (SOCT), SciDAC QuantOm workflow, and JLab Nuclear Physics experimental workflows. This talk will dive deeper into SOCT and present the details of the composable code development for optimization and control algorithms using reinforcement learning.

Rajput, Kishansingh↗