Search NASA⌕ Search

SEARCH · Search NASA

Results for “Distance 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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Multi-head attention-based U-Nets for predicting protein domain boundaries using 1D sequence features and 2D distance maps

Abstract The information about the domain architecture of proteins is useful for studying protein structure and function. However, accurate prediction of protein domain boundaries (i.e., sequence regions separating two domains) from sequence remains a significant challenge. In this work, we develop a deep learning method based on multi-head U-Nets (called DistDom) to predict protein domain boundaries utilizing 1D sequence features and predicted 2D inter-residue distance map as input. The 1D features contain the evolutionary and physicochemical information of protein sequences, whereas the 2D distance map includes the structural information of proteins that was rarely used in domain boundary prediction before. The 1D and 2D features are processed by the 1D and 2D U-Nets respectively to generate hidden features. The hidden features are then used by the multi-head attention to predict the probability of each residue of a protein being in a domain boundary, leveraging both local and global information in the features. The residue-level domain boundary predictions can be used to classify proteins as single-domain or multi-domain proteins. It classifies the CASP14 single-domain and multi-domain targets at the accuracy of 75.9%, 13.28% more accurate than the state-of-the-art method. Tested on the CASP14 multi-domain protein targets with expert annotated domain boundaries, the average per-target F1 measure score of the domain boundary prediction by DistDom is 0.263, 29.56% higher than the state-of-the-art method.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

In situ Detection of Plasma Induced Surface Interaction based on Deep Learning based Visual Diagnostics (Technical Report)

It is characteristic for many plasma devices to undergo plasma-material interaction leading to surface erosion. These processes, often not easily detectable, lead to changes in device performance and lifespan. State-of-the-art lifetime tests and wear experiments require over 1000s hours. A self-consistent model for accurately predicting the erosion's effects is not available. In situ detection of these processes is not a trivial task since the surface variations at the early stages have a micron scale. Such limitations not only restrict testing and prediction capabilities but also slow the development of new thrusters and limit mission duration. To address these challenges, an in-situ diagnostic for real-time erosion assessment has been developed, aiming to expedite lifetime testing and broaden experimental campaigns. Several works were dedicated to real-time and in situ monitoring of material erosion during plasma exposure using laser holography, microscopy, and with telemicroscopes. However, the applicability of these approaches is limited due to complexity, cost and less flexibility as they often require placing diagnostic equipment inside the vacuum chamber. In collaboration with Princeton Collaborative Research Facility (PCRF), Princeton Plasma Physics Laboratory (PPPL), a new diagnostic approach is developed, where geometry modifications to the ceramic channel walls were introduced that would result in accelerated channel erosion. We employed Long-distance microscope (LDM) imagery, combined with Deep-Learning based Shape from focus or depth from focus (DFF or SFF) approach, that provides an accessible and cost-effective solution. LDM employs focus variation techniques to continuously capture multiple images of the target object at distinct focal planes. DFF, an optical focus variation method, generates a 3D topographical surface depth map from a sequence of variably focused images. Combined with the developed diagnostic, this approach offers a controllable means to study erosion under accelerated conditions. In this work, we develop Neural Network-based DFF algorithm applicable for LDM data to quantitatively evaluate plasma induced surface modification from LDM data. Next, we develop Deep Learning-based super-resolution depth map image reconstruction technique to increase the resolution of depth maps obtained from DFF algorithm to improve the accuracy of erosion measurements. Thirdly, we develop several image processing techniques to remove noise and improve the quality of depth map image. Here we report the results of initial tests for this approach. An experimental setup designed and built in PPPL was employed that consists of a 3-cm gridded ion source that produces a neutralized argon beam with energies up to 600 eV. A hexagonal boron nitride (h-BN) ceramic target, designed based on computational predictions, was used. Tests were conducted to reconstruct the complex geometry of the target under the lighting conditions of the operated ion source.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

The Twins Embedding of Type Ia Supernovae. II. Improving Cosmological Distance Estimates

We show how spectra of Type Ia supernovae (SNe Ia) at maximum light can be used to improve cosmological distance estimates. In a companion article, we used manifold learning to build a three-dimensional parameterization of the intrinsic diversity of SNe Ia at maximum light that we call the "Twins Embedding."In this article, we discuss how the Twins Embedding can be used to improve the standardization of SNe Ia. With a single spectrophotometrically calibrated spectrum near maximum light, we can standardize our sample of SNe Ia with an rms of 0.101 0.007 mag, which corresponds to 0.084 0.009 mag if peculiar velocity contributions are removed and to 0.073 0.008 mag if a larger reference sample were obtained. Our techniques can standardize the full range of SNe Ia, including those typically labeled as peculiar and often rejected from other analyses. We find that traditional light-curve width + color standardization such as SALT2 is not sufficient. The Twins Embedding identifies a subset of SNe Ia, including, but not limited to, 91T-like SNe Ia whose SALT2 distance estimates are biased by 0.229 0.045 mag. Standardization using the Twins Embedding also significantly decreases host-galaxy correlations. We recover a host mass step of 0.040 0.020 mag compared to 0.092 0.026 mag for SALT2 standardization on the same sample of SNe Ia. These biases in traditional standardization methods could significantly impact future cosmology analyses if not properly taken into account.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

Cohort organized learning: clustering through agreement

In this article we describe cohort organized learning (CoOL), a method for clustering data without explicit distance or similarity computations. Herein, we will describe CoOL, derive the gradients determined by expectation maximization to train the networks, show how to monitor convergence during training and evaluate the clusters after training, and discuss a series of examples and use cases. We also discuss CoOL’s limitations and future prospects on related tasks. Because CoOL uses neural networks to estimate the clusters, it can be used to cluster any data that can be made compatible and we illustrate this on vector data and images.

clustering↗
DOE OSTI2021

Quantum-assisted associative adversarial network: applying quantum annealing in deep learning

Abstract Generative models have the capacity to model and generate new examples from a dataset and have an increasingly diverse set of applications driven by commercial and academic interest. In this work, we present an algorithm for learning a latent variable generative model via generative adversarial learning where the canonical uniform noise input is replaced by samples from a graphical model. This graphical model is learned by a Boltzmann machine which learns low-dimensional feature representation of data extracted by the discriminator. A quantum processor can be used to sample from the model to train the Boltzmann machine. This novel hybrid quantum-classical algorithm joins a growing family of algorithms that use a quantum processor sampling subroutine in deep learning, and provides a scalable framework to test the advantages of quantum-assisted learning. For the latent space model, fully connected, symmetric bipartite and Chimera graph topologies are compared on a reduced stochastically binarized MNIST dataset, for both classical and quantum sampling methods. The quantum-assisted associative adversarial network successfully learns a generative model of the MNIST dataset for all topologies. Evaluated using the Fréchet inception distance and inception score, the quantum and classical versions of the algorithm are found to have equivalent performance for learning an implicit generative model of the MNIST dataset. Classical sampling is used to demonstrate the algorithm on the LSUN bedrooms dataset, indicating scalability to larger and color datasets. Though the quantum processor used here is a quantum annealer, the algorithm is general enough such that any quantum processor, such as gate model quantum computers, may be substituted as a sampler.

Wilson, Max (ORCID:0000000207983391)↗
DOE OSTI2025

Vehicular Re-Identification from Uncontrolled Multiple Views

Vehicle re-identification (re-ID) across disparate sensing modalities remains a fundamental challenge for transportation research. In this work, we introduce a deep multi-view vehicle re-ID framework that leverages Siamese networks to compare pairs of vehicle images and produce matching scores, enabling robust association across drastically different viewpoints such as those from UAVs, surveillance cameras, and ground sensors. The model exploits convolutional neural networks to learn features that remain discriminative under changes in angle, distance, and illumination, supporting more generalizable re-ID performance. As part of this effort, we also developed an automated pipeline to synchronize roadside and UAV video streams, producing a multi-perspective dataset that complements preexisting real collections and a synthetic dataset generated in this study. Together, these contributions advance the capability to re-identify vehicles across wide viewing baselines; establish a foundation for scalable, reproducible research in vehicle re-ID; and open pathways for future applications, such as inferring routine behaviors, movement patterns, and daily habits of the individual associated with the vehicle.

convolutional neural networks↗
DOE OSTI2024

Learning Quantum States and Unitaries of Bounded Gate Complexity

While quantum state tomography is notoriously hard, most states hold little interest to practically minded tomographers. Given that states and unitaries appearing in nature are of bounded gate complexity, it is natural to ask if efficient learning becomes possible. In this work, we prove that to learn a state generated by a quantum circuit with G two-qubit gates to a small trace distance, a sample complexity scaling linearly in G is necessary and sufficient. We also prove that the optimal query complexity to learn a unitary generated by G gates to a small average-case error scales linearly in G . While sample-efficient learning can be achieved, we show that under reasonable cryptographic conjectures, the computational complexity for learning states and unitaries of gate complexity G must scale exponentially in G . We illustrate how these results establish fundamental limitations on the expressivity of quantum machine-learning models and provide new perspectives on no-free-lunch theorems in unitary learning. Together, our results answer how the complexity of learning quantum states and unitaries relate to the complexity of creating these states and unitaries. Published by the American Physical Society 2024

Zhao, Haimeng (ORCID:0000000166751489)↗
DOE OSTI2022

Spatial arrangement of dynamic surface species from solid-state NMR and machine learning-accelerated MD simulations

Here, the surface arrangement of motional organic functionalities is explored by experimental dipolar coupling measurements and the prediction of motionally-averaged coupling constant from molecular dynamics simulations. The use of machine learning potentials was key to reaching the timescale required. The distance between dynamic surface species are important in cooperative heterogeneous catalysis.

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

Residuals-based distributionally robust optimization with covariate information

We consider data-driven approaches that integrate a machine learning prediction model within distributionally robust optimization (DRO) given limited joint observations of uncertain parameters and covariates. Our framework is flexible in the sense that it can accommodate a variety of regression setups and DRO ambiguity sets. We investigate asymptotic and finite sample properties of solutions obtained using Wasserstein, sample robust optimization, and phi-divergence-based ambiguity sets within our DRO formulations, and explore cross-validation approaches for sizing these ambiguity sets. Through numerical experiments, we validate our theoretical results, study the effectiveness of our approaches for sizing ambiguity sets, and illustrate the benefits of our DRO formulations in the limited data regime even when the prediction model is misspecified.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Parallax-corrected VISST-derived pixel-level products from satellite GOES-16

The NASA Langley group led by William Smith produced GOES-16 satellite cloud retrievals over an approximate 10 by 10 degree region over the CACTI field campaign location. These retrievals are described here: https://www.arm.gov/capabilities/vaps/visst and are available for download here . They use algorithms historically called VISST that are now referred to as SatCORPS. More information can be found in Trepte et al. (2019), Minnis et al. (2021), and Yost et al. (2021). If using this dataset, please cite these references, the CACTI VISST dataset DOI found at the download link above, and this dataset’s DOI. The CACTI VISST pixel-level retrievals are on a 2 km spatial grid and available every 15 minutes (every 10 minutes late in the campaign), producing 21,765 files for the entire field campaign between October 2018 and April 2019. They are not corrected for parallax error, which is an offset in the actual geographical location of a cloud above the surface due to the satellite viewing the cloud partly from the side off nadir. This dataset applies a correction for parallax using the location relative to the satellite and the retrieved cloud top height above the surface, which allows the dataset to be geo-located with surface-based observations. The parallax correction for each location depends on the longitude, latitude and cloud top height above ground level (AGL) for that longitude and latitude in the original VISST files. The cloud top height AGL requires first computing the surface elevation at each VISST grid point. Data from the Advanced Spaceborne Thermal Emission and Reflection (ASTER) Global Digital Elevation Map Version 3 at 30-m resolution is projected onto the VISST grid using conservative coarsening (conserving surface elevation) in the xESMF Python package. The surface elevation is then subtracted from the VISST-retrieved cloud top height above mean sea level. These cloud top heights AGL are then combined with longitude and latitude to estimate the latitude and longitude corrections. Due to variability in cloud top height, the parallax shifts produce an irregular grid of values since higher cloud tops are shifted further than lower cloud tops. A ball tree-based neighbor search with Haversine distance is performed using the Python-based scikit-learn library to find the nearest VISST grid point to each parallax correction-shifted point. The data value of the shifted point is then assigned to that VISST grid point. In this manner, the irregular geographical shifts to correct for parallax are projected back to the rectilinear VISST grid. Because relatively higher clouds should obscure lower clouds, the variable values for the highest cloud top are preferentially chosen if two or more values are assigned to a grid point. The parallax correction should be viewed as an improved but still imperfect estimation of the cloud top locations, largely because the cloud top height is an imperfect retrieval. Please see the attached README document for further information. Users are encouraged to contact the authors with any additional questions.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Comparing storm resolving models and climates via unsupervised machine learning

Global storm-resolving models (GSRMs) have gained widespread interest because of the unprecedented detail with which they resolve the global climate. However, it remains difficult to quantify objective differences in how GSRMs resolve complex atmospheric formations. This lack of comprehensive tools for comparing model similarities is a problem in many disparate fields that involve simulation tools for complex data. To address this challenge we develop methods to estimate distributional distances based on both nonlinear dimensionality reduction and vector quantization. Our approach automatically learns physically meaningful notions of similarity from low-dimensional latent data representations that the different models produce. This enables an intercomparison of nine GSRMs based on their high-dimensional simulation data (2D vertical velocity snapshots) and reveals that only six are similar in their representation of atmospheric dynamics. Furthermore, we uncover signatures of the convective response to global warming in a fully unsupervised way. Our study provides a path toward evaluating future high-resolution simulation data more objectively.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2018

A mathematical discussion concerning the performance of multilayer perceptron-type artificial neural networks through use of orthogonal bipolar vectors

This work proposes the use of orthogonal bipolar vectors (OBV) as targets for multilayer perceptron (MLP) Artificial neural networks pertaining to the pattern recognition field. Implications involving this proposal are supported by a proper mathematical discussion. This study shows that the use of OBV as targets improves the class identification performance of MLP networks for pattern recognition with more than two classes when compared to the widely used conventional target bipolar vector (CBV). In addition to the overall performance improvement, it is possible to obtain high recognition rates with fewer training epochs, while keeping a feasible generalization with other data. This behavior is related to the Euclidean distance of the points in the output space, which is much higher in the case of OBVs. Therefore, with a greater distance between the points in the output space, the MLP network becomes less prone to associate trained outputs with incorrect targets. The mathematical discussion in this study is based on the backpropagation training algorithm. In addition to the mathematical discussion, results from experiments with real data are presented. These results follow those obtained by mathematical derivations. Real data sets used in the experiments are available from: (a) the Semeion Handwritten Digit of Machine Learning Repository, international repository; (b) Iris Image Database from the Chinese Academy of Sciences—CASIA; (c) Australian Sign Language, signs of Machine Learning Repository, international repository. Experiments were conducted to measure the mean Euclidean distance between the MLP network output subjected to a given input pattern and outputs related to other pattern classifications. Experimental results show that MLP networks trained with OBVs were able to ensure a Euclidean distance between the output and incorrect targets greater than MLP networks trained with CBVs (by up to 4 times for handwritten, by up to 12 times for iris images and by up to 10 times for Auslan signs language). As such, the adoption of OBVs as target vectors for MLPs reduces the computational effort for training the network.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Predicting U.S. federal fleet electric vehicle charging patterns using internal combustion engine vehicle fueling transaction statistics

Utilizing fueling transactions from internal combustion engine vehicles (ICEVs), the authors estimated how frequently midday public charging would be required for U.S. federal fleet battery electric vehicles (BEVs). Fueling transaction summary statistics are more widely available than trip-level telematics data, making this methodology more accessible and transferable to other researchers and fleet managers considering BEV replacements. For example, readers can easily apply a linear model using only the count of back-to-back fueling events at gas stations over 57 straight-line miles apart to predict days exceeding range. This linear regression predicted binned days exceeding 250 miles at 80% accuracy on a hold-out test set from the same fleet as the training data and 66 % accuracy on a new fleet displaying different driving behaviors. The authors additionally provide linear equations for days exceeding 200 and 300 miles as alternative range estimates to account for differences in BEV range and temperature impacts. Beyond the single-feature linear models which readers can apply, the authors tuned and trained other machine learning models on a variety of fueling transaction statistics including consecutive transaction distances, transaction distance from garage, estimated miles traveled from fuel economy and fuel quantity, and transaction periodicity. Utilizing a subset of 1678 light-duty federal fleet vehicles which contained daily vehicle miles traveled (VMT) in addition to fueling statistics, the authors determined which fueling transaction statistics were most relevant in predicting driving days exceeding 250 miles (an approximation of BEV rated driving range). In support of the U.S. federal fleet transition to zero-emission vehicles (ZEVs), the authors used these statistics and machine learning models to predict the frequency of BEV midday charging. After training models on the subset with VMT, the authors predicted days exceeding rated range for 112,902 light-duty vehicles operating in similar circumstances in the federal fleet using a Support Vector Regressor (SVR). In conclusion, they then used the projections as part of the ZEV Planning and Charging (ZPAC) tool to identify optimal candidates for BEVs for the federal fleet. An anonymized version of ZPAC is included in the supplementary materials.

25 ENERGY STORAGE↗
DOE OSTI2023

Using Deep Learning to Develop a High Resolution Planetary Boundary Layer Model for Infrasound Propagation

Infrasound, with frequencies less than 20 Hz, is generated by both natural and anthropogenic sources. When one of these sources exerts a force on the atmosphere, infrasonic waves are generated. The propagation of these waves largely depends on temperature, wind speed, and wind direction. Previous work has used deep learning to accurately predict atmospheric specifications to altitudes of ~40 km. However, this model breaks down for local distances because it is too low resolution. Here we use a high-resolution meteorological dataset collected in Las Vegas, Nevada, USA to develop a deep learning model that can predict temperature, wind speed, and wind direction. Predictions are compared to ground truth observations to show that the model performs well at predicting temperature and wind direction but struggles with prediction wind speed. Model limitations and improvements are also discussed.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

Machine Learning Methods for Connection RTT and Loss Rate Estimation Using MPI Measurements Under Random Losses

Scientific computations are expected to be increasingly distributed across wide-area networks, and Message Passing Interface (MPI) has been shown to scale to support their communications over long distances. Application-level measurements of MPI operations reflect the connection Round-Trip Time (RTT) and loss rate, and machine learning methods have been previously developed to estimate them under deterministic periodic losses. In this paper, we consider more complex, random losses with unform, Poisson and Gaussian distributions. We study five disparate machine leaning methods, with linear and non-linear, and smooth and non-smooth properties, to estimate RTT and loss rate over 10Gbps connections with 0-366ms RTT. The diversity and complexity of these estimators combined with the randomness of losses and TCP’s non-linear response together rule out the selection of a single best among them; instead, we fuse them to retain their design diversity. Overall, the results show that accurate estimates can be generated at low loss rates but become inaccurate at loss rates 10% and higher, thereby illustrating both their strengths and limitations.

Generalization Bounds↗
DOE OSTI2022

DeepAdversaries: examining the robustness of deep learning models for galaxy morphology classification

With increased adoption of supervised deep learning methods for work with cosmological survey data, the assessment of data perturbation effects (that can naturally occur in the data processing and analysis pipelines) and the development of methods that increase model robustness are increasingly important. In the context of morphological classification of galaxies, we study the effects of perturbations in imaging data. In particular, we examine the consequences of using neural networks when training on baseline data and testing on perturbed data. We consider perturbations associated with two primary sources: (a) increased observational noise as represented by higher levels of Poisson noise and (b) data processing noise incurred by steps such as image compression or telescope errors as represented by one-pixel adversarial attacks. We also test the efficacy of domain adaptation techniques in mitigating the perturbation-driven errors. We use classification accuracy, latent space visualizations, and latent space distance to assess model robustness in the face of these perturbations. For deep learning models without domain adaptation, we find that processing pixel-level errors easily flip the classification into an incorrect class and that higher observational noise makes the model trained on low-noise data unable to classify galaxy morphologies. On the other hand, we show that training with domain adaptation improves model robustness and mitigates the effects of these perturbations, improving the classification accuracy up to 23% on data with higher observational noise. Domain adaptation also increases up to a factor of ${\approx}2.3$ the latent space distance between the baseline and the incorrectly classified one-pixel perturbed image, making the model more robust to inadvertent perturbations. Successful development and implementation of methods that increase model robustness in astronomical survey pipelines will help pave the way for many more uses of deep learning for astronomy.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

Improving Spectral Resolution from Real-time Evolution for Correlated Systems

Abstract The quality of numerically simulated spectra using real-time evolution methods for strongly correlated systems is affected by both the length of simulation time and the system size, limiting resolution in both frequency and momentum. In this work, we propose a computationally cheap, linear autoregressive machine learning-based framework to extend short-time and short-distance results over a wider range. We use the proposed method to extend the lesser Green’s function for both the Hubbard model and the much more computationally challenging Hubbard-extended Holstein model. This technique significantly improves both the frequency and momentum resolution of the single-particle removal spectrum $${\mathcal{A}}(k,\omega )$$ A ( k , ω ) , allowing the observation of otherwise obscured spectral features due to electron-phonon coupling.

Tang, Ta↗
DOE OSTI2024

X-ray and molecular dynamics study of the temperature-dependent structure of molten NaF-Zr⁢F 4

The local atomic structure of NaF-Zr⁢F 4 (53–47 mol%) molten system and its evolution with temperature are examined with x-ray scattering measurements which are then used to validate the quality of ab initio and neural network-based molecular dynamics (NNMD) calculations in the temperature range 515–700°⁢C. The machine-learning enhanced NNMD calculations offer improved efficiency while maintaining accuracy at higher distances compared to ab initio calculations. Looking at the evolution of the pair distribution function with increasing temperature, a fundamental change in the liquid structure within the selected temperature range, accompanied by a slight decrease in overall correlation is revealed. NNMD calculations indicate the coexistence of three different fluorozirconate complexes: [Zr⁢F 6 ] 2– , [Zr⁢F 7 ] 3– , and [Zr⁢F 8 ] 4– , with a shift in the dominant coordination state from the 7-coordinated Zr cation toward a 6-coordinated cation with increasing temperature. The study also highlights the metastability of different local coordination structures, with frequent interconversions between the 6- and 7-coordinate states. Analysis of the Zr-F-Zr angular distribution function reveals the presence of both “edge-sharing” and “corner-sharing” fluorozirconate complexes with specific bond angles and distances in accord with previous studies, while the next-nearest-neighbor cation-cation correlations demonstrate a clear preference for unlike cations as nearest-neighbor pairs, emphasizing nonrandom arrangement. Finally, these findings contribute to a comprehensive understanding of the complex local structure of the molten salt, providing insights into temperature-dependent preferences and correlations within the molten system.

36 MATERIALS SCIENCE↗