Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed machine 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 901 records · Page 50

Improve Learning from Crowds via Generative Augmentation

Crowdsourcing provides an efficient label collection schema for supervised machine learning. However, to control annotation cost, each instance in the crowdsourced data is typically annotated by a small number of annotators. This creates a sparsity issue and limits the quality of machine learning models trained on such data. In this paper, we study how to handle sparsity in crowdsourced data using data augmentation. Specifically, we propose to directly learn a classifier by augmenting the raw sparse annotations. We implement two principles of high-quality augmentation using Generative Adversarial Networks: 1) the generated annotations should follow the distribution of authentic ones, which is measured by a discriminator; 2) the generated annotations should have high mutual information with the ground-truth labels, which is measured by an auxiliary network. Extensive experiments and comparisons against an array of state-of-the-art learning from crowds methods on three real-world datasets proved the effectiveness of our data augmentation framework. It shows the potential of our algorithm for low-budget crowdsourcing in general.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Yet Another Discriminant Analysis (YADA): A Probabilistic Model for Machine Learning Applications

This paper presents a probabilistic model for various machine learning (ML) applications. While deep learning (DL) has produced state-of-the-art results in many domains, DL models are complex and over-parameterized, which leads to high uncertainty about what the model has learned, as well as its decision process. Further, DL models are not probabilistic, making reasoning about their output challenging. In contrast, the proposed model, referred to as Yet Another Discriminate Analysis(YADA), is less complex than other methods, is based on a mathematically rigorous foundation, and can be utilized for a wide variety of ML tasks including classification, explainability, and uncertainty quantification. YADA is thus competitive in most cases with many state-of-the-art DL models. Ideally, a probabilistic model would represent the full joint probability distribution of its features, but doing so is often computationally expensive and intractable. Hence, many probabilistic models assume that the features are either normally distributed, mutually independent, or both, which can severely limit their performance. YADA is an intermediate model that (1) captures the marginal distributions of each variable and the pairwise correlations between variables and (2) explicitly maps features to the space of multivariate Gaussian variables. Numerous mathematical properties of the YADA model can be derived, thereby improving the theoretic underpinnings of ML. Validation of the model can be statistically verified on new or held-out data using native properties of YADA. However, there are some engineering and practical challenges that we enumerate to make YADA more useful.

97 MATHEMATICS AND COMPUTING↗

Remote Sensing-Informed Zonation for Understanding Snow, Plant and Soil Moisture Dynamics within a Mountain Ecosystem

In the headwater catchments of the Rocky Mountains, plant productivity and its dynamics are largely dependent upon water availability, which is influenced by changing snowmelt dynamics associated with climate change. Understanding and quantifying the interactions between snow, plants and soil moisture is challenging, since these interactions are highly heterogeneous in mountainous terrain, particularly as they are influenced by microtopography within a hillslope. Recent advances in satellite remote sensing have created an opportunity for monitoring snow and plant dynamics at high spatiotemporal resolutions that can capture microtopographic effects. In this study, we investigate the relationships among topography, snowmelt, soil moisture and plant dynamics in the East River watershed, Crested Butte, Colorado, based on a time series of 3-meter resolution PlanetScope normalized difference vegetation index (NDVI) images. To make use of a large volume of high-resolution time-lapse images (17 images total), we use unsupervised machine learning methods to reduce the dimensionality of the time lapse images by identifying spatial zones that have characteristic NDVI time series. We hypothesize that each zone represents a set of similar snowmelt and plant dynamics that differ from other identified zones and that these zones are associated with key topographic features, plant species and soil moisture. We compare different distance measures (Ward and complete linkage) to understand the effects of their influence on the zonation map. Results show that the identified zones are associated with particular microtopographic features; highly productive zones are associated with low slopes and high topographic wetness index, in contrast with zones of low productivity, which are associated with high slopes and low topographic wetness index. The zones also correspond to particular plant species distributions; higher forb coverage is associated with zones characterized by higher peak productivity combined with rapid senescence in low moisture conditions, while higher sagebrush coverage is associated with low productivity and similar senescence patterns between high and low moisture conditions. In addition, soil moisture probe and sensor data confirm that each zone has a unique soil moisture distribution. This cluster-based analysis can tractably analyze high-resolution time-lapse images to examine plant-soil-snow interactions, guide sampling and sensor placements and identify areas likely vulnerable to ecological change in the future.

54 ENVIRONMENTAL SCIENCES↗

Information-Theoretic Bounds on Quantum Advantage in Machine Learning

We study the performance of classical and quantum machine learning (ML) models in predicting outcomes of physical experiments. The experiments depend on an input parameter x and involve execution of a (possibly unknown) quantum process E. Our figure of merit is the number of runs of E required to achieve a desired prediction performance. We consider classical ML models that perform a measurement and record the classical outcome after each run of E, and quantum ML models that can access E coherently to acquire quantum data; the classical or quantum data are then used to predict the outcomes of future experiments. We prove that for any input distribution D(x), a classical ML model can provide accurate predictions on average by accessing E a number of times comparable to the optimal quantum ML model. In contrast, for achieving an accurate prediction on all inputs, we prove that the exponential quantum advantage is possible. For example, to predict the expectations of all Pauli observables in an n-qubit system ρ, classical ML models require 2 Ω(n) copies of ρ, but we present a quantum ML model using only O(n) copies. Our results clarify where the quantum advantage is possible and highlight the potential for classical ML models to address challenging quantum problems in physics and chemistry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Modeling Nanoconfinement Effects Using Active Learning

Predicting the spatial configuration of gas in nanopores of is relevant in applications such as fluid flow forecasting and hydrocarbon reserves estimation. For example, shale reservoirs have suffered from computationally intractable multiscale problems, since fluid properties such as viscosity, density, and adsorption must be calculated by using expensive molecular dynamics (MD) simulations within each nanopore, whereas flow through these connected nanopores must be simulated at the micrometer scale. We utilize machine learning techniques to quickly and accurately model nanoscale confinement effects as an important step toward bridging the nano and micro scales. Our workflow is based on building and training physics-based deep-neural-networks models by learning from a database of MD calculations. The model accounts for the adsorption phenomenon by predicting the statistical distribution of gas inside nanopores. Because large databases of MD calculations are expensive to create, we investigate active learning (AL) as a data set construction strategy. In this workflow, new data are selected based on the model uncertainty via the query-by-committee approach. We show that our workflow obtains accurate models that generalize to real scanning electron microscopy geometries with 1/10th of the number of MD calculations required vs random data set generation. Our method enables the possibility of modeling nanoconfinement effects at the mesoscale, where complex connected sets of nanopores affect flow.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Enabling dynamic 3D coherent diffraction imaging via adaptive latent space tuning of generative autoencoders

Abstract Coherent diffraction imaging (CDI) is an advanced non-destructive 3D X-ray imaging technique for measuring a sample’s electron density. The main challenge of CDI is loss of phase information in diffraction intensity measurements, resulting in lengthy iterative reconstruction processes that can return non-unique solutions, which pose challenges for experiments attempting to track dynamic sample evolution through multiple states. As the increased brightness of fourth-generation light sources enables faster sample measurements and drives operando experiments with Bragg CDI, there is a growing need for faster reconstruction techniques that can keep pace. We have developed an adaptive generative autoencoder approach for uniquely tracking a sample’s electron density as it dynamically evolves. Our approach adaptively tunes the low-dimensional latent embedding of a generative autoencoder, enabling a computationally efficient manner to account for time-varying shifting distributions in real-time. Analytic proof of convergence is provided as well as numerical demonstration of sample tracking with noisy measurements.

97 MATHEMATICS AND COMPUTING↗

Main belt asteroids taxonomical information from dark energy survey data

While proper orbital elements are currently available for more than 1 million asteroids, taxonomical information is still lagging behind. Surveys like SDSS-MOC4 provided preliminary information for more than 100 000 objects, but many asteroids still lack even a basic taxonomy. In this study, we use Dark Energy Survey (DES) data to provide new information on asteroid physical properties. By cross-correlating the new DES data base with other data bases, we investigate how asteroid taxonomy is reflected in DES data. While the resolution of DES data is not sufficient to distinguish between different asteroid taxonomies within the complexes, except for V-type objects, it can provide information on whether an asteroid belongs to the C- or S-complex. Here, machine learning methods optimized through the use of genetic algorithms were used to predict the labels of more than 68 000 asteroids with no prior taxonomic information. Using a high-quality, limited set of asteroids with data on gri slopes and i − z colours, we detected 409 new possible V-type asteroids. Their orbital distribution is highly consistent with that of other known V-type objects.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Dimension Reduction and Redundancy Removal through Successive Schmidt Decompositions

Quantum computers are believed to have the ability to process huge data sizes, which can be seen in machine learning applications. In these applications, the data, in general, are classical. Therefore, to process them on a quantum computer, there is a need for efficient methods that can be used to map classical data on quantum states in a concise manner. On the other hand, to verify the results of quantum computers and study quantum algorithms, we need to be able to approximate quantum operations into forms that are easier to simulate on classical computers with some errors. Motivated by these needs, in this paper, we study the approximation of matrices and vectors by using their tensor products obtained through successive Schmidt decompositions. We show that data with distributions such as uniform, Poisson, exponential, or similar to these distributions can be approximated by using only a few terms, which can be easily mapped onto quantum circuits. The examples include random data with different distributions, the Gram matrices of iris flower, handwritten digits, 20newsgroup, and labeled faces in the wild. Similarly, some quantum operations, such as quantum Fourier transform and variational quantum circuits with a small depth, may also be approximated with a few terms that are easier to simulate on classical computers. Furthermore, we show how the method can be used to simplify quantum Hamiltonians: In particular, we show the application to randomly generated transverse field Ising model Hamiltonians. The reduced Hamiltonians can be mapped into quantum circuits easily and, therefore, can be simulated more efficiently.

97 MATHEMATICS AND COMPUTING↗

Learning interpretable surface elasticity properties from bulk properties via neural network equation learners

Surface elasticity is central to understanding the mechanics and stability of surfaces and interfaces. It is characterized by quantities such as surface tension, residual surface stress, and surface stiffness. However their analytical expressions are typically difficult to derive from atomistic data, and depend strongly on modeling choices. This work presents a neural network-based equation learner which combines customized activation functions and connection-based pruning to discover parsimonious, closed-form equations for surface elasticity from atomistic simulations. Applying the method to seven face-centered cubic (FCC) metals, our equation learner uncovers interpretable equations that describe both low-Miller index and high-Miller index surface properties, capturing long-tail property distributions accurately. The discovered expressions are decoupled into two components: a universal, geometry-driven orientation function, and material-specific baseline coefficients. We find that lower-order properties such as surface tension are fundamentally geometry dependent, while higher-order properties such as surface stress and elasticity show more complex geometry and material dependence. We also relate material dependent coefficients to bulk properties, forming a clear map from bulk material properties to surface elasticity. Overall, this approach demonstrates that interpretable neurosymbolic machine learning can bridge the gap between atomistic simulations and physical laws, enabling the discovery of generalizable structure–property relationships for materials science phenomena such as surface elasticity.

Equation learning↗

Uncertainty quantification in multivariable regression for material property prediction with Bayesian neural networks

With the increased use of data-driven approaches and machine learning-based methods in material science, the importance of reliable uncertainty quantification (UQ) of the predicted variables for informed decision-making cannot be overstated. UQ in material property prediction poses unique challenges, including multi-scale and multi-physics nature of materials, intricate interactions between numerous factors, limited availability of large curated datasets, etc. In this work, we introduce a physics-informed Bayesian Neural Networks (BNNs) approach for UQ, which integrates knowledge from governing laws in materials to guide the models toward physically consistent predictions. To evaluate the approach, we present case studies for predicting the creep rupture life of steel alloys. Experimental validation with three datasets of creep tests demonstrates that this method produces point predictions and uncertainty estimations that are competitive or exceed the performance of conventional UQ methods such as Gaussian Process Regression. Additionally, we evaluate the suitability of employing UQ in an active learning scenario and report competitive performance. The most promising framework for creep life prediction is BNNs based on Markov Chain Monte Carlo approximation of the posterior distribution of network parameters, as it provided more reliable results in comparison to BNNs based on variational inference approximation or related NNs with probabilistic outputs.

36 MATERIALS SCIENCE↗

Quantum Divide and Compute: Exploring the Effect of Different Noise Sources

Abstract Our recent work (Ayral et al. in Proceedings of IEEE computer society annual symposium on VLSI, ISVLSI, pp 138–140, 2020. 10.1109/ISVLSI49217.2020.00034 ) showed the first implementation of the Quantum Divide and Compute (QDC) method, which allows to break quantum circuits into smaller fragments with fewer qubits and shallower depth. This accommodates the limited number of qubits and short coherence times of quantum processors. This article investigates the impact of different noise sources—readout error, gate error and decoherence—on the success probability of the QDC procedure. We perform detailed noise modeling on the Atos Quantum Learning Machine, allowing us to understand tradeoffs and formulate recommendations about which hardware noise sources should be preferentially optimized. We also describe in detail the noise models we used to reproduce experimental runs on IBM’s Johannesburg processor. This article also includes a detailed derivation of the equations used in the QDC procedure to compute the output distribution of the original quantum circuit from the output distribution of its fragments. Finally, we analyze the computational complexity of the QDC method for the circuit under study via tensor-network considerations, and elaborate on the relation the QDC method with tensor-network simulation methods.

97 MATHEMATICS AND COMPUTING↗

The geometry of signal space: a case study of direct mapping between seismic signals and event distribution

SUMMARY Under favourable circumstances, seismic waveforms corresponding to an ensemble of events related by a common, spatially distributed process collectively exhibit a regular, signal-space geometry. When events in the ensemble have a common, or nearly common, source mechanism, this geometry is a distorted image of the distribution of events in the source region. The signal-space image can be visualized using a relatively simple waveform alignment and projection operation. Ensemble waveform correlation measurements can be inverted to estimate the distribution of the events in the source region, up to an arbitrary rotation, reflection and scaling, with residual distortion. We demonstrate these concepts with synthetic waveforms and with observations of long-wall mining induced seismicity for which substantial ground truth information is available. Our experience with these data has implications for location, correlation detection and machine learning and possible application to studies of repeating events in induced, volcanic and glacial seismicity. Our results place limits on the widely held assumption that waveform correlation is a useful measure of event separation. We suggest that the constraints on event separation need to be evaluated in the context of a population of related events, whose waveforms sample the signal space image of the source region. A better indicator of event separation is the length of the shortest path in signal space along the image.

58 GEOSCIENCES↗

Distributed heterogeneous compute infrastructure for the study of additive manufacturing systems

We present the current status of a large-scale computing framework to address the need of the multidisciplinary effort to study chemical dynamics. Specifically, we are enabling scientists to process and store experimental data, run large-scale computationally expensive high-fidelity physical simulation, and analyze these results using the state-of-the-art data analytics tools, machine learning, and uncertainty quantification methods using heterogeneous computing resources, such as CPU and GPU cluster. The framework can integrate or abstract out multiple domains based on roles. In order to develop this framework, we have leveraged an existing framework coupled with in-house heterogeneous computing resources. We present the results of using this framework on a single metadata triggered workflow to accelerate an additive manufacturing use case.

heterogeneous computing, hpc, workflows, reproduci↗

LL18-Signal Analysis-NDD2Ad (Final Report)

Under favorable circumstances, seismic waveforms corresponding to an ensemble of events related by a common, spatially-distributed process collectively exhibit a regular, signal-space geometry. When events in the ensemble have a common, or nearly common, source mechanism, this geometry is a distorted image of the distribution of events in the source region. The signal space image can be visualized using a relatively simple waveform alignment and projection operation. Ensemble waveform correlation measurements can be inverted to estimate the distribution of the events in the source region, up to an arbitrary rotation, reflection, and scaling with residual distortion. We demonstrate these concepts with synthetic waveforms and with observations of long-wall mining induced seismicity for which substantial ground truth information is available. Our experience with these data has implications for location, correlation detection and machine learning, and possible application to studies of repeating events in induced, volcanic, and glacial seismicity. Our results place limits on the widely-held assumption that waveform correlation is a useful measure of event separation. We suggest that the constraints on event separation need to be evaluated in the context of a population of related events, whose waveforms sample the signal space image of the source region. A better indicator of event separation is the length of the shortest path in signal space along the image.

58 GEOSCIENCES↗

A High-Throughput Computing Infrastructure to Generate Custom, Open Community Geothermal Datasets

The most significant challenge facing geothermal research, development, and deployment is a lack of comprehensive datasets describing the geological and economical properties of North America. Automated knowledge base construction, the process of designing algorithms to analyze text and images to programmatically build new datasets, is one possible solution to this problem. The xDD library of full-text scientific articles (https://xdd.wisc.edu) is one of the largest collections of open and controlled-access scientific documents available for knowledge base construction in the world, but it has been underutilized by experts in geothermal research. The xDD development team attributed the lack of engagement by software developers and geothermal researchers to two perceived shortcomings of the system. First, the workflow for obtaining data from xDD for local development and testing of data mining applications was unnecessarily abstruse and required significant manual intervention by xDD systems administrators. Second, although xDD already held articles from a broad cross-section of scientific literature with an emphasis on the geosciences, it did not have an explicit set of geothermal research documents that could serve as the nucleus of a geothermal data mining application. To address these issues, the Automated Data Extraction PlaTform (ADEPT) was proposed to extend the data distribution capabilities of the xDD system. The ADEPT extension added the following four key features to xDD: 1) integration of National Geothermal Data System (NGDS) documents into the xDD library to provide an explicitly geothermally-themed collection; 2) improved RESTful (i.e., https-protocol driven) web services for external partners to access xDD data for machine learning application development; 3) a web platform for end-users and xDD administrators to coordinate the development of data mining applications from the initial step of browsing available documents to the final stage of deploying a production-quality machine learning application on high-throughput computing infrastructure; and 4) the development of demonstration data mining applications to illustrate the new workflow to potential collaborators. A total of 21,674 geothermal documents from NGDS were fully ingested into the xDD library and the associated metadata is publicly available through the xDD web services; furthermore, the ADEPT web platform is now publicly accessible and fully live at https://xdd.wisc.edu/adept/.

15 GEOTHERMAL ENERGY↗

Milky Way Satellite Census. I. The Observational Selection Function for Milky Way Satellites in DES Y3 and Pan-STARRS DR1

We report the results of a systematic search for ultra-faint Milky Way satellite galaxies using data from the Dark Energy Survey (DES) and Pan-STARRS1 (PS1). Together, DES and PS1 provide multi-band photometry in optical/near-infrared wavelengths over ~80% of the sky. Our search for satellite galaxies targets ~25,000 deg$^2$ of the high-Galactic-latitude sky reaching a 10$\sigma$ point-source depth of $\gtrsim$ 22.5 mag in the $g$ and $r$ bands. While satellite galaxy searches have been performed independently on DES and PS1 before, this is the first time that a self-consistent search is performed across both data sets. We do not detect any new high-significance satellite galaxy candidates, while recovering the majority of satellites previously detected in surveys of comparable depth. We characterize the sensitivity of our search using a large set of simulated satellites injected into the survey data. We use these simulations to derive both analytic and machine-learning models that accurately predict the detectability of Milky Way satellites as a function of their distance, size, luminosity, and location on the sky. To demonstrate the utility of this observational selection function, we calculate the luminosity function of Milky Way satellite galaxies, assuming that the known population of satellite galaxies is representative of the underlying distribution. We provide access to our observational selection function to facilitate comparisons with cosmological models of galaxy formation and evolution.

79 ASTRONOMY AND ASTROPHYSICS↗

Using angular two-point correlations to self-calibrate the photometric redshift distributions of DECaLS DR9

Calibrating the redshift distributions of photometric galaxy samples is essential in weak lensing studies. The self-calibration method combines angular auto- and cross-correlations between galaxies in multiple photometric redshift (photo-z) bins to reconstruct the scattering rates matrix between redshift bins. In this paper, we test a recently proposed self-calibration algorithm using the DECaLS Data Release 9 and investigate to what extent the scattering rates are determined. We first mitigate the spurious angular correlations due to imaging systematics by a machine learning based method. We then improve the algorithm for χ 2 minimization and error estimation. Finally, we solve for the scattering matrices, carry out a series of consistency tests, and find reasonable agreements: (1) finer photo-z bins return a high-resolution scattering matrix, and it is broadly consistent with the low-resolution matrix from wider bins; (2) the scattering matrix from the Northern Galactic Cap is almost identical to that from Southern Galactic Cap; (3) the scattering matrices are in reasonable agreement with those constructed from the power spectrum and the weighted spectroscopic subsample. We also evaluate the impact of cosmic magnification. Although it changes little the diagonal elements of the scattering matrix, it affects the off-diagonals significantly. The scattering matrix also shows some dependence on scale cut of input correlations, which may be related to a known numerical degeneracy between certain scattering pairs. In conclusion, this work demonstrates the feasibility of the self-calibration method in real data and provides a practical alternative to calibrate the redshift distributions of photometric samples.

79 ASTRONOMY AND ASTROPHYSICS↗

Deep Learning for Automated Identification of Eels in Sonar Data

Freshwater eels, such as the American eel (Anguilla rostrata) present numerous challenges related to safe downstream fish passage at hydroelectric facilities. One of those challenges is effective monitoring of their abundance, movements, and behavior to facilitate design and operation of eel protection and passage facilities. A previous EPRI study documented the ability of human analysts to reliably identify American eels in data obtained with a 1100/1800 kHz, multibeam sonar. This report describes a project to develop deep learning (a subset of artificial intelligence) tools to automate the time-consuming, subjective process of eel identification in multibeam sonar data. The project exploited new data collected in the laboratory and the existing data from the prior EPRI field study to develop and test deep learning and other data analytic tools, including wavelet filtering, differencing for static object removal, and convolutional neural network analysis. The analysis of the laboratory data demonstrated feasibility of the approach, revealed object characteristics observed with the sonar that distinguish eels from similarly sized and shaped acoustic targets, and provided additional data for algorithm selection and training. Deep learning algorithms trained and tested on the laboratory data alone achieved accuracy rates of greater than 98% when classifying acoustic images of eels and similar-sized neutrally buoyant sticks. The algorithm trained and tested on the pre-existing field data alone, and yielded classification accuracy of 9.3% false positives and 13.3% false negatives when distinguishing between eels and sticks/PVC pipes based on video clips (i.e., multiple, consecutive images). This performance is comparable to the classification accuracy achieved by human analysts in the prior study. The deep learning algorithm trained on a combination of video clips obtained in the laboratory and the field and tested on video clips from the field, was able to distinguish eels from sticks and PVC pipes (a river debris analog) of similar size with 100% accuracy. Outreach to the hardware, software, and end-user communities early in the project helped to identify needs and specify the application space. Outreach to those communities at the end of the project communicated project results and opportunities for further development. The project achieved proof of concept for automated identification of eel in multibeam sonar data. Future work should focus on acquisition of additional data for more robust algorithm training and testing; modification of the software tools to accommodate multiple acoustic targets in the acoustic field at a given time; identification of additional object classes; incorporation of motion in the object identification and classification algorithms; operationalizing the software tools, including integration with other existing sonar data analysis tools; and partnering with hardware and software providers for distribution of the software tools with their commercial products.

13 HYDRO ENERGY↗