Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “large-scale AI”

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 55 records · Page 3

Decentralized Distributed Proximal Policy Optimization (DD-PPO) for High Performance Computing Scheduling on Multi-User Systems

Resource allocation in High Performance Computing (HPC) environments presents a complex and multifaceted challenge for job scheduling algorithms. Beyond the efficient allocation of system resources, schedulers must account for and optimize multiple performance metrics, including job wait time and system throughput. Traditional heuristic-based scheduling algorithms increasingly struggle and lack the efficiency needed to meet the demands and address the complexity and scale of modern HPC systems. Consequently, recent research efforts have focused on leveraging advancements in Artificial Intelligence (AI) and Deep Learning (DL), particularly Reinforcement Learning (RL), to develop more adaptable and intelligent scheduling strategies. Previous RL-based scheduling approaches have explored a range of algorithms, from Deep Q-Networks (DQN) to Proximal Policy Optimization (PPO), and more recently, hybrid methods that integrate Graph Neural Networks (GNNs) with RL techniques. However, a common limitation across these methods is their reliance on relatively small datasets, with few methods being evaluated using large-scale, multi-million-job trace datasets representative of real-world HPC workloads. Moreover, existing RL schedulers face scalability issues due to centralized policy updates, which hinder training efficiency and performance when applied to large datasets. This study introduces a novel RL-based scheduler utilizing Decentralized Distributed Proximal Policy Optimization (DD-PPO) algorithm, which supports large-scale distributed training across multiple workers without requiring parameter synchronization at every step. By eliminating reliance on centralized updates to a shared policy, the DD-PPO scheduler enhances scalability, training efficiency, and sample utilization. Experimental validation using a large real-world dataset containing over 11.5 million job traces collected from petascale HPC systems over six years assesses the influence of dataset scale on training effectiveness and compares DD-PPO performance to traditional and advanced scheduling approaches. The experimental results demonstrate improved scheduling performance in comparison to both heuristic-based schedulers and existing RL-based scheduling algorithms.

AI↗

An atomic cluster expansion (ACE) potential for water under extreme conditions

We present a machine learning interatomic potential for water designed to capture its complex multiphase behavior, including both molecular and superionic ice phases. The potential is based on the atomic cluster expansion (ACE) formulation and has been parameterized to enable high-fidelity molecular dynamics simulations of water under extreme conditions, for pressures up to 100 GPa and for temperatures between 500 and 6000 K. A diverse range of configurations was generated through ab initio molecular dynamics (AI-MD) simulations, covering insulating and superionic ice phases, liquid water, and dissociated plasma phase. We demonstrate that the H 2 O ACE potential accurately reproduces experimental and DFT predicted isotherms and Hugoniots. Crucially, the potential is able to capture the intricate phase behavior of water, including the transition from molecular fluid to the appropriate solid ice phases, and the superionic ice phases. This work provides a robust interatomic potential that can be used for large-scale, accurate simulations of water under extreme thermodynamic conditions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Towards Generalizable and Efficient Circuit Topology Design: A Graph-Transformer-based Surrogate Model with Curriculum Learning

Unlike circuit parameter and sizing optimizations, the automated design of analog circuit topologies poses significant challenges for learning-based approaches. One challenge arises from the combinatorial growth of the topology space with circuit size, which limits the topology optimization efficiency. Moreover, traditional circuit evaluation methods are time-consuming, while the presence of data discontinuity in the topology space makes the accurate prediction of circuit performance exceptionally difficult for unseen topologies. To tackle these challenges, we design a novel Graph-Transformer-based Network (GTN) as the surrogate model for circuit evaluation, offering a substantial acceleration in the speed of circuit topology optimization without sacrificing performance. Our GTN model architecture is designed to embed voltage changes in circuit loops and current flows in connected devices, enabling accurate performance predictions for circuits with unseen topologies. To address the cold start problem when scaling GTN to large-scale circuits, we further introduce a curriculum learning strategy that progressively trains GTN from small-scale to large-scale circuits. This approach enables the model to first learn fundamental physical principles from simpler topologies and gradually adapt to complex configurations, effectively bridging the circuit complexity gap and improving prediction accuracy. Taking the power converter circuit design as an experimental task, our GTN model significantly outperforms an analytical approach and baseline methods directly utilizing graph neural networks. Furthermore, GTN achieves less than 5% relative error and 196× speed-up compared with high-fidelity simulation. Notably, our GTN surrogate model empowers an automatic circuit design framework to discover circuits of comparable quality to those identified through high-fidelity simulation while reducing the time required by up to 98.2%. With curriculum learning, the enhanced GTN achieves a 51% improvement for performance prediction of large-scale circuits compared to the GTN model without this strategy. These advancements establish GTN as a scalable framework for automated analog circuit design across varying circuit complexity levels.

Lu, Haoshu [New Jersey Institute of Technology (NJ↗

A Unifying Framework to Enable Artificial Intelligence in High-Performance Computing Workflows

Current trends point to a future where large-scale scientific applications are tightly coupled high-performance computing/artificial intelligence (HPC/AI) hybrids. Hence, we urgently need to invest in creating a seamless, scalable framework where HPC and AI/machine learning can efficiently work together and adapt to novel hardware and vendor libraries without starting from scratch every few years. Finally, the current ecosystem and sparsely connected community are not sufficient to tackle these challenges, and we require a breakthrough catalyst for science similar to what PyTorch enabled for AI.

high-performance computing↗

ORBITaL-Net: A labeled training library for large-scale building feature extraction

Over the course of several years, nearly 1.5 million building outlines have been created from approximately 128,000 training tiles covering roughly 7,000 km 2 of very high-resolution multispectral overhead imagery, primarily dated between 2010 and 2020. This dataset, dubbed the Oak Ridge Building Image and TrAining Label Net (ORBITaL-Net), is designed for machine learning applications and is global in scope, with samples drawn from 72 countries across North America, South America, Africa, Europe, and Asia. ORBITaL-Net captures a great diversity in geographic setting, structural characteristics, land use (urban and rural), terrain, and imagery conditions. While the labeled building outlines are themselves valuable, the dataset’s true strength lies in the pairing of these labels with corresponding reference imagery, which is being released for open source use. Similar to SpaceNet and Replicable AI For Microplanning (ramp), this building outline dataset will allow the larger computer vision community from academia, government, and industry the opportunity to develop robust, scalable, and generalizable geospatial machine learning techniques. Unlike SpaceNet and ramp, which offer high resolution labels and imagery primarily for large urban cities, ORBITaL-Net is not focused on training samples from heavily populated areas but instead aims to capture the innate variability of conditions present in both the physical environment and imagery collections.

Geography↗

Modeling Framework for Data Center

This chapter highlights the critical need for advanced modeling of data centers due to their rapidly increasing energy consumption and impact on grid reliability. Driven by the demand for AI applications, data centers are projected to consume a significant portion of US energy by 2028, putting stress on an already challenged power grid. The chapter emphasizes the importance of "fast" time-scale models to understand the dynamic interactions between data centers and the grid, especially given the rapid power fluctuations of AI workloads. It outlines a modeling framework that includes both offline and real-time EMT domain simulations, detailing the necessary representations for various components like utility interfaces, transformers, IT loads, UPS, cooling loads, Battery Energy Storage Systems (BESS), generators, protection systems, and higher-level control systems. While standard simulation tools like PSCAD offer basic models, custom development is often required to accurately capture the unique and fast-changing behaviors of modern data centers. The chapter also discusses key metrics and test cases for validating these models, focusing on transient load responses, protection relay coordination, and demand flexibility. Finally, it addresses the challenges of modeling large-scale data centers, such as computational complexity and the trade-off between model fidelity and practicality, suggesting hybrid modeling approaches as a solution. The overarching goal is to create a robust framework that helps assess data center impacts on grid stability, identify vulnerabilities, and inform the development of standards for reliable integration of these large loads into the bulk power system.

25 ENERGY STORAGE↗

Micrometer: Micromechanics transformer for predicting full field mechanical responses of heterogeneous materials

Predicting mechanical responses of heterogeneous materials across scales remains a significant challenge. Traditional computational methods often struggle with complex and multiscale nature of these materials, limiting their effectiveness in real-world applications. Here, in this paper, we introduce Micrometer, a vision transformer based deep learning model designed to predict full field mechanical responses of heterogeneous materials, bridging the gap between computer vision and solid mechanics problems. We show that Micrometer, trained on a large-scale high-resolution dataset of 2D fiber-reinforced composites, can achieve state-of-the-art performance in predicting microscale strain fields across a wide range of material properties and loading conditions. Our model demonstrates accuracy and computational efficiency in applications such as computational homogenization and multiscale modeling, reducing computational time by up to two orders of magnitude compared to conventional numerical solvers while maintaining less than 1 % errors in predicting macroscale stress fields. Furthermore, we showcase Micrometer’s adaptability through transfer learning experiments on new materials with limited data, highlighting its potential to tackle diverse scenarios in computational solid mechanics. These results represent a significant step towards AI-driven innovation in materials science, addressing the limitations of traditional numerical methods and paving the way for more efficient simulations of heterogeneous materials across various industrial applications.

Composite materials↗

Towards an Introspective Dynamic Model of Globally Distributed Computing Infrastructures

Large-scale scientific collaborations like ATLAS, Belle II, CMS, DUNE, and others involve hundreds of research institutes and thousands of researchers spread across the globe. These experiments generate petabytes of data, with volumes soon expected to reach exabytes. Consequently, there is a growing need for computation, including structured data processing from raw data to consumer-ready derived data, extensive Monte Carlo simulation campaigns, and a wide range of end-user analysis. To manage these computational and storage demands, centralized workflow and data management systems are implemented. However, decisions regarding data placement and payload allocation are often made disjointly and via heuristic means. A significant obstacle in adopting more effective heuristic or AI-driven solutions is the absence of a quick and reliable introspective dynamic model to evaluate and refine alternative approaches. In this study, we aim to develop such an interactive system using real-world data. By examining job execution records from the PanDA workflow management system, we have pinpointed key performance indicators such as queuing time, error rate, and the extent of remote data access. The dataset includes five months of activity. Additionally, we are creating a generative AI model to simulate time series of payloads, which incorporate visible features like category, event count, and submitting group, as well as hidden features like the total computational load—derived from existing PanDA records and computing site capabilities. These hidden features, which are not visible to job allocators, whether heuristic or AI-driven, influence factors such as queuing times and data movement.

kilic, Ozgur Ozan [Brookhaven National Laboratory ↗

Fast and robust strategies for large-scale mixed-integer SCOPF

This project develops scalable, computationally efficient algorithms to solve realistic large-scale power system optimization problems, including systems with more than 8,000 buses, as part of a larger series of competitions run by ARPA-E. These problems are critical because the secure and reliable operation of the power grid is becoming increasingly challenging, especially under conditions of increased uncertainty and variability. The economic feasibility of our methods is high, given that they are purely software-based solutions designed to operate power grids more efficiently. The technical effectiveness balances heuristics and approximations to provide a trade-off between speed and accuracy.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Quantum learning advantage on a scalable photonic platform

Recent advances in quantum technologies have demonstrated that quantum systems can outperform classical ones in specific tasks, a concept known as quantum advantage. Although previous efforts have focused on computational speedups, a definitive and provable quantum advantage that is unattainable by any classical system has remained elusive. Here, in this work, we demonstrate a provable photonic quantum advantage by implementing a quantum-enhanced protocol for learning a high-dimensional physical process. Using imperfect Einstein–Podolsky–Rosen entanglement, we achieve a sample complexity reduction of 11.8 orders of magnitude compared to classical methods without entanglement. These results show that large-scale, provable quantum advantage is achievable with current photonic technology and represent a key step toward practical quantum-enhanced learning protocols in quantum metrology and machine learning.

Liu, Zheng-Hao [Technical Univ. of Denmark, Lyngby↗

Microsecond-latency feedback at a particle accelerator by online reinforcement learning on hardware

The commissioning and operation of future large-scale scientific experiments will challenge current tuning and control methods. Reinforcement learning (RL) algorithms are a promising solution due to their ability to dynamically adapt to changing environments and consider delayed consequences. In many real-world applications, RL policies must produce actions in real time, often within microseconds to milliseconds, imposing significant constraints on system latency and computational overhead that conventional machine learning libraries are not designed to handle. To control phenomena in real time at these timescales, RL needs to be deployed on-the-edge, namely on dedicated hardware located near the system it controls, without relying on a host CPU or cloud-based inference. In this work we present the design and deployment of an experience accumulator system in a particle accelerator. In this system, deep-RL algorithms run using hardware acceleration and act within a few microseconds, enabling the use of RL for control of phenomena like beam instabilities. The training uses the collected data offline to reduce the number of operations carried out on the acceleration hardware. The proposed architecture was tested in real experimental conditions at the Karlsruhe research accelerator, a synchrotron light source, where the system was used to control artificially induced horizontal betatron oscillations in real-time, with a control loop period of just 2.7 μs. The results showed a performance comparable to the commercial feedback system available at the accelerator, demonstrating the viability and potential of this approach. Due to the self-learning and reconfiguration capability of this implementation, a seamless application to other control problems is possible. Applications range from particle accelerators to large-scale research and industrial facilities.

FPGA↗

E-PINNs: Epistemic Physics-Informed Neural Networks

Physics-informed neural networks (PINNs) have demonstrated promise as a framework for solving forward and inverse problems involving partial differential equations. Despite recent progress in the field, it remains challenging to quantify uncertainty in these networks. While techniques such as Bayesian PINNs (B-PINNs) provide a principled approach to capturing epistemic uncertainty through Bayesian inference, they can be computationally expensive for large-scale applications. In this work, we propose Epistemic Physics-Informed Neural Networks (E-PINNs), a framework that uses a small network, the epinet, to efficiently quantify epistemic uncertainty in PINNs. The proposed approach works as an add-on to existing, pre-trained PINNs with a small computational overhead. We demonstrate the applicability of the proposed framework in various test cases and compare the results with B-PINNs using Hamiltonian Monte Carlo (HMC) posterior estimation and dropout-equipped PINNs (Dropout-PINNs). In our experiments, E-PINNs achieve calibrated coverage with competitive sharpness at substantially lower cost. We demonstrate that when B-PINNs produce narrower bands, they under-cover in our tests. E-PINNs also show better calibration than Dropout-PINNs in these examples, indicating a favorable accuracy-efficiency trade-off.

AI for Science↗

Biasing from galaxy trough and peak profiles with the DES Y3 redMaGiC galaxies and the weak lensing mass map

We measure the correspondence between the distribution of galaxies and matter around troughs and peaks in the projected galaxy density, by comparing redMaGiC galaxies (0.15 < z < 0.65) to weak lensing mass maps from the Dark Energy Survey (DES) Y3 data release. We obtain stacked profiles, as a function of angle θ, of the galaxy density contrast δ g and the weak lensing convergence κ, in the vicinity of these identified troughs and peaks, referred to as ‘void’ and ‘cluster’ superstructures. The ratio of the profiles depend mildly on θ, indicating good consistency between the profile shapes. We model the amplitude of this ratio using a function $F(\boldsymbol{\eta }, \theta )$ that depends on cosmological parameters $\boldsymbol{\eta }$, scaled by the galaxy bias. We construct templates of $F(\boldsymbol{\eta }, \theta )$ using a suite of N-body (‘Gower Street’) simulations forward-modelled with DES Y3-like noise and systematics. We discuss and quantify the caveats of using a linear bias model to create galaxy maps from the simulation dark matter shells. We measure the galaxy bias in three lens tomographic bins (near to far): $2.32^{+0.86}_{-0.27}, 2.18^{+0.86}_{-0.23}, 1.86^{+0.82}_{-0.23}$ for voids, and $2.46^{+0.73}_{-0.27}, 3.55^{+0.96}_{-0.55}, 4.27^{+0.36}_{-1.14}$ for clusters, assuming the best-fit Planck cosmology. Similar values with ∼0.1σ shifts are obtained assuming the mean DES Y3 cosmology. The biases from troughs and peaks are broadly consistent, although a larger bias is derived for peaks, which is also larger than those measured from the DES Y3 3 × 2-point analysis. This method shows an interesting avenue for measuring field-level bias that can be applied to future lensing surveys.

cosmology: observations↗

Describing Point Defect Topology in 2D Energy Materials Through Computer Vision

Point defects such as vacancies and impurity atoms strongly impact the performance of 2D materials. Traditional efforts often rely on manual detection, a process that is time-intensive, prone to human error, and challenging to scale. Here we leverage machine learning (ML) methods to identify and quantify vacancies within 2D transition metal carbides (Ti3C2, MXenes), aiming to expedite detection while improving accuracy. MXenes exhibit valuable defect-defined electrochemical properties, but we currently lack statistical understanding of defect topology needed to fully harness these materials. Here we employ a convolutional neural network for semantic segmentation of experimental MXene images, opening an opportunity to conduct a rigorous statistical study on defect hierarchy while investigating local relaxation in the lattice. We show how the integration of ML can yield fundamental insight into point defects, providing a powerful tool that will play an increasingly crucial role in the future of materials science. ML is often not just a matter of straightforward application, and pretrained models proved ineffective in this case. Instead, we trained our own neural network (NN) and applied data augmentation techniques and fine-tuning to the training dataset. Since labeled microscopy data is often scarce, we developed training data from a previously published wide-frame MXene image, using customized Gaussian fitting to locate atomic positions. Our trained model was then applied to a large dataset of experimental images, enabling a statistical study of defect configurations across three samples prepared with different HF etchant concentrations (5%, 9.1%, and 12.5%), as shown in Fig. 1. This also allowed us to investigate local strain around vacancies, though we find that we are limited by the precision of measurements using high-angle annular dark field (HAADF) images, as shown in Fig. 2. This study demonstrates how ML enables large-scale, quantitative analysis of atomic defects - an otherwise infeasible task with traditional methods. While our NN was specialized for Ti3C2 MXenes, the pipeline we developed provides a foundation for future ML models tailored to other materials. Ultimately, we envision embedding the NN onto the microscope to give real-time feedback to the user. To make this a reality, continued work is necessary to fully understand the NN's capabilities and limitations. This study gets one step closer to our goals of automated experimentation moving away from traditional methods of manual labeling. As ML capabilities advance, we hope to continue adapting and applying these techniques in microscopy.

2D materials↗

Explainable machine learning reveals that local structural motifs encode the thermodynamic state across the CuZr metallic glass-forming range

Metallic glasses derive their properties from the statistics of local atomic motifs rather than from long-range order, yet a quantitative, chemistry-specific link between motif populations and the underlying glassy state has remained elusive. In this work we combine large-scale molecular dynamics, Voronoi tessellation, deep neural networks, and SHapley Additive exPlanations (SHAP) to identify which local structural motifs define the glassy state of Cu—Zr metallic glasses. A dataset of 17,180 atomistic configurations spanning ten compositions (Cu 20 Zr 80 –Cu 80 Zr 20 ) and four quench rates (10 9 –10 12 K/s) is used to train a feed-forward neural network that regresses temperature across the 50–2000 K liquid–supercooled–glass range, achieving a mean absolute error of 19.89 K and R 2 = 0.9974, confirming that the local structural state is faithfully encoded in motif-level structure. SHAP analysis then reveals that a tightly coupled near-icosahedral family of motifs (coordination numbers (CN) 11–13, including the full icosahedron 001200 and its single-atom-perturbation sibling 10930) collectively encodes the thermodynamic state of the system across the full glass-forming range. The CN = 11–13 ordered members carry negative SHAP values at high populations, tracking the most deeply-quenched configurations, while 10930 shows the reversed signature consistent with its role as a soft-spot host whose population shrinks as the icosahedral network deepens. The analysis demonstrates that explainable machine learning can isolate the minimal motif vocabulary defining the glassy state and recovers the near-icosahedral building blocks previously identified by data-driven analyses of Cu—Zr. The approach provides a general, chemistry-specific route for characterizing the structural state of disordered materials.

36 MATERIALS SCIENCE↗

SAGIPS: a physics-inspired scalable asynchronous generative inverse-problem solver

Abstract Solving large-scale inverse problems using deep-learning algorithms have become an essential part of modern research and industrial applications. The complexity of the underlying inverse problem may require the utilization of high performance computing systems which poses a challenge on the algorithmic design of the inverse problem solver. Most deep learning algorithms require, due to their design, custom parallelization techniques in order to be resource efficient while showing a reasonable convergence. In this paper we introduce a S calable A synchronous G enerative I nverse P roblem S olver (SAGIPS) on high-performance computing systems. We present a workflow that utilizes an asynchronous ring-allreduce algorithm to transfer the gradients of the generator network across multiple GPUs. Experiments with a scientific proxy application demonstrate that SAGIPS shows near linear weak scaling, together with a convergence quality that is comparable to traditional methods. The approach presented here allows leveraging Generative Adverserial Network across multiple GPUs, promising advancements in solving complex inverse problems at scale.

97 MATHEMATICS AND COMPUTING↗

Discovery of a nearby radio relic in the low-mass, merging cluster Abell 4067

Shock waves generated during cluster mergers offer a powerful probe of how large-scale structure grows and evolves in the Universe. As part of the MeerKAT-South Pole Telescope (SPT) survey, we report the discovery of a single arc-like radio relic in the galaxy cluster Abell 4067 ($z=0.099$), one of the lowest-mass clusters known to host such a structure. MeerKAT UHF-band (0.58–1.09 GHz) observations reveal a relic with a largest linear size of $\sim 1.48\pm 0.02$ Mpc, located at a projected distance of 0.95 Mpc from the cluster centre. XMM–Newton X-ray data show that the relic’s position and orientation relative to the intracluster medium (ICM) elongation are consistent with a merger-driven shock-wave scenario. The relic has an estimated radio power of $3.10\pm 0.03\times 10^{24}$ W Hz$^{-1}$ at 150 MHz. When placed in the $P_{150\, \mathrm{MHz}}$–$M_{500}$ scaling relation, the Abell 4067 relic appears less luminous compared to relics in more massive clusters, suggesting an association with weak merger shocks. This finding supports the idea that relics in low-mass clusters may form through less energetic merger events, leading to weak merger shocks. The latter is supported by the absence of a detectable central radio halo in Abell 4067, which reinforces the idea that luminous radio haloes are not a universal outcome of cluster mergers and highlights the role of cluster mass, merger energetics, and evolutionary stage in shaping diffuse radio emission in the ICM.

79 ASTRONOMY AND ASTROPHYSICS↗

High-redshift millennium and astrid galaxies in effective field theory at the field level

Effective field theory (EFT) modeling is expected to be a useful tool in the era of future higher-redshift galaxy surveys such as DESI-II and Spec-S5 due to its robust description of various large-scale structure tracers. However, large values of EFT bias parameters of higher-redshift galaxies could jeopardize the convergence of the perturbative expansion. Here, in this paper we measure the bias parameters and other EFT coefficients from samples of two types of star-forming galaxies in the state-of-the-art MilleniumTNG and astrid hydrodynamical simulations. Our measurements are based on the field-level EFT forward model that allows for precision EFT parameter measurements by virtue of cosmic variance cancellation. Specifically, we consider approximately representative samples of Lyman-break galaxies (LBGs) and Lyman-𝛼 emitters (LAEs) that are consistent with the observed (angular) clustering and number density of these galaxies at 𝑧 = 3. Reproducing the linear biases and number densities observed from existing LAE and LBG data, we find quadratic bias parameters that are roughly consistent with those predicted from the halo model coupled with a simple halo occupation distribution model. We also find nonperturbative velocity contributions (fingers of God) of a similar size for LBGs to the familiar case of luminous red galaxies. However, these contributions are quite small for LAEs despite their large satellite fraction values of up to ∼ 30%. Our results indicate that the effective momentum reach 𝑘 max at 𝑧 = 3 for LAEs (LBGs) will be in the range 0.3−0.6⁢ℎ Mpc −1 (0.2−0.8⁢ℎ Mpc −1 ), suggesting that EFT will perform well for high-redshift galaxy clustering. This work provides the first step toward obtaining realistic simulation-based priors on EFT parameters for LAEs and LBGs.

Sullivan, James M. [Massachusetts Inst. of Technol↗