Search NASA⌕ Search

SEARCH · Search NASA

Results for “Machine learning algorithm”

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

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

At least 1,243 records · Page 69

Resonant di-Higgs production at gravitational wave benchmarks: a collider study using machine learning

We perform a complementarity study of gravitational waves and colliders in the context of electroweak phase transitions choosing as our template the xSM model, which consists of the Standard Model augmented by a real scalar. We carefully analyze the gravitational wave signal at benchmark points compatible with a first order phase transition, taking into account subtle issues pertaining to the bubble wall velocity and the hydrodynamics of the plasma. In particular, we comment on the tension between requiring bubble wall velocities small enough to produce a net baryon number through the sphaleron process, and large enough to obtain appreciable gravitational wave production. For the most promising benchmark models, we study resonant di-Higgs production at the high-luminosity LHC using machine learning tools: a Gaussian process algorithm to jointly search for optimum cut thresholds and tuning hyperparameters, and a boosted decision trees algorithm to discriminate signal and background. The multivariate analysis on the collider side is able either to discover or provide strong statistical evidence of the benchmark points, opening the possibility for complementary searches for electroweak phase transitions in collider and gravitational wave experiments.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Deep neural network improves the estimation of polygenic risk scores for breast cancer

Polygenic risk scores (PRS) estimate the genetic risk of an individual for a complex disease based on many genetic variants across the whole genome. Here, we compared a series of computational models for estimation of breast cancer PRS. A deep neural network (DNN) was found to outperform alternative machine learning techniques and established statistical algorithms, including BLUP, BayesA, and LDpred. In the test cohort with 50% prevalence, the Area Under the receiver operating characteristic Curve (AUC) were 67.4% for DNN, 64.2% for BLUP, 64.5% for BayesA, and 62.4% for LDpred. BLUP, BayesA, and LPpred all generated PRS that followed a normal distribution in the case population. However, the PRS generated by DNN in the case population followed a bimodal distribution composed of two normal distributions with distinctly different means. This suggests that DNN was able to separate the case population into a high-genetic-risk case subpopulation with an average PRS significantly higher than the control population and a normal-genetic-risk case subpopulation with an average PRS similar to the control population. This allowed DNN to achieve 18.8% recall at 90% precision in the test cohort with 50% prevalence, which can be extrapolated to 65.4% recall at 20% precision in a general population with 12% prevalence. Interpretation of the DNN model identified salient variants that were assigned insignificant p values by association studies, but were important for DNN prediction. These variants may be associated with the phenotype through nonlinear relationships.

59 BASIC BIOLOGICAL SCIENCES↗

Distributed quantum approximate optimization algorithm on a quantum-centric supercomputing architecture

Quantum approximate optimization algorithm (QAOA) has shown promise in solving combinatorial optimization problems by providing quantum speedup on near-term gate-based quantum computing systems. However, QAOA faces challenges for high-dimensional problems due to the large number of qubits required and the complexity of deep circuits, limiting its scalability for real-world applications. In this study, we present a distributed QAOA (DQAOA), which leverages distributed computing strategies to decompose a large computational workload into smaller tasks that require fewer qubits and shallower circuits than are necessary to solve the original problem. These sub-problems are processed using a combination of high-performance and quantum computing resources. The global solution is iteratively updated by aggregating sub-solutions, allowing convergence toward the optimal solution. We demonstrate that DQAOA can handle considerably large-scale optimization problems (e.g., 1000-bit problem), achieving a high solution quality and short time-to-solution, outperforming existing strategies. Furthermore, we realize DQAOA on a quantum-centric supercomputing architecture, paving the way for practical applications of gate-based quantum computers in real-world optimization tasks. To extend DQAOA’s applicability to materials science, we further develop an active learning algorithm integrated with our DQAOA (AL-DQAOA), which involves machine learning, DQAOA, and active data production in an iterative loop. We successfully optimize photonic structures using AL-DQAOA, indicating that solving real-world optimization problems using gate-based quantum computing is feasible. We expect the proposed DQAOA to be applicable to a wide range of optimization problems and AL-DQAOA to find broader applications in material design.

Kim, Seongmin [ORNL] (ORCID:0000000159063004)↗

GANALYZER: A TOOL FOR AUTOMATIC GALAXY IMAGE ANALYSIS

We describe Ganalyzer, a model-based tool that can automatically analyze and classify galaxy images. Ganalyzer works by separating the galaxy pixels from the background pixels, finding the center and radius of the galaxy, generating the radial intensity plot, and then computing the slopes of the peaks detected in the radial intensity plot to measure the spirality of the galaxy and determine its morphological class. Unlike algorithms that are based on machine learning, Ganalyzer is based on measuring the spirality of the galaxy, a task that is difficult to perform manually, and in many cases can provide a more accurate analysis compared to manual observation. Ganalyzer is simple to use, and can be easily embedded into other image analysis applications. Another advantage is its speed, which allows it to analyze {approx}10,000,000 galaxy images in five days using a standard modern desktop computer. These capabilities can make Ganalyzer a useful tool in analyzing large data sets of galaxy images collected by autonomous sky surveys such as SDSS, LSST, or DES. The software is available for free download at http://vfacstaff.ltu.edu/lshamir/downloads/ganalyzer, and the data used in the experiment are available at http://vfacstaff.ltu.edu/lshamir/downloads/ganalyzer/GalaxyImages.zip.

79 ASTRONOMY AND ASTROPHYSICS↗

The PAU Survey: narrow-band photometric redshifts using Gaussian processes

Here, we study the performance of the hybrid template machine learning photometric redshift (photo- z ) algorithm delight , which uses Gaussian processes, on a subset of the early data release of the Physics of the Accelerating Universe Survey (PAUS). We calibrate the fluxes of the 40 PAUS narrow bands with six broad-band fluxes ( uBVriz ) in the Cosmic Evolution Survey (COSMOS) field using three different methods, including a new method that utilizes the correlation between the apparent size and overall flux of the galaxy. We use a rich set of empirically derived galaxy spectral templates as guides to train the Gaussian process, and we show that our results are competitive with other standard photometric redshift algorithms. delight achieves a photo- z 68th percentile error of σ 68 = 0.0081(1 + z ) without any quality cut for galaxies with i auto < 22.5 as compared to 0.0089(1 + z ) and 0.0202(1 + z ) for the bpz and annz 2 codes, respectively. delight is also shown to produce more accurate probability distribution functions for individual redshift estimates than bpz and annz 2. Common photo- z outliers of delight and bcnz 2 (previously applied to PAUS) are found to be primarily caused by outliers in the narrow-band fluxes, with a small number of cases potentially indicating spectroscopic redshift failures in the reference sample. In the process, we introduce performance metrics derived from the results of bcnz 2 and delight , allowing us to achieve a photo- z quality of σ 68 < 0.0035(1 + z ) at a magnitude of i auto < 22.5 while keeping 50 per cent objects of the galaxy sample.

79 ASTRONOMY AND ASTROPHYSICS↗

Deep ugrizY imaging and DEEP2/3 spectroscopy: a photometric redshift testbed for LSST and public release of data from the DEEP3 Galaxy Redshift Survey

ABSTRACT We present catalogues of calibrated photometry and spectroscopic redshifts in the Extended Groth Strip, intended for studies of photometric redshifts (photo-z’s). The data includes ugriz photometry from Canada–France–Hawaii Telescope Legacy Survey (CFHTLS) and Y-band photometry from the Subaru Suprime camera, as well as spectroscopic redshifts from the DEEP2, DEEP3, and 3D-HST surveys. These catalogues incorporate corrections to produce effectively matched-aperture photometry across all bands, based upon object size information available in the catalogue and Moffat profile point spread function fits. We test this catalogue with a simple machine learning-based photometric redshift algorithm based upon Random Forest regression, and find that the corrected aperture photometry leads to significant improvement in photo-z accuracy compared to the original SExtractor catalogues from CFHTLS and Subaru. The deep ugrizY photometry and spectroscopic redshifts are well suited for empirical tests of photometric redshift algorithms for LSST. The resulting catalogues are publicly available at http://d-scholarship.pitt.edu/36064/. We include a basic summary of the strategy of the DEEP3 Galaxy Redshift Survey to accompany the recent public release of DEEP3 data.

79 ASTRONOMY AND ASTROPHYSICS↗

Evidence for $CP$ violation and measurement of $CP$-violating parameters in B$^0_\mathrm{s}$ $\to$ J/$\psi\,\phi$(1020) decays in pp collisions at $\sqrt{s} =$ 13 TeV

A pioneering machine-learning-based flavor-tagging algorithm combining same-side and opposite-side tagging is used to obtain the equivalent of 27$\,$000 tagged B$^0_\mathrm{s}$$\to$ J/$\psi\, \phi$(1020) decays from pp collisions at $\sqrt{s} =$ 13 TeV, collected by the CMS experiment and corresponding to an integrated luminosity of 96.5 fb$^{-1}$. A time- and flavor-dependent angular analysis of the $\mu^+\mu^-$K$^+$K$^-$ final state is used to measure parameters of the $\mathrm{B}^0_\mathrm{s}$-$\overline{\mathrm{B}}^0_\mathrm{s}$ system. The weak phase is measured to be $\phi_\mathrm{s}$ = $-$73 $\pm$ 23 (stat) $\pm$ 7 (syst) mrad, which, combined with a $\sqrt{s}$ = 8 TeV CMS result, gives $\phi_\mathrm{s}$ = $-$74 $\pm$ 23 mrad. This value differs from zero by 3.2 standard deviations, providing evidence for $CP$ violation in B$^0_\mathrm{s}$$\to$ J/$\psi\,\phi$(1020) decays. All measured physics parameters are found to agree with standard model predictions where available.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Reconstruction of beam parameters and betatron radiation spectra measured with a Compton spectrometer

The photon flux resulting from high-energy electron beam interactions with high-field systems, such as those found in the upcoming FACET-II experiments at the SLAC National Accelerator Laboratory, yields deep insight into the electron beam’s underlying dynamics during the interaction. However, extracting this information is an intricate process. To demonstrate how to approach this challenge using modern methods, this paper utilizes simulated data that models plasma wakefield acceleration-derived betatron radiation in experiments to determine reliable methods of reconstructing key beam and beam-plasma interaction properties. For betatron radiation measurements, translating the observed 200⁢ keV to 30⁢ MeV photon double-differential energy-angle spectra obtained from an advanced Compton spectrometer requires testing multiple methods to optimize the pipeline from its response to incident electron beam information. The paper compares maximum likelihood estimation and machine learning to refine the translation of photon spectra into precise electron beam metrics, such as spot size, energy, and emittance, enhancing the understanding of beam behavior within these dense, high-field environments. We also introduce machine learning and the expected maximization algorithm to reconstruct the primary photon spectrum, employing a multilayer neural network for regression analysis of the energy and angle spectra. With appropriate modifications, the advanced methods reproduce relevant incident beam parameters with high accuracy, even for beam sizes in the <10 μ⁢m range. This capacity is critical to understanding intense beam propagation and its optimization in plasma.

Beam code development & simulation techniques↗

First measurement of Λ c + production down to p T = 0 in p p and p -Pb collisions at s N N = 5.02 TeV

The production of prompt $Λ_{c}^{+}$ baryons has been measured at midrapidity in the transverse momentum interval 0 < p T < 1 GeV/c for the first time, in pp and p–Pb collisions at a center-of-mass energy per nucleon-nucleon collision $\sqrt{s_{NN}}$ = 5.02 TeV . The measurement was performed in the decay channel $Λ_{c}^{+}$ → p$K_{S}^{0}$ by applying new decay reconstruction techniques using a Kalman-Filter vertexing algorithm and adopting a machine-learning approach for the candidate selection. The p T -integrated $Λ_{c}^{+}$ production cross sections in both collision systems were determined and used along with the measured yields in Pb–Pb collisions to compute the p T -integrated nuclear modification factors R pPb and R AA of $Λ_{c}^{+}$ baryons, which are compared to model calculations that consider nuclear modification of the parton distribution functions. The $Λ_{c}^{+}$/D 0 baryon-to-meson yield ratio is reported for pp and p–Pb collisions. Comparisons with models that include modified hadronization processes are presented, and the implications of the results on the understanding of charm hadronization in hadronic collisions are discussed. A significant (3.7σ) modification of the mean transverse momentum of $Λ_{c}^{+}$ baryons is seen in p –Pb collisions with respect to pp collisions, while the p T -integrated $Λ_{c}^{+}$/D 0 yield ratio was found to be consistent between the two collision systems within the uncertainties.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Adaptive Neuron Apoptosis for Accelerating Deep Learning on Large Scale Systems

Machine Learning and Data Mining (MLDM) algorithms are becoming ubiquitous in {\em model learning} from the large volume of data generated using simulations, experiments and handheld devices. Deep Learning algorithms -- a class of MLDM algorithms -- are applied for automatic feature extraction, and learning non-linear models for unsupervised and supervised algorithms. Naturally, several libraries which support large scale Deep Learning -- such as TensorFlow and Caffe -- have become popular. In this paper, we present novel techniques to accelerate the convergence of Deep Learning algorithms by conducting low overhead removal of redundant neurons -- {\em apoptosis} of neurons -- which do not contribute to model learning, during the training phase itself. We provide in-depth theoretical underpinnings of our heuristics (bounding accuracy loss and handling apoptosis of several neuron types), and present the methods to conduct adaptive neuron apoptosis. We implement our proposed heuristics with the recently introduced TensorFlow and using its recently proposed extension with MPI. Our performance evaluation on two difference clusters -- one connected with Intel Haswell multi-core systems, and other with nVIDIA GPUs -- using InfiniBand, indicates the efficacy of the proposed heuristics and implementations. Specifically, we are able to improve the training time for several datasets by 2-3x, while reducing the number of parameters by 30x (4-5x on average) on datasets such as ImageNet classification. For the Higgs Boson dataset, our implementation improves the accuracy (measured by Area Under Curve (AUC)) for classification from 0.88/1 to 0.94/1, while reducing the number of parameters by 3x in comparison to existing literature, while achieving a 2.44x speedup in comparison to the default (no apoptosis) algorithm.

Siegel, Charles M.↗

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↗

Hpc Natural Language Understanding (nlu) Dataset

This code provides natural language annotation and labels for multiple activities in high performance. The purpose is to enable machine learning for natural language processing algorithms with high performance computing systems.

Biggs, BrandonS↗

EMSL-Computing/PeakDecoder

PeakDecoder is a machine learning (ML)-based metabolite identification algorithm for multidimensional mass spectrometry measurements incorporating liquid chromatography (LC) and ion mobility spectrometry (IM) separations, and collecting extensive fragmentation spectra with data-independent acquisition (DIA) methods: LC-IM-DIA-MS. The algorithm learns to distinguish true co-elution and co-mobility from raw data and calculates metabolite identification error rates.

Bilbao Pena, Aivett↗

Simultaneously improving accuracy and computational cost under parametric constraints in materials property prediction tasks

Abstract Modern data mining techniques using machine learning (ML) and deep learning (DL) algorithms have been shown to excel in the regression-based task of materials property prediction using various materials representations. In an attempt to improve the predictive performance of the deep neural network model, researchers have tried to add more layers as well as develop new architectural components to create sophisticated and deep neural network models that can aid in the training process and improve the predictive ability of the final model. However, usually, these modifications require a lot of computational resources, thereby further increasing the already large model training time, which is often not feasible, thereby limiting usage for most researchers. In this paper, we study and propose a deep neural network framework for regression-based problems comprising of fully connected layers that can work with any numerical vector-based materials representations as model input. We present a novel deep regression neural network, iBRNet, with branched skip connections and multiple schedulers, which can reduce the number of parameters used to construct the model, improve the accuracy, and decrease the training time of the predictive model. We perform the model training using composition-based numerical vectors representing the elemental fractions of the respective materials and compare their performance against other traditional ML and several known DL architectures. Using multiple datasets with varying data sizes for training and testing, We show that the proposed iBRNet models outperform the state-of-the-art ML and DL models for all data sizes. We also show that the branched structure and usage of multiple schedulers lead to fewer parameters and faster model training time with better convergence than other neural networks. Scientific contribution: The combination of multiple callback functions in deep neural networks minimizes training time and maximizes accuracy in a controlled computational environment with parametric constraints for the task of materials property prediction.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Scalable and Energy-Efficient Methods for Interactive Exploration of Scientific Data

The main scientific contributions of this project are the following novel concepts for multidimensional arrays: shape-based similarity join (SIGMOD 2016), incremental view maintenance (SIGMOD 2017), user-defined stencil functions (HPDC 2017), and distributed caching for in-situ processing (SSDBM 2018). Building on our collaboration with the astrophysics group at LBNL, we applied these techniques to the data generated in the Palomar Transient Factory (PTF) astronomical survey. They played a pivotal role in the first-ever observation of a neutron star merger, which produces gravitational waves and turns out to be the origin of heavy elements, including gold. This has lead to a Science magazine article that has received extensive media coverage on ACM TechNews, Slashdot, FiveThirtyEight, and Quanta Magazine, among others. Additionally, two other articles detailing related aspects of the same discovery have been published in the Astrophysical Journal Letters journal. These publications have more than 3,000 citations according to Google Scholar (as of February 2022). This cross-disciplinary collaboration provided very good opportunities to apply database techniques to real-life scientific problems. The fact that they facilitated major discoveries in astrophysics proves the importance of our research. In addition to the work on multidimensional array databases, this project has also developed stochastic gradient descent (SGD) optimization algorithms for training large scale machine learning models, methods for querying in-situ data, and a database query optimizer based on sketch synopses.

79 ASTRONOMY AND ASTROPHYSICS↗

Smart Pixels: In-pixel AI for on-sensor data filtering

We present a smart pixel prototype readout integrated circuit (ROIC) designed in CMOS 28 nm bulk process, with in-pixel implementation of an artificial intelligence (AI) / machine learning (ML) based data filtering algorithm designed as proof-of-principle for a Phase III upgrade at the Large Hadron Collider (LHC) pixel detector. The first version of the ROIC consists of two matrices of 256 smart pixels, each 25$\times$25 µm\textsuperscript{2} in size. Each pixel consists of a charge-sensitive preamplifier with leakage current compensation and three auto-zero comparators for a 2-bit flash-type ADC. The frontend is capable of synchronously digitizing the sensor charge within 25 ns. Measurement results show an equivalent noise charge (ENC) of $\sim$30e\textsuperscript{-} and a total dispersion of $\sim$100e\textsuperscript{-} The second version of the ROIC uses a fully connected two-layer neural network (NN) to process information from a cluster of 256 pixels to determine if the pattern corresponds to highly desirable high-momentum particle tracks for selection and readout. The digital NN is embedded in-between analog signal processing regions of the 256 pixels without increasing the pixel size and is implemented as fully combinatorial digital logic to minimize power consumption and eliminate clock distribution, and is active only in the presence of an input signal. The total power consumption of the neural network is $\sim$ 300 $\mu$W. The NN performs momentum classification based on the generated cluster patterns and even with a modest momentum threshold, it is capable of 54.4\% – 75.4\% total data rejection, opening the possibility of using the pixel information at 40MHz for the trigger. The total power consumption of analog and digital functions per pixel is $\sim$ 6 $\mu$W per pixel, which corresponds to $\sim$ 1 W/cm\textsuperscript{2} staying within the experimental constraints.

Parpillon, Benjamin↗

Performance and physics measurements at protoDUNE-SP

The protoDUNE Single Phase (protoDUNE-SP) TPC is a prototype for the DUNE far detector and it is currently under construction at CERN. It will not only serve as a test-bed for the engineering design and construction techniques but will also provide a set of key measurements for the future DUNE far detector.The new extension of the H4 beam-line at CERN will provide electron, muon and hadron beams with energies in the range of sub-GeV to a few GeV. The data collected during the test beams will be analysed to assess the performance of a state-of-the-art LAr TPC. For such detectors the event reconstruction is challenging and test beam data will allow the performance of the different reconstruction algorithms, which also involve machine-learning techniques, to be benchmarked and improved. Furthermore, important physics measurements are foreseen with protoDUNE-SP. For example, the study of pion interactions in argon using test beams is fundamental to understand some of the processes that will be seen as part of the primary neutrino interactions and which would modify the event signature in the DUNE detectors. ProtoDUNE-SP will provide new measurements of the pion-Ar cross-section, for both positive and negative charges, which will make a vital contribution to improve the current, very limited knowledge of such interactions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗