Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Machine”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 1,477 records · Page 82

A unique, ring-like radio source with quadrilateral structure detected with machine learning

ABSTRACT We report the discovery of a unique object in the MeerKAT Galaxy Cluster Legacy Survey (MGCLS) using the machine learning anomaly detection framework astronomaly. This strange, ring-like source is 30′ from the MGCLS field centred on Abell 209, and is not readily explained by simple physical models. With an assumed host galaxy at redshift 0.55, the luminosity (1025 W Hz−1) is comparable to powerful radio galaxies. The source consists of a ring of emission 175 kpc across, quadrilateral enhanced brightness regions bearing resemblance to radio jets, two ‘ears’ separated by 368 kpc, and a diffuse envelope. All of the structures appear spectrally steep, ranging from −1.0 to −1.5. The ring has high polarization (25 per cent) except on the bright patches (<10 per cent). We compare this source to the Odd Radio Circles recently discovered in ASKAP data and discuss several possible physical models, including a termination shock from starburst activity, an end-on radio galaxy, and a supermassive black hole merger event. No simple model can easily explain the observed structure of the source. This work, as well as other recent discoveries, demonstrates the power of unsupervised machine learning in mining large data sets for scientifically interesting sources.

Astronomy & Astrophysics↗

Revealing the Milky Way’s most recent major merger with a Gaia EDR3 catalogue of machine-learned line-of-sight velocities

Machine learning can play a powerful role in inferring missing line-of-sight velocities from astrometry in surveys such as Gaia. In this paper, we apply a neural network to Gaia Early Data Release 3 (EDR3) and obtain line-of-sight velocities and associated uncertainties for ~92 million stars. The network, which takes as input a star’s parallax, angular coordinates, and proper motions, is trained and validated on ~6.4 million stars in Gaia with complete phase-space information. The network’s uncertainty on its velocity prediction is a key aspect of its design; by properly convolving these uncertainties with the inferred velocities, we obtain accurate stellar kinematic distributions. As a first science application, we use the new network-completed catalogue to identify candidate stars that belong to the Milky Way’s most recent major merger, Gaia-Sausage-Enceladus (GSE). We present the kinematic, energy, angular momentum, and spatial distributions of the ~450 000 GSE candidates in this sample, and also study the chemical abundances of those with cross matches to GALAH and APOGEE. Furthermore, the network’s predictive power will only continue to improve with future Gaia data releases as the training set of stars with complete phase-space information grows. This work provides a first demonstration of how to use machine learning to exploit high-dimensional correlations on data to infer line-of-sight velocities, and offers a template for how to train, validate, and apply such a neural network when complete observational data is not available.

79 ASTRONOMY AND ASTROPHYSICS↗

Data compression and inference in cosmology with self-supervised machine learning

ABSTRACT The influx of massive amounts of data from current and upcoming cosmological surveys necessitates compression schemes that can efficiently summarize the data with minimal loss of information. We introduce a method that leverages the paradigm of self-supervised machine learning in a novel manner to construct representative summaries of massive data sets using simulation-based augmentations. Deploying the method on hydrodynamical cosmological simulations, we show that it can deliver highly informative summaries, which can be used for a variety of downstream tasks, including precise and accurate parameter inference. We demonstrate how this paradigm can be used to construct summary representations that are insensitive to prescribed systematic effects, such as the influence of baryonic physics. Our results indicate that self-supervised machine learning techniques offer a promising new approach for compression of cosmological data as well as its analysis.

Astronomy & Astrophysics↗

Photometric classification of Hyper Suprime-Cam transients using machine learning

Abstract The advancement of technology has resulted in a rapid increase in supernova (SN) discoveries. The Subaru/Hyper Suprime-Cam (HSC) transient survey, conducted from fall 2016 through spring 2017, yielded 1824 SN candidates. This gave rise to the need for fast type classification for spectroscopic follow-up and prompted us to develop a machine learning algorithm using a deep neural network with highway layers. This algorithm is trained by actual observed cadence and filter combinations such that we can directly input the observed data array without any interpretation. We tested our model with a dataset from the LSST classification challenge (Deep Drilling Field). Our classifier scores an area under the curve (AUC) of 0.996 for binary classification (SN Ia or non-SN Ia) and 95.3% accuracy for three-class classification (SN Ia, SN Ibc, or SN II). Application of our binary classification to HSC transient data yields an AUC score of 0.925. With two weeks of HSC data since the first detection, this classifier achieves 78.1% accuracy for binary classification, and the accuracy increases to 84.2% with the full dataset. This paper discusses the potential use of machine learning for SN type classification purposes.

Takahashi, Ichiro↗

Combining Machine Learning and Comparative Effectiveness Methodology to Study Primary Care Pharmacotherapy Pathways for Veterans With Depression

Our objective is to demonstrate an innovative method combining machine learning with comparative effectiveness research techniques and to investigate a hitherto unstudied question about the effectiveness of common prescribing patterns. For Operation Enduring Freedom/Operation Iraqi Freedom veterans with major depressive disorder, we generate pharmacotherapy pathways (of antidepressants) using process mining and machine learning. We select the medication episodes that were started at subtherapeutic doses by the first assigned primary care physician and observe the paths that those medication episodes follow. Using 2-stage least squares, we test the effectiveness of starting at a low dose and staying low for longer versus ramping up fast while balancing observable and unobservable characteristics of patients and providers through instrumental variables. We leverage predetermined provider practice patterns as instruments. We collected outpatient pharmacy data for selective serotonin reuptake inhibitors and selective norepinephrine reuptake inhibitors, patient and provider characteristics (as control variables), and the instruments for our cohort. All data were extracted for the period between 2006 and 2020. There is a statistically significant positive effect (0.68, 95% CI 0.11–1.25) of “ramping up fast” on engagement in care. When we examine the effect of “ramping up slow”, we see an insignificant negative impact on engagement in care (−0.82, 95% CI −1.89 to 0.25). As expected, the probability of drop-out also seems to have a negative effect on engagement in care (−0.39, 95% CI −0.94 to 0.17). We further validate these results by testing with medication possession ratios calculated periodically as an alternative engagement in care metric. Our findings contradict the “Start low, go slow” adage, indicating that ramping up the dose of an antidepressant faster has a significantly positive effect on engagement in care for our population.

60 APPLIED LIFE SCIENCES↗

Realization of a universal and phase-covariant quantum cloning machine in separate cavities

We present a scheme to realize a special quantum cloning machine in separate cavities. The quantum cloning machine can copy the quantum information from a photon pulse to two distant atoms. Choosing the different parameters, the method can perform optimal symmetric (asymmetric) universal quantum cloning and optimal symmetric (asymmetric) phase-covariant cloning.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Modeling Electronic Quantum Transport with Machine Learning

We present a machine learning approach to solve electronic quantum transport equations of one-dimensional nanostructures. The transmission coefficients of disordered systems were computed to provide training and test data sets to the machine. The system’s representation encodes energetic as well as geometrical information to characterize similarities between disordered configurations, while the Euclidean norm is used as a measure of similarity. Errors for out-of-sample predictions systematically decrease with training set size, enabling the accurate and fast prediction of new transmission coefficients. The remarkable performance of our model to capture the complexity of interference phenomena lends further support to its viability in dealing with transport problems of undulatory nature.

97 MATHEMATICS AND COMPUTING↗

Machine learning for many-body physics: The case of the Anderson impurity model

We applied machine learning methods in order to find the Green's function of the Anderson impurity model, a basic model system of quantum many-body condensed-matter physics. Furthermore, different methods of parametrizing the Green's function are investigated; a representation in terms of Legendre polynomials is found to be superior due to its limited number of coefficients and its applicability to state of the art methods of solution. The dependence of the errors on the size of the training set is determined. Our results indicate that a machine learning approach to dynamical mean-field theory may be feasible.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Machine learning for molecular dynamics with strongly correlated electrons

We use machine learning to enable large-scale molecular dynamics (MD) of a correlated electron model under the Gutzwiller approximation scheme. This model exhibits a Mott transition as a function of on-site Coulomb repulsion U . The repeated solution of the Gutzwiller self-consistency equations would be prohibitively expensive for large-scale MD simulations. We show that machine learning models of the Gutzwiller potential energy can be remarkably accurate. The models, which are trained with N = 33 atoms, enable highly accurate MD simulations at much larger scales ( N ≳10 3 ). Here, we investigate the physics of the smooth Mott crossover in the fluid phase.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Characterizing different motility-induced regimes in active matter with machine learning and noise

Here we examine motility-induced phase separation (MIPS) in two-dimensional run-and-tumble disk systems using both machine learning and noise fluctuation analysis. Our measures suggest that within the MIPS state there are several distinct regimes as a function of density and run time, so that systems with MIPS transitions exhibit an active fluid, an active crystal, and a critical regime. The different regimes can be detected by combining an order parameter extracted from principal component analysis with a cluster stability measurement. The principal component-derived order parameter is maximized in the critical regime, remains low in the active fluid, and has an intermediate value in the active crystal regime. We demonstrate that machine learning can better capture dynamical properties of the MIPS regimes compared to more standard structural measures such as the maximum cluster size. The different regimes can also be characterized via changes in the noise power of the fluctuations in the average speed. In the critical regime, the noise power passes through a maximum and has a broad spectrum with a 1/f 1.6 signature, similar to the noise observed near depinning transitions or for solids undergoing plastic deformation.

97 MATHEMATICS AND COMPUTING↗

Time-Resolved Line Shapes of Single Quantum Emitters via Machine Learned Photon Correlations

Solid-state single-photon emitters (SPEs) are quantum light sources that combine atomlike optical properties with solid-state integration and fabrication capabilities. SPEs are hindered by spectral diffusion, where the emitter’s surrounding environment induces random energy fluctuations. Timescales of spectral diffusion span nanoseconds to minutes and require probing single emitters to remove ensemble averaging. Photon correlation Fourier spectroscopy (PCFS) can be used to measure time-resolved single emitter line shapes, but is hindered by poor signal-to-noise ratio in the measured correlation functions at early times due to low photon counts. Here, we develop a framework to simulate PCFS correlation functions directly from diffusing spectra that match well with experimental data for single colloidal quantum dots. We use these simulated datasets to train a deep ensemble autoencoder machine learning model that outputs accurate, noiseless, and probabilistic reconstructions of the noisy correlations. Using this model, we obtain reconstructed time-resolved single dot emission line shapes at timescales as low as 10 ns, which are otherwise completely obscured by noise. This enables PCFS to extract optical coherence times on the same timescales as Hong-Ou-Mandel two-photon interference, but with the advantage of providing spectral information in addition to estimates of photon indistinguishability. Further, our machine learning approach is broadly applicable to different photon correlation spectroscopy techniques and SPE systems, offering an enhanced tool for probing single emitter line shapes on previously inaccessible timescales.

74 ATOMIC AND MOLECULAR PHYSICS↗

Machine learning-accelerated discovery of iron cobalt phosphides as rare-earth-free magnets

Here, the discovery of rare-earth-free permanent magnets has been a goal of scientists for decades. The absence of rare-earth elements will alleviate a pressing concern about the availability of rare-earth elements used in permanent magnets. These magnets are crucial for applications such as wind turbines, electric cars, and memory devices. Rare-earth magnets are special owing to a large magnetic anisotropy energy (K 1 ). In contrast, iron cobalt phosphides hold promise since doping P into cubic FeCo can induce anisotropy, leading to a large coercivity, without introducing rare-earth elements. We present a comprehensive search over the Fe-Co-P ternary space for magnets, utilizing recently developed adaptive machine learning feedback to efficiently screen over 850 000 structures. We focus on machine learning acceleration as a paradigm for materials design. Further adaptive genetic algorithm searches and first-principles calculations aid in the identification of 16 new structures below the known convex hull. Five of them possess high magnetic polarization (J s > 1 T). The structures with desirable magnetic properties center on (Fe,Co) 2⁢ P. This supports conventional wisdom, which focuses on the mixture of the two known end compounds: Fe 2 ⁢P and Co 2 ⁢P. Our work provides guidance for synthesis. We find Fe 7 ⁢CoP 4 shows the most promise (J s = 1.03T and K 1 = 0.83MJ/m 3 ).

36 MATERIALS SCIENCE↗

Dynamical simulation via quantum machine learning with provable generalization

Much attention has been paid to dynamical simulation and quantum machine learning (QML) independently as applications for quantum advantage, while the possibility of using QML to enhance dynamical simulations has not been thoroughly investigated. Here we develop a framework for using QML methods to simulate quantum dynamics on near-term quantum hardware. We use generalization bounds, which bound the error a machine learning model makes on unseen data, to rigorously analyze the training data requirements of an algorithm within this framework. Our algorithm is thus resource efficient in terms of qubit and data requirements. Furthermore, our preliminary numerics for the XY model exhibit efficient scaling with problem size, and we simulate 20 times longer than Trotterization on IBMQ-Bogota. Published by the American Physical Society 2024

97 MATHEMATICS AND COMPUTING↗

Quantifying uncertainty in machine learning for nuclear binding energy

Techniques from artificial intelligence and machine learning are increasingly employed in nuclear theory; however, the uncertainties that arise from the complex parameter manifold encoded by the neural networks are often overlooked. Epistemic uncertainties arising from training the same network multiple times for an ensemble of initial weight sets offer a first insight into the confidence of machine learning predictions, but they often come with a high computational cost. Instead, we apply a single-model uncertainty quantification method called Δ-UQ that gives epistemic uncertainties with one-time training. Here, we demonstrate our approach on a two-feature model of nuclear binding energies per nucleon with proton and neutron number pairs as inputs. We show that Δ-UQ can produce reliable and self-consistent epistemic uncertainty estimates and can be used to assess the degree of confidence in predictions made with deep neural networks.

Huang, Mengyao [Lawrence Livermore National Labora↗

Elements in nucleotide sensing and hydrolysis of the AAA+ disaggregation machine ClpB: a structure-based mechanistic dissection of a molecular motor

High-resolution crystal structures together with mutational analysis and transient kinetics experiments were utilized to understand nucleotide sensing and the regulation of the ATPase cycle in an AAA+ molecular motor. ATPases of the AAA+ superfamily are large oligomeric molecular machines that remodel their substrates by converting the energy from ATP hydrolysis into mechanical force. This study focuses on the molecular chaperone ClpB, the bacterial homologue of Hsp104, which reactivates aggregated proteins under cellular stress conditions. Based on high-resolution crystal structures in different nucleotide states, mutational analysis and nucleotide-binding kinetics experiments, the ATPase cycle of the C-terminal nucleotide-binding domain (NBD2), one of the motor subunits of this AAA+ disaggregation machine, is dissected mechanistically. The results provide insights into nucleotide sensing, explaining how the conserved sensor 2 motif contributes to the discrimination between ADP and ATP binding. Furthermore, the role of a conserved active-site arginine (Arg621), which controls binding of the essential Mg{sup 2+} ion, is described. Finally, a hypothesis is presented as to how the ATPase activity is regulated by a conformational switch that involves the essential Walker A lysine. In the proposed model, an unusual side-chain conformation of this highly conserved residue stabilizes a catalytically inactive state, thereby avoiding unnecessary ATP hydrolysis.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Integrating machine learning interatomic potentials with hybrid reverse Monte Carlo structure refinements in RMCProfile

Structure refinement with reverse Monte Carlo (RMC) is a powerful tool for interpreting experimental diffraction data. To ensure that the under-constrained RMC algorithm yields reasonable results, the hybrid RMC approach applies interatomic potentials to obtain solutions that are both physically sensible and in agreement with experiment. To expand the range of materials that can be studied with hybrid RMC, we have implemented a new interatomic potential constraint in RMCProfile that grants flexibility to apply potentials supported by the Large-scale Atomic/Molecular Massively Parallel Simulator ( LAMMPS ) molecular dynamics code. This includes machine learning interatomic potentials, which provide a pathway to applying hybrid RMC to materials without currently available interatomic potentials. To this end, we present a methodology to use RMC to train machine learning interatomic potentials for hybrid RMC applications.

Cuillier, Paul↗

Fast and Accurate Support Vector Machines on Large Scale Systems

Support Vector Machines (SVM) is a supervised Machine Learning and Data Mining (MLDM) algorithm, which has become ubiquitous largely due to its high accuracy and obliviousness to dimensionality. The objective of SVM is to find an optimal boundary --- also known as hyperplane --- which separates the samples (examples in a dataset) of different classes by a maximum margin. Usually, very few samples contribute to the definition of the boundary. However, existing parallel algorithms use the entire dataset for finding the boundary, which is sub-optimal for performance reasons. In this paper, we propose a novel distributed memory algorithm to eliminate the samples which do not contribute to the boundary definition in SVM. We propose several heuristics, which range from early (aggressive) to late (conservative) elimination of the samples, such that the overall time for generating the boundary is reduced considerably. In a few cases, a sample may be eliminated (shrunk) pre-emptively --- potentially resulting in an incorrect boundary. We propose a scalable approach to synchronize the necessary data structures such that the proposed algorithm maintains its accuracy. We consider the necessary trade-offs of single/multiple synchronization using in-depth time-space complexity analysis. We implement the proposed algorithm using MPI and compare it with libsvm--- de facto sequential SVM software --- which we enhance with OpenMP for multi-core/many-core parallelism. Our proposed approach shows excellent efficiency using up to 4096 processes on several large datasets such as UCI HIGGS Boson dataset and Offending URL dataset.

Vishnu, Abhinav↗

MACORD: Online Adaptive Machine Learning Framework for Silent Error Detection

Future HPC systems with ever-increasing resource capacity (such as compute cores, memory and storage) may significantly increase the risks on reliability. Silent data corruptions (SDCs) or silent errors are one of the major sources that corrupt HPC execution results. Unlike fail-stop errors, SDCs are rather harmful and dangerous in that they cannot be detected by hardware. We propose an online machine-learning based silent data corruption detection framework (abbreviated as MACORD) for detecting SDCs in HPC applications. In particular, we comprehensively investigate the prediction ability of a multitude of machine-learning algorithms in our study, and enable the detector to automatically select the best-fit algorithms at runtime to adapt to the data dynamics. Our learning framework exhibits low memory overhead (less than 1%), since it takes only spatial features (i.e., neighboring data values for each data point in the current time step) into the training data. Experiments based on real-world scientific applications/benchmarks show that our framework can get the detection sensitivity (i.e., recall) up to 99% while the false positive rate is limited to 0.1% in most cases, which is one order of magnitude improvement compared with the latest state-of-art spatial technique.

Subasi, Omer↗