Supervised jet clustering with graph neural networks for Lorentz boosted bosons
Not Available
SEARCH · Search NASA
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.
Not Available
Over the past several decades, electron and scanning probe microscopes have become critical components of condensed matter physics, materials science and chemistry research. At the same time, the infrastructure for establishing a connection between microscopy observations and materials behaviour over a broader parameter space is lacking. In this work, we introduce AtomAI, an open-source software package bridging instrument-specific Python libraries, deep learning and simulation tools into a single ecosystem. AtomAI allows direct applications of deep neural networks for atomic and mesoscopic image segmentation converting image and spectroscopy data into class-based local descriptors for downstream tasks such as statistical and graph analysis. For atomically resolved imaging data, the output is types and positions of atomic species, with an option for subsequent refinement. AtomAI further allows the implementation of a broad range of image and spectrum analysis functions, including invariant variational autoencoders for disentangling structural factors of variation and im2spec type of encoder–decoder models for mapping structure–property relationships. Finally, our framework allows seamless connection to the first principles modelling with a Python interface on the inferred atomic positions.
Because collecting precise and accurate chemistry data is often challenging, chemistry data sets usually only span a small region of chemical space, which limits the performance and the scope of applicability of data-driven models. To address this issue, we integrated an active learning machine with automatic ab initio calculations to form a self-evolving model that can continuously adapt to new species appointed by the users. In the present work, we demonstrate the self-evolving concept by modeling the formation enthalpies of stable closed-shell polycyclic species calculated at the B3LYP/6-31G(2df,p) level of theory. By combining a molecular graph convolutional neural network with a dropout training strategy, the model we developed can predict density functional theory (DFT) enthalpies for a broad range of polycyclic species and assess the quality of each predicted value. For the species which the current model is uncertain about, the automatic ab initio calculations provide additional training data to improve the performance of the model. For a test set composed of 2858 cyclic and polycyclic hydrocarbons and oxygenates, the enthalpies predicted by the model agree with the reference DFT values with a root-mean-square error of 2.62 kcal/mol. Finally, we found that a model originally trained on hydrocarbons and oxygenates can broaden its prediction coverage to nitrogen-containing species via an active learning process, suggesting that the continuous learning strategy is not only able to improve the model accuracy but is also capable of expanding the predictive capacity of a model to unseen species domains.
DLSIA (Deep Learning for Scientific Image Analysis) is a Python-based machine learning library that empowers scientists and researchers across diverse scientific domains with a range of customizable convolutional neural network (CNN) architectures for a wide variety of tasks in image analysis to be used in downstream data processing. DLSIA features easy-to-use architectures, such as autoencoders, tunable U-Nets and parameter-lean mixed-scale dense networks (MSDNets). Additionally, this article introduces sparse mixed-scale networks (SMSNets), generated using random graphs, sparse connections and dilated convolutions connecting different length scales. For verification, several DLSIA-instantiated networks and training scripts are employed in multiple applications, including inpainting for X-ray scattering data using U-Nets and MSDNets, segmenting 3D fibers in X-ray tomographic reconstructions of concrete using an ensemble of SMSNets, and leveraging autoencoder latent spaces for data compression and clustering. As experimental data continue to grow in scale and complexity, DLSIA provides accessible CNN construction and abstracts CNN complexities, allowing scientists to tailor their machine learning approaches, accelerate discoveries, foster interdisciplinary collaboration and advance research in scientific image analysis.
Graph-of-words is a flexible and efficient text representation which addresses well-known challenges, such as word ordering and variation of expressions, to natural language processing. In this paper, we consider the latest graph-based convolutional neural network technique, the Text Graph Convolutional Network (Text GCN), in the context of performing classification tasks on free-form natural language texts. To do this, we designed a study of multi-task information extraction from medical text documents. We implemented multi-task learning in the Text GCN, performed hyperparameter optimization, and measured the clinical task performances. We evaluated micro and macro-F1 scores of four information extraction tasks, including subsite, laterality, behavior, and histological grades from cancer pathology reports. The scores for the Text GCN significantly outperformed our previous studies with convolutional neural networks, suggesting that the Text GCN model is superior to traditional models in task performance.
In the Turbine Branch, scientists carry out experimental and computational work to advance the efficiency and diminish the noise production of jet engine turbines. One way to do this is by decreasing the heat that the turbine blades receive. Most of the experimental work is carried out by taking a single turbine blade and analyzing the air flow patterns around it, because this data indicates the sections of the turbine blade that are getting too hot. Since the cost of doing turbine blade air flow experiments is very high, researchers try to do computational work that fits the experimental data. The goal of computational fluid dynamics is for scientists to find a numerical way to predict the complex flow patterns around different turbine blades without physically having to perform tests or costly experiments. When visualizing flow patterns, scientists need a way to represent the flow conditions around a turbine blade. A researcher will assign specific zones that surround the turbine blade. In a two-dimensional view, the zones are usually quadrilaterals. The next step is to assign boundary conditions which define how the flow enters or exits one side of a zone. way of setting up computational zones and grids, visualizing flow patterns, and storing all the flow conditions in a file on the computer for future computation. Such a program is necessary because the only method for creating flow pattern graphs is by hand, which is tedious and time-consuming. By using a computer program to create the zones and grids, the graph would be faster to make and easier to edit. Basically, the user would run a program that is an editable graph. The user could click and drag with the mouse to form various zones and grids, then edit the locations of these grids, add flow and boundary conditions, and finally save the graph for future use and analysis. My goal this summer is to create a graphical user interface (GUI) that incorporates all of these elements. I am writing the program in Java, a language that is portable among platforms, because it can run on different operating systems such as Windows and Unix without having to be rewritten. I had no prior experience of programming in Java at the start of my internship; I am continuously learning as I create the program. I have written the part of the program that enables a user to draw several zones, edit them, and store their locations. The next phase of my project is to allow the user to click on the side of a zone and create a boundary condition for it. A previous intern wrote a program that allows the user to input boundary conditions. I can integrate the two programs to create a larger, more usable program. After that, I will develop a way for the user to save the graph for future reference. Another eventual goal is to make the GUI capable of creating three-dimensional zones as well. Researchers such as my mentor, Dr. David Ashpis, need a quick, user-friendly
Abstract Heterogeneous catalytic reactions are influenced by a subtle interplay of atomic-scale factors, ranging from the catalysts’ local morphology to the presence of high adsorbate coverages. Describing such phenomena via computational models requires generation and analysis of a large space of atomic configurations. To address this challenge, we present Adsorbate Chemical Environment-based Graph Convolution Neural Network (ACE-GCN), a screening workflow that accounts for atomistic configurations comprising diverse adsorbates, binding locations, coordination environments, and substrate morphologies. Using this workflow, we develop catalyst surface models for two illustrative systems: (i) NO adsorbed on a Pt 3 Sn(111) alloy surface, of interest for nitrate electroreduction processes, where high adsorbate coverages combined with low symmetry of the alloy substrate produce a large configurational space, and (ii) OH* adsorbed on a stepped Pt(221) facet, of relevance to the Oxygen Reduction Reaction, where configurational complexity results from the presence of irregular crystal surfaces, high adsorbate coverages, and directionally-dependent adsorbate-adsorbate interactions. In both cases, the ACE-GCN model, trained on a fraction (~10%) of the total DFT-relaxed configurations, successfully describes trends in the relative stabilities of unrelaxed atomic configurations sampled from a large configurational space. This approach is expected to accelerate development of rigorous descriptions of catalyst surfaces under in-situ conditions.
We report the development of a computer simulation tool based on the Graph-theoretical kinetic Monte Carlo (GT-KMC) approach that can be used to simulate diffusion and derive effective diffusivity of species in complex structures of TPBAR components. The GT-KMC framework was implemented in AKSOME, an on-lattice self-learning kinetic Monte Carlo tool developed at PNNL and was previously used to study solute diffusion in metal alloys. This newly developed tool will be helpful in simulating atom diffusion and extracting their effective diffusivities in grain boundaries and interfaces in various TPBAR components. Once benchmarked, the tool will be used to simulate the diffusion of tritium (hydrogen) along grain boundaries in α-Zr using the activation energy barrier data previously obtained from Density Functional Theory calculations.
Mención Internacional en el título de doctorDeep-learning methods are playing a crucial role in numerous scientific and industrialapplications. Over the past two decades, these techniques have helped in the collection,reconstruction, and analysis of large data samples in particle physics experiments. Themain topic of this PhD research is the study of deep-learning techniques in long-baselineneutrino oscillation experiments. Neutrinos are mysterious light elementary particles,and their investigation is essential to shed light on some of the remaining open questionsin physics. The work presented here describes an algorithm based on a convolutionalneural network developed to provide highly accurate and efficient selections of electronneutrino and muon neutrino interactions in the Deep Underground Neutrino Experiment(DUNE). With this algorithm, the electron neutrino (antineutrino) selection efficiencypeaks at 90% (94%) and exceeds 85% (90%) for reconstructed neutrino energies between2-5 GeV. The selection efficiency for muon neutrino (antineutrino) interactions is foundto have a maximum of 96% (97%) and exceeds 90% (95%) efficiency for reconstructedneutrino energies above 2 GeV. When considering all electron neutrino and antineutrinointeractions as signal (both those appearing from oscillations and those intrinsic tothe beam), a selection purity of 90% is achieved. These event selections are criticalto maximise the sensitivity of the experiment to CP-violating effects, key to furtherunderstand the matter-antimatter asymmetry of the Universe.In high-energy physics experiments, deep learning has also been explored for producingfast simulations and physically-motivated manipulations of simulated images. Some ofthose simulations, such as the light production and detection, are very computationallyexpensive and require novel methods to produce the necessary samples while controllingthe varied underlying physics model parameters. To do so, we invented the model-assistedgenerative adversarial network (MAGAN), first validated on simple generic case studiesand then successfully applied to the DUNE photon-detector simulation.Moreover, we also developed graph neural networks for 3D-voxel classification ofambiguities and optical crosstalk for a different particle physics experiment, most preciselyfor the proposed SuperFGD. This novel 3D-granular plastic-scintillator neutrino detectorwill be used to upgrade the near detector of the T2K neutrino oscillation experiment, and our method reports efficiencies and purities of 94-96% per event in the classificationof particle track voxels.Due to the growth and complexity of deep neural networks, researchers have beeninvestigating techniques to train those networks in a more computationally-efficient way.Many efforts have been made by the community to optimise deep-learning models byparallelising or distributing their training computation across multiple devices. In thisthesis, we study an approach based on data locality for those neural networks that cannotbenefit from scaling their computation due to a significant bottleneck in the data I/O.The research also includes a detailed study on the performance of deep neural networkson hardware accelerator boards.Los métodos de aprendizaje profundo son cada vez más utilizados en numerosas aplicacionescientíficas e industriales hoy en día. Durante las dos últimas décadas, estastécnicas se han empleado en la recolección, reconstrucción y análisis de la gran cantidadde datos generados por experimentos de física de partículas. El tema principal de estatesis doctoral es el uso de estos modelos de aprendizaje profundo en experimentos defísica de neutrinos, en concreto en los experimentos de larga distancia DUNE y T2K. Losneutrinos, partículas fundamentales neutras, de las más ligeras del Universo, pueden serclave para explicar algunas de las cuestiones todavía sin resolver en física fundamental.Entre las diferentes contribuciones que esta tesis ha hecho a su estudio, cabe destacar eldesarrollo de un algoritmo basado en una red de neuronas convolucional para seleccionarcon gran eficiencia y precisión las interacciones de neutrinos electrónicos y muónicos enel Deep Underground Neutrino Experiment (DUNE). La eficiencia de selección obtenidapara neutrinos (antineutrinos) electrónicos alcanza un máximo del 90% (94%) y supera el85% (90%) para neutrinos con energías reconstruidas en el rango 2-5 GeV. La selección deneutrinos (antineutrinos) muónicos tiene una eficiencia máxima del 96% (97%) y excedeel 90% (95%) para neutrinos con energías reconstruidas de más de 2 GeV. Considerandocomo señal todas las interacciones de neutrinos y antineutrinos electrónicos (procedentestanto de oscilaciones como intrínsecos en el haz inicial), se logra una pureza en la seleccióndel 90%. Dichas selecciones de eventos son fundamentales para maximizar la sensibilidaddel experimento a los efectos de violació...
This repository enables fine-tuning of the HydraGNN Predictive GFM 2026 — an open-source ensemble of pre-trained graph foundation models for atomistic materials modeling, developed at Oak Ridge National Laboratory. The GFM 2026 is freely available and downloadable via Globus from the OLCF Data Constellation (DOI: 10.13139/OLCF/2562660). Starting from these pre-trained weights, this repository provides a complete transfer learning pipeline for adapting the GFM ensemble to domain-specific molecular and materials property prediction tasks. It includes: 1) Utilities for ensemble fine-tuning with task-specific output heads 2) Example pipelines for eight widely-used materials and molecular datasets 3) Tools for model adaptation and head configuration 4) Data preprocessing utilities for each supported dataset 5) Benchmarking and evaluation scripts
A method of using synthetic-discriminant-functions to facilitate learning in a pattern recognition system is discussed. Learning is accomplished by continually adding images to the training set used for synthetic discriminant functions (SDF) construction. Object identification is performed by efficiently searching a library of SDF filters for the maximum optical correlation. Two library structures are discussed - binary tree and multilinked graph - along with maximum ascent, back-tracking, perturbation, and simulated annealing searching techniques. By incorporating the distortion invariant properties of SDFs within a library structure, a robust pattern recognition system can be produced.
A workstation-based interactive educational tool was developed to aid in the teaching of undergraduate compressible aerodynamics. The tool solves for the supersonic flow past a wedge using the equations found in NACA 1135. The student varies the geometry or flow conditions through a graphical user interface and the new conditions are calculated immediately. Various graphical formats present the variation of flow results to the student. One such format leads the student to the generation of some of the graphs found in NACA-1135. The tool includes interactive questions and answers to aid in both the use of the tool and to develop an understanding of some of the complexities of compressible aerodynamics. A series of help screens make the simulator easy to learn and use. This paper will detail the numerical methods used in the tool and describe how it can be used and modified.
Training modern deep neural network (DNN) models involves complex workflows triggered by model exploration, sensitivity analysis, explainability, etc. A key primitive in this context is the ability to clone a model training instance, i.e. “fork” the training process in a potentially different direction, which enables comparisons of different evolution paths using variations of training data and model parameters. However, in a quest improve the training throughput, a mix of data parallel, model parallel, pipeline parallel and layer-wise parallel approaches are making the problem of cloning highly complex. In this paper, we explore the problem of efficient cloning under such circumstances. To this end, we leverage several properties of data-parallel training and layer-wise parallelism to design DeepClone, a cloning approach based on augmenting the execution graph to gain direct access to tensors, which are then sharded and reconstructed asynchronously in order to minimize runtime overhead, standby duration, readiness duration. Compared with state-of-art approaches, DeepClone shows orders of magnitude improvement for several classes of DNN models.
This study explores the feasibility of leveraging quantum machine learning (QML) to analyze NASA Earth Observational (EO) data for climate change research, with a particular focus on the phenomenon of ”crop frosting” which has become more prevalent due to climate change. We implemented and evaluated two QML models, the Variational Quantum Classifier (VQC) and Quantum Support Vector Classifier (QSVC), in both simulated and real quantum computing environments using a 127 qubit IBM quantum processor. Our study emphasizes the scientific rigor in comparing these quantum models with a classical Support Vector Machine (SVM) classifier, highlighting their performance in processing climate data. The results offer valuable insights into the potential scientific advantages, limitations, and scalability of QML for analyzing EO datasets, thus paving the way for more advanced climate modeling and predictive analytics using quantum computing. We showcased how Environmental Interaction Knowledge Graphs (EIKGs) and Digital Twins (DTs) can be integrated into this study. This research underscores the transformative potential of Classical and QML leveraging KGs and DT to address the multifaceted challenges posed by climate change.
Abstract Though neuromorphic computers have typically targeted applications in machine learning and neuroscience (‘cognitive’ applications), they have many computational characteristics that are attractive for a wide variety of computational problems. In this work, we review the current state-of-the-art for non-cognitive applications on neuromorphic computers, including simple computational kernels for composition, graph algorithms, constrained optimization, and signal processing. We discuss the advantages of using neuromorphic computers for these different applications, as well as the challenges that still remain. The ultimate goal of this work is to bring awareness to this class of problems for neuromorphic systems to the broader community, particularly to encourage further work in this area and to make sure that these applications are considered in the design of future neuromorphic systems.
With the enlarging computation capacity of general Graphics Processing Units (GPUs), leveraging GPUs to accelerate parallel applications has become a critical topic in academia and industry. However, a wide range of irregular applications with the computation-/memory-intensive nature cannot easily achieve high GPU utilization. The challenges mainly involve the following aspects: first, data dependence leads to coarse-grained kernel and inefficient parallelism; second, heavy GPU memory usage may cause frequent memory evictions and extra overhead of I/O; third, specific computation patterns produce memory redundancies; last, workload balance and data reusability conjunctly benefit the overall performance, but there may exist a dynamic trade-off between them. Targeting these challenges, this dissertation proposes multiple optimizations to accelerate two real-world applications: many-body correlation functions to simulate nuclear physics in a large-scale scientific system; the other is the eALS-based matrix factorization recommendation system. To accelerate the calculations of many-body correlation functions, this dissertation presents three frameworks in GPU memory management and multi-GPU scheduling. Firstly, an optimized systematic GPU memory management framework, MemHC, utilizes a series of new memory reduction designs in GPU memory allocation, CPU/GPU communications, and GPU memory oversubscription. Secondly, an enhanced multi-GPU scheduling framework, MICCO, particularly by taking both data dimension (e.g., data reuse and data eviction) and computation dimension into account. MICCO designs a heuristic scheduling algorithm and a machine learning-based regression model to generate the optimal settings of a proposed new concept to manage the trade-off. Thirdly, a locality-aware multi-GPU scheduling framework. This scheduler leverages pipeline batch generation with a looking-ahead strategy by building local dependency graphs for memory transfer reduction and better data reuse, achieving up to 79.92% memory cost reduction and 1.67x speedup. To parallelize the eALS-based recommendation system, this dissertation proposes an efficient CPU/GPU heterogeneous recommendation system, HEALS. HEALS employs newly designed architecture-adaptive data formats to achieve load balance and good data locality on CPU and GPU. To mitigate the data dependence, HEALS presents a CPU/GPU collaboration model for both task parallelism and data parallelism with multiple kernel computation optimizations. In summary, this dissertation efficiently accelerates two typical irregular applications on GPUs by building four frameworks, including CPU/GPU collaboration, GPU memory management, and multi-GPU scheduling.
Abstract This article illustrates the use of unsupervised probabilistic learning techniques for the analysis of planetary reentry trajectories. A three-degree-of-freedom model was employed to generate optimal trajectories that comprise the training datasets. The algorithm first extracts the intrinsic structure in the data via a diffusion map approach. We find that data resides on manifolds of much lower dimensionality compared to the high-dimensional state space that describes each trajectory. Using the diffusion coordinates on the graph of training samples, the probabilistic framework subsequently augments the original data with samples that are statistically consistent with the original set. The augmented samples are then used to construct conditional statistics that are ultimately assembled in a path planning algorithm. In this framework, the controls are determined stage by stage during the flight to adapt to changing mission objectives in real-time.
Identification of potential therapeutic candidates can be expedited by integrating computational modeling with domain aware machine learning (ML) approaches followed by experimental validation. Generative deep learning models have been recently developed that can generate thousands of new candidates, but their physiochemical properties are typically not optimized. Using our deep learning models and a scaffold as a starting point, we generated tens of thousands of compounds for SARS-CoV-2 M pro that preserve the core scaffold. Here we utilized and implemented several computational tools such as structural alert and toxicity analysis, high throughput virtual screening, ML-based 3D quantitative structure–activity relationships, multi-parameter optimization, and graph neural networks on libraries of generated candidates to predict biological activity and binding affinity a priori. From these collective computational results, eight promising candidates were identified and tested experimentally using Native Mass Spectrometry (MS) and FRET-based functional assays. Two compounds, with quinazoline-2-thiol and acetylpiperidine core moiety showed IC 50 values in the low micromolar range: 2.95±0.0017 µM and 3.41±0.0015 µM, respectively. The molecular dynamics simulations further highlight that binding of these compounds results in allosteric modulations in the chain B and the interface domains of the M pro . The key fragments from these top hits can be used as input for closed loop lead optimization in the integrated pipeline.