Search NASA⌕ Search

SEARCH · Search NASA

Results for “multiple instance 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 73 records · Page 4

Correlated Trajectory Uncertainty for Adaptive Sequential Decision Making

One of the great challenges with decision making tasks on real world systems is the fact that data is sparse and acquiring additional data is expensive. In these cases, it is often crucial to make a model of the environment to assist in making decisions. At the same time, limited data means that learned models are erroneous, making it just as important to equip the model with good predictive uncertainties. In the context of learning sequential decision making policies, these uncertainties can prove useful for informing which data to collect for the greatest improvement in policy performance \citep{mehta2021experimental, mehta2022exploration} or informing the policy about unsure regions of state and action space to avoid during test time \citep{yu2020mopo}. Additionally, assuming that realistic samples of the environment can be drawn, an adaptable policy can be trained that attempts to make optimal decisions for any given possible instance of the environment \citep{ghosh2022offline, chen2021offline}. In this work, we examine the so-called ``probabilistic neural network'' (PNN) model that is ubiquitous in model-based reinforcement learning (MBRL) works. We argue that while PNN models may have good marginal uncertainties, they form a distribution of non-smooth transition functions. Not only are these samples unrealistic and may hamper adaptability, but we also assert that this leads to poor uncertainty estimates when predicting multiple step trajectory estimates. To address this issue, we propose a simple sampling method that can be implemented on top of pre-existing models.We evaluate our sampling technique on a number of environments, including a realistic nuclear fusion task, and find that, not only do smooth transition function samples produce more calibrated uncertainties, but they also lead to better downstream performance for an adaptive policy.

Offline Reinforcement Learning↗

A deep learning model for automatic analysis of cavities in irradiated materials

Transmission electron microscopy (TEM) is a commonly used technique in materials science for defect investigation. Quantitative analysis of defects is important for understanding the properties of a material, but manual analysis of TEM micrographs can be time-consuming and prone to error, especially when the defects have irregular shapes rather than spherical shapes. Many existing methods or deep learning models do not handle a wide range of sizes for the same object type within a single image. In this work, we present a framework that enables users to train an instance segmentation model called Mask R- CNN on any microstructure dataset, perform multi-detection on the same image at different scales, and obtain properties (e.g., size, area) of the objects based on the desired shape (e.g., circle, ellipse, rectangle). Additionally, we have developed a parallel detection module that uses multiple GPUs to increase the efficiency of the object detection process. We demonstrate the capabilities of our framework using a set of TEM images of cavities with different shapes, size distributions, and background contrasts. Finally, we show that the performance of our model in terms of density, size, and swelling of the cavities is comparable to the human average and that our model achieves the highest recall value compared to existing methods due to the use of image multi-rescaling.

36 MATERIALS SCIENCE↗

Semi-automatic image annotation using 3D LiDAR projections and depth camera data

Efficient image annotation is necessary to utilize deep learning object recognition neural networks in nuclear safeguards, such as for the detection and localization of target objects like nuclear material containers (NMCs). This capability can help automate the inventory accounting of different types of NMCs within nuclear storage facilities. The conventional manual annotation process is labor-intensive and time-consuming, hindering the rapid deployment of deep learning models for NMC identifications. This paper introduces a novel semi-automatic method for annotating 2D images of nuclear material containers (NMCs) by combining 3D light detection and ranging (LiDAR) data with color and depth camera images collected from a handheld scan system. The annotation pipeline involves an operator manually marking new target objects on a LiDAR-generated map, and projecting these 3D locations to images, thereby automatically creating annotations from the projections. The semi-automatic approach significantly reduces manual efforts and the expertise in image annotation that is required to perform the task, allowing deep learning models to be trained on-site within a few hours. The paper compares the performance of models trained on datasets annotated through various methods, including semi-automatic, manual, and commercial annotation services. The evaluation demonstrates that the semi-automatic annotation method achieves comparable or superior results, with a mean average precision (mAP) above 0.9, showcasing its efficiency in training object recognition models. Additionally, the paper explores the application of the proposed method to instance segmentation, achieving promising results in detecting multiple types of NMCs in various formations.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

Investigation of the Performance and Explainability Tradeoffs for Machine-Learning Models for Predictive Maintenance of Circulating Water Systems in Nuclear Power Plants

Predictive maintenance (PdM) has shown great potential for achieving substantial cost savings and enhancing the economic competitiveness of nuclear power plants (NPPs) in today's energy market. Among the different modeling approaches that exist, machine learning (ML) tools in particular have a demonstrated ability to handle high dimensional and multivariate data and to extract hidden relationships within data in industrial environments. While ML methods show great potential, their lack of explainability---especially for black-box models---is a major hurdle to their adoption. Moreover, considering the supposed trade-off between explainability and performance challenges, careful consideration must be made as to which of these quality aspects takes precedence in light of multiple modeling options, resource availability, and domain characteristics. The present work evaluates the performance of six ML models, each with a different degree of explainability, in classifying the conditions of circulating water pumps (CWPs) by utilizing sensor data from nuclear power plants. To determine the drivers behind the trade-offs presented by this array of models, this work also tests different combinations of CWP units as the training and testing data, degrees of data imbalance, and objective functions for hyperparameter tuning. It was found that black-box models tend to afford superior performance in cases where there are far more instances of one type of labeled data than of any other type. It is recommended that a guided procedure be followed for designing and delivering an ML system that is sufficiently explainable to all involved stakeholders.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗

Time-series machine-learning error models for approximate solutions to parameterized dynamical systems

This work proposes a machine-learning framework for modeling the error incurred by approximate solutions to parameterized dynamical systems. In particular, we extend the machine-learning error models (MLEM) framework proposed in Ref. Freno and Carlberg (2019) to dynamical systems. The proposed Time-Series Machine-Learning Error Modeling (T-MLEM) method constructs a regression model that maps features – which comprise error indicators that are derived from standard a posteriori error-quantification techniques – to a random variable for the approximate-solution error at each time instance. The proposed framework considers a wide range of candidate features, regression methods, and additive noise models. We consider primarily recursive regression techniques developed for time-series modeling, including both classical time-series models (e.g., autoregressive models) and recurrent neural networks (RNNs), but also analyze standard non-recursive regression techniques (e.g., feed-forward neural networks) for comparative purposes. Finally, numerical experiments conducted on multiple benchmark problems illustrate that the long short-term memory (LSTM) neural network, which is a type of RNN, outperforms other methods and yields substantial improvements in error predictions over traditional approaches.

42 ENGINEERING↗

Learning Sequences of Actions in Collectives of Autonomous Agents

In this paper we focus on the problem of designing a collective of autonomous agents that individually learn sequences of actions such that the resultant sequence of joint actions achieves a predetermined global objective. We are particularly interested in instances of this problem where centralized control is either impossible or impractical. For single agent systems in similar domains, machine learning methods (e.g., reinforcement learners) have been successfully used. However, applying such solutions directly to multi-agent systems often proves problematic, as agents may work at cross-purposes, or have difficulty in evaluating their contribution to achievement of the global objective, or both. Accordingly, the crucial design step in multiagent systems centers on determining the private objectives of each agent so that as the agents strive for those objectives, the system reaches a good global solution. In this work we consider a version of this problem involving multiple autonomous agents in a grid world. We use concepts from collective intelligence to design goals for the agents that are 'aligned' with the global goal, and are 'learnable' in that agents can readily see how their behavior affects their utility. We show that reinforcement learning agents using those goals outperform both 'natural' extensions of single agent algorithms and global reinforcement, learning solutions based on 'team games'.

Turner, Kagan↗

Development of formalisms based on locally coupled open subsystems for calculations in molecular electronic structure and dynamics

Quantum embedding theories model a collection of interacting molecules as a set of subsystems, where each can be treated with a particular electronic structure method (wave function or density functional theory, for example); these theories can lead to computationally efficient and accurate algorithms. Motivated by challenges in the field, we previously described a formalism (that models two subsystems), which we call “locally coupled open subsystems” (LCOS), for the computation of ground-state energies, fractional electron-occupation numbers of the subsystems, and the size-consistent limit of subsystem dissociation. In this work we present the full (nonrelativistic) LCOS theory and the following extensions of our previous work: (i) the framework to study systems composed of multiple subsystems and a procedure to spin-adapt the auxiliary wave function that describes the partitioned system, so that its spin state matches that of the real system of interest; (ii) potential functionals and ideas to employ machine learning for the computation of ground-state densities and energies; (iii) formulation of two LCOS ground-state approaches where the fragments are assigned Kohn-Sham wave functions; and (iv) a time-dependent (TD) extension of these two ground-state formalisms in which the state of the subsystems evolves according to a unitary propagation; from this evolution we can extract TD electron populations of the fragments, for instance. We also discuss potential applications of the TD LCOS theory to linear photoabsorption and Raman spectroscopy. As a result, the developments presented in this work can lead to ground-state and TD electronic structure calculations where the computational scaling can be controlled, depending on the level of theory and the accuracy desired to model each one of the subsystems and their coupling.

74 ATOMIC AND MOLECULAR PHYSICS↗

The ReSWARM microgravity flight experiments: Planning, control, and model estimation for on‐orbit close proximity operations

Abstract On‐orbit close proximity operations involve robotic spacecraft maneuvering and making decisions for a growing number of mission scenarios demanding autonomy, including on‐orbit assembly, repair, and astronaut assistance. Of these scenarios, on‐orbit assembly is an enabling technology that will allow large space structures to be built in situ, using smaller building block modules. However, like many of these scenarios, robotic on‐orbit assembly involves several technical hurdles, such as changing system models. For instance, grappled modules moved by a free‐flying “assembler” robot can cause significant changes in the combined system inertia, which have cascading impacts on motion planning and control portions of the autonomy stack. Further, on‐orbit assembly and other scenarios require collision‐avoiding motion planning, particularly when operating in a “construction site” scenario of multiple assembler robots and structures. Multiple key technologies that address these complicating factors for autonomous microgravity close proximity operations are detailed in this work, in particular: (1) application of global long‐horizon planning, accomplished using offline and online sampling‐based planner options that consider the system dynamics; (2) adaptation of the recently proposed RATTLE information‐aware planning framework for on‐orbit reconfiguration model learning; and (3) connection with robust control tools to provide low‐level control robustness using current system knowledge. These approaches were demonstrated for an autonomous on‐orbit assembly use case by the RElative Satellite sWarming and Robotic Maneuvering (ReSWARM) experiments using NASA's Astrobee robots on the International Space Station. Results of the ReSWARM experiments are provided along with significant operational and implementation detail discussing the practicalities of hardware implementation and unique aspects of working with the Astrobee free‐flyer robots in microgravity. ReSWARM provides a base set of planning and control tools for robotic close proximity operations, demonstrates them in microgravity, and outlines some of the important hardware aspects that future autonomous free‐flyers will need to consider.

Robotics↗

ReLIC: Full-Scale Realization of Reinforcement Learning for Infrastructure Control

Prior efforts have shown that deep reinforcement learning (DRL) may provide a new method for controlling networked power systems. Though successful, prior approaches have not yet demonstrated their behavior on systems of realistic scale. This effort examined multiple theoretical and technical approaches to allow a DRL model to operate over a system of 2,000 buses or more. We find that allowing the DRL models to run training episodes in parallel provides near limitless efficiency gains, allowing us to train successful agents to behave on our Kuramoto transmission model of up to 4,000 buses. We further show that we can expand our PowerWorld DRL implementation to systems of up to 25 buses but struggle to go beyond this limit due to PowerWorld’s inability to run multiple instances at once. Finally, we examine a multi-agent approach and find that it performs as well if not better than our existing centralized approach.

97 MATHEMATICS AND COMPUTING↗

Energy scaling advantages of resistive memory crossbar based computation and its application to sparse coding

In this study, the exponential increase in data over the last decade presents a significant challenge to analytics efforts that seek to process and interpret such data for various applications. Neural-inspired computing approaches are being developed in order to leverage the computational properties of the analog, low-power data processing observed in biological systems. Analog resistive memory crossbars can perform a parallel read or a vector-matrix multiplication as well as a parallel write or a rank-1 update with high computational efficiency. For an N × N crossbar, these two kernels can be O(N) more energy efficient than a conventional digital memory-based architecture. If the read operation is noise limited, the energy to read a column can be independent of the crossbar size (O(1)). These two kernels form the basis of many neuromorphic algorithms such as image, text, and speech recognition. For instance, these kernels can be applied to a neural sparse coding algorithm to give an O(N) reduction in energy for the entire algorithm when run with finite precision. Sparse coding is a rich problem with a host of applications including computer vision, object tracking, and more generally unsupervised learning.

97 MATHEMATICS AND COMPUTING↗

Virtual machine provisioning, code management, and data movement design for the Fermilab HEPCloud Facility

The Fermilab HEPCloud Facility Project has as its goal to extend the current Fermilab facility interface to provide transparent access to disparate resources including commercial and community clouds, grid federations, and HPC centers. This facility enables experiments to perform the full spectrum of computing tasks, including data-intensive simulation and reconstruction. We have evaluated the use of the commercial cloud to provide elasticity to respond to peaks of demand without overprovisioning local resources. Full scale data-intensive workflows have been successfully completed on Amazon Web Services for two High Energy Physics Experiments, CMS and NOνA, at the scale of 58000 simultaneous cores. This paper describes the significant improvements that were made to the virtual machine provisioning system, code caching system, and data movement system to accomplish this work. The virtual image provisioning and contextualization service was extended to multiple AWS regions, and to support experiment-specific data configurations. A prototype Decision Engine was written to determine the optimal availability zone and instance type to run on, minimizing cost and job interruptions. We have deployed a scalable on-demand caching service to deliver code and database information to jobs running on the commercial cloud. It uses the frontiersquid server and CERN VM File System (CVMFS) clients on EC2 instances and utilizes various services provided by AWS to build the infrastructure (stack). We discuss the architecture and load testing benchmarks on the squid servers. We also describe various approaches that were evaluated to transport experimental data to and from the cloud, and the optimal solutions that were used for the bulk of the data transport. Finally, we summarize lessons learned from this scale test, and our future plans to expand and improve the Fermilab HEP Cloud Facility.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Reuse metrics and measurement: A framework

The lessons learned and experience gleaned are described by those who have started to implement the reuse metrics and measurement framework used in controlling the development of common avionics and software for its affiliated aircraft programs. The framework was developed to permit the measurement of the long term cost/benefits resulting from the creation and use of Reusable Software Objects (RSOs). The framework also monitors the efficiency and effectiveness of the Software Reuse Library (SRL). The metrics and measurement framework is defined which was established to allow some determinations and findings to be made relative to software reuse. Seven criteria are discussed which were used to guide the establishment of the proposed reuse framework. Object recapture and creation metrics are explained along with their normalized use in effort, productivity, and quality determination. A single and multiple reuse instance version of a popular cost model is presented which uses these metrics and the measurement scheme proposed to predict the software effort and duration under various reuse assumptions. Studies in using this model to predict actuals taken from the RCI data base of over 1000 completed projects is discussed.

Reifer, Donald J.↗

A primer on regression methods for decoding cis-regulatory logic

The rapidly emerging field of systems biology is helping us to understand the molecular determinants of phenotype on a genomic scale [1]. Cis-regulatory elements are major sequence-based determinants of biological processes in cells and tissues [2]. For instance, during transcriptional regulation, transcription factors (TFs) bind to very specific regions on the promoter DNA [2,3] and recruit the basal transcriptional machinery, which ultimately initiates mRNA transcription (Figure 1A). Learning cis-Regulatory Elements from Omics Data A vast amount of work over the past decade has shown that omics data can be used to learn cis-regulatory logic on a genome-wide scale [4-6]--in particular, by integrating sequence data with mRNA expression profiles. The most popular approach has been to identify over-represented motifs in promoters of genes that are coexpressed [4,7,8]. Though widely used, such an approach can be limiting for a variety of reasons. First, the combinatorial nature of gene regulation is difficult to explicitly model in this framework. Moreover, in many applications of this approach, expression data from multiple conditions are necessary to obtain reliable predictions. This can potentially limit the use of this method to only large data sets [9]. Although these methods can be adapted to analyze mRNA expression data from a pair of biological conditions, such comparisons are often confounded by the fact that primary and secondary response genes are clustered together--whereas only the primary response genes are expected to contain the functional motifs [10]. A set of approaches based on regression has been developed to overcome the above limitations [11-32]. These approaches have their foundations in certain biophysical aspects of gene regulation [26,33-35]. That is, the models are motivated by the expected transcriptional response of genes due to the binding of TFs to their promoters. While such methods have gathered popularity in the computational domain, they remain largely obscure to the broader biology community. The purpose of this tutorial is to bridge this gap. We will focus on transcriptional regulation to introduce the concepts. However, these techniques may be applied to other regulatory processes. We will consider only eukaryotes in this tutorial.

59 BASIC BIOLOGICAL SCIENCES↗

Modeling Key Predictors of Airport Runway Configurations Using Learning Algorithms

Advanced traffic flow management automation will need accurate predictions of airport runway configurations. Terminal area weather and traffic demand are generally considered to be the most significant factors in predicting runway configuration. Weather information is forecasted across multiple features, including wind direction, wind speed, gusts, cloud ceilings, visibility, temperature, and precipitation, among many others. We use machine learning techniques on historical weather and runway data to determine weather features that correlate well with runway configurations. We analyze the predictive capability of weather features using different learning models trained on data from four major U.S. airports: Atlanta (ATL), Washington – Dulles (IAD), New York – Kennedy (JFK), and San Francisco (SFO). Wind direction alone is strongly correlated with runway configurations above all other examined factors, as expected. This correlation is the most significant component of the ~80% prediction accuracy in selecting between the two most frequently used runway configurations. However, individual airports show variations on how well the runway configuration decisions correlate with wind direction. While wind direction was identified as the most significant indicator of configuration decisions in ATL, IAD, and JFK, it did not emerge as such at SFO. Traffic demand was not found to be a strong factor in predicting runway configurations at any of the airports analyzed. In rare instances, when high demand cannot be accommodated within the current configuration, temporary changes are likely to be attributable to demand. However, these occurrences are so limited in number that their overall effect is not sufficient to consider traffic demand as a major indicator of runway configuration at the airports analyzed.

Bilimoria, Karl D.↗

Medium-Range River Flood Forecasts Using a Long Short-Term Memory Network

River flooding and the impacts are a concern for decision makers throughout the United States. Accurate medium-range forecasts (~3-7 days) are critical for providing advanced outlooks to emergency management officials. Unfortunately, accurately forecasting rainfall-runoff and the subsequent rise and fall within rivers remain a challenge in hydrological modeling. While complex physical modeling systems are the standard for representing the hydrological processes, they are computationally demanding and can require extensive calibration. Further, uncertainties remain in the model parameters and input data. The use of machine learning can reduce some of the computational demand while maintaining high accuracy. Therefore, this project makes use of a Long Short-Term Memory (LSTM) network which explicitly accounts for the time-dependent nature of rainfall-runoff modeling. The developed LSTM was trained to predict river gauge height, or stage height, based on time-lagged input features which include: gauge height to initialize the model, the NASA Short-term Prediction Research and Transition Center’s instance of the Land Information System (SPoRT-LIS) relative soil moisture to describe the rainfall infiltration rate, and 6-hr Multi-Radar Multi-Sensor quantitative precipitation estimate (MRMS QPE). The developed LSTM based system is then used to produce 7-day forecasts with a 6-hr temporal resolution using three different quantitative precipitation forecasts (QPF) from the NWS’s Weather Prediction Center (WPC), the NCEP Global Forecast System (GFS) model and the National Blend of Models (NBM). This trained modeling system has been implemented as an experimental product at over 100 different rivers in collaboration with at multiple National Weather Service (NWS) Forecast Offices and River Forecast Centers (RFC) across the eastern half of the United States. The developed LSTM model achieved average Nash-Sutcliffe efficiency (NSE) 0.89 higher than the equivalent medium-range National Water Model ensemble member forecast over a 7-day forecast. In addition to the initial development and evaluation, this project has continued to expand. While the initial model was developed for precipitation dominated basins, expansion of the project has taken it to basins effected by snow melt. This presentation will provide an overview of the project with focus on recent developments on incorporating snow melt processes into the model.

Andrew T. White↗

Multi-modal Energy-optimal Trip Scheduling in Real-time (METS-R) for Transportation Hubs (Final Report)

This report summarizes the work performed under the award number EE0008524. The project develops the Multi-modal Energy-optimal Trip Scheduling in Real-time (METS-R) platform as the next-generation transportation solution based on autonomous electric vehicles (AEV) serving passenger trips from and to urban transportation hubs, to substantially reduce transportation energy consumption. Extensive data collection and analyses were first conducted to understand the demand patterns and energy consumption of hub-based on-road trips. Then, a data-driven framework that consists of an analytical module and a simulation module was proposed. For the analytical module, five planning + operation tools were developed to support the planning and energy-efficient operations of urban AEV services: the charging station planning that robotically allocates charging supplies based on the stationary charging demand distribution; the transit planning and demand adaptive scheduling model that efficiently generates\ candidate transit routes from hubs to other places and dynamically adjusts the transit time table to fit the current demand; the online energy-efficient routing that learns the energy-optimal paths from observations of link-level energy consumption in real-time; the hub-based ridesharing that matches trip requests together with account for the uncertainty of future trip demand and vehicle supply; and finally, the integrated demand prediction and anomaly detection pipeline that leverages the flight/train time table and support other planning/operation tools. To demonstrate the performance of these tools, a scalable high-performance agent-based simulator was built. We divided the urban space into multiple service zones where each zone was considered as an agent for passenger generation and vehicle charging. Two types of AEV agents were coded to model two types of mobility services: AEV taxi and AEV transit. For the AEV taxi, the team implemented the functions of pickup/drop-off passengers, energy-efficient routing, ridesharing, fleet rebalancing, and recharging. For the AEV bus, the team implemented the functions of demand-adaptive route scheduling, passenger boarding, and recharging. A high-performance computing framework was introduced to receive various profiling information (such as link energy updates, vehicle speed) from the simulator instances and communicate the operational commands back to the instances. The numerical experiments show that each of the proposed operational algorithms can reduce energy consumption and improve system efficiency. Furthermore, there exists the need to collectively consider multiple planning + operational strategies as multiple strategies can influence each other in terms of performance impacts. Recommendations for future work related to AEV planning and simulation are discussed.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Towards Geospatial Knowledge Graph Infused Neuro-Symbolic AI for Remote Sensing Scene Understanding

Deep learning has proven its effectiveness in numerous tasks for remote sensing scene understanding. However there is an increasing interest to explore fusion of domain-specific background information to the deep neural network to further improve its performance. Remote sensing researchers are also working towards developing models that generalize and adapt to multiple applications. Generalization challenges coupled with the scarcity of large corpora of high-quality noise-free labelled data, have together fueled an interest for leveraging background information. Knowledge graphs serve as excellent choice to represent domain-specific information in a structured, standardized and extensible manner. Integrating symbolic knowledge representations in the form of Knowledge Graph Embedding (KGE) to perform neuro-symbolic reasoning is an emerging research direction promising significant impacts. This vision paper seeks to position ideas and provoke early thoughts toward advancing neuro-symbolic artificial intelligence in the context of geospatial challenges. Specifically, it conceptualizes and elaborates on an architecture for infusing geospatial knowledge from knowledge graph in a deep neural network pipeline. As guiding case studies - land-use land-cover classification, object detection and instance segmentation can benefit from infusing spatio-contextual information with remote sensing imagery. The discussion further reflects on and articulates the challenges and explainable AI opportunities anticipated when scaling and maintaining large-scale geospatial knowledge graphs.

Potnis, Abhishek↗