Search NASA⌕ Search

SEARCH · Search NASA

Results for “Performance Optimized Space Networks”

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 181 records · Page 10

Reification of latent microstructures: On supervised unsupervised and semi-supervised deep learning applications for microstructures in materials informatics

Machine learning (ML), including deep learning (DL), has become increasingly popular in the last few years due to its continually outstanding performance. In this context, we apply machine learning techniques to "learn" the microstructure using both supervised and unsupervised DL techniques. In particular, we focus (1) on the localization problem bridging (micro)structure (localized) property using supervised DL and (2) on the microstructure reconstruction problem in latent space using unsupervised DL. The goal of supervised and semi-supervised DL is to replace crystal plasticity finite element model (CPFEM) that maps from (micro)structure (localized) property, and implicitly the (micro)structure (homogenized) property relationships, while the goal of unsupervised DL is (1) to represent high-dimensional microstructure images in a non-linear low-dimensional manifold, and (2) to discover a way to interpolate microstructures via latent space associating with latent microstructure variables. At the heart of this report is the applications of several common DL architectures, including convolutional neural networks (CNN), autoencoder (AE), and generative adversarial network (GAN), to multiple microstructure datasets, and the quest of neural architecture search for optimal DL architectures.

36 MATERIALS SCIENCE↗

Application-driven Privacy-preserving Data Publishing with Correlated Attributes

Recent advances in computing have allowed for the possibility to collect large amounts of data on personal activities and private living spaces. To address the privacy concerns of users in this environment, we propose a novel framework called PR-GAN that offers privacy-preserving mechanism using generative adversarial networks. Given a target application, PR-GAN automatically modifies the data to hide sensitive attributes - which may be hidden and can be inferred by machine learning algorithms - while preserving the data utility in the target application. Unlike prior works, the public's possible knowledge of the correlation between the target application and sensitive attributes is built into our modeling. We formulate our problem as an optimization problem, show that an optimal solution exists and use generative adversarial networks (GAN) to create perturbations. We further show that our method provides privacy guarantees under the Pufferfish framework, an elegant generalization of the differential privacy that allows for the modeling of prior knowledge on data and correlations. Through experiments, we show that our method outperforms conventional methods in effectively hiding the sensitive attributes while guaranteeing high performance in the target application, for both property inference and training purposes. Finally, we demonstrate through further experiments that once our model learns a privacy-preserving task, such as hiding subjects' identity, on a group of individuals, it can perform the same task on a separate group with minimal performance drops.

97 MATHEMATICS AND COMPUTING↗

Advancing density functional tight-binding method for large organic molecules through equivariant neural networks

Semi-empirical quantum-mechanical (QM) methods have become valuable tools for studying complex (bio)molecular systems due to their balance between computational efficiency and accuracy. A key aspect of these methods is their parameterization, which not only governs the reliability of the results but also provides an opportunity to enhance their overall performance. In our previous work [J. Phys. Chem. Lett., 2021, 11, 16], we advanced the third-order semi-empirical density functional tight-binding (DFTB3) method for computing multiple properties of small molecules by developing the machine learning (ML) potential NN rep to bridge the gap between DFTB3 electronic components and those of the hybrid DFT-PBE0 functional. To overcome the limitations of NN rep , we introduce the EquiDTB framework, which leverages physics-inspired equivariant neural networks (NN) to parameterize scalable and transferable many-body Δ TB potentials, replacing the standard pairwise DFTB repulsive potential. This advancement extends the applicability of our ML-corrected DFTB approach to larger molecules and non-covalent systems (including only C, N, O, and H atoms), going beyond the chemical space represented in the training QM datasets. The enhanced performance of EquiDTB over the standard TB methods is demonstrated by the accurate computation of the atomic forces of S66x8 molecular dimers, as well as their interaction energies. Moreover, EquiDTB can be effectively employed to explore the potential energy surfaces of large and flexible drug-like molecules—for example, to determine the minimum energy path between isomers, analyze structural transitions during dynamical simulations, compute vibrational modes, and investigate energetic rankings. The performance for single molecules slightly decreases when the DFTB electronic energy is reduced to first-order but remains superior to standard TB methods. Our work thus demonstrates that an optimal integration of an equivariant NN with QM datasets can advance the DFTB method while maintaining high efficiency, paving the way for reliable (bio)molecular simulations.

Medrano Sandonas, Leonardo [Technische Universität↗

Non-trivial symmetries in quantum landscapes and their resilience to quantum noise

Very little is known about the cost landscape for parametrized Quantum Circuits (PQCs). Nevertheless, PQCs are employed in Quantum Neural Networks and Variational Quantum Algorithms, which may allow for near-term quantum advantage. Such applications require good optimizers to train PQCs. Recent works have focused on quantum-aware optimizers specifically tailored for PQCs. However, ignorance of the cost landscape could hinder progress towards such optimizers. In this work, we analytically prove two results for PQCs: (1) We find an exponentially large symmetry in PQCs, yielding an exponentially large degeneracy of the minima in the cost landscape. Alternatively, this can be cast as an exponential reduction in the volume of relevant hyperparameter space. (2) We study the resilience of the symmetries under noise, and show that while it is conserved under unital noise, non-unital channels can break these symmetries and lift the degeneracy of minima, leading to multiple new local minima. Based on these results, we introduce an optimization method called Symmetry-based Minima Hopping (SYMH), which exploits the underlying symmetries in PQCs. Our numerical simulations show that SYMH improves the overall optimizer performance in the presence of non-unital noise at a level comparable to current hardware. Overall, this work derives large-scale circuit symmetries from local gate transformations, and uses them to construct a noise-aware optimization method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Understanding the Design Space of Sparse/Dense Multiphase Dataflows for Mapping Graph Neural Networks on Spatial Accelerators

Graph Neural Networks (GNNs) have garnered a lot of recent interest because of their success in learning representations from graph-structured data across several critical applications in cloud and HPC. Owing to their unique compute and memory characteristics that come from an interplay between dense and sparse phases of computations, the emergence of reconfigurable dataflow (aka spatial) accelerators offers promise for acceleration by mapping optimized dataflows (i.e., computation order and parallelism) for both phases. The goal of this work is to characterize and understand the design-space of dataflow choices for running GNNs on spatial accelerators in order for the compilers to optimize the dataflow based on the workload. Specifically, we propose a taxonomy to describe all possible choices for mapping the dense and sparse phases of GNNs spatially and temporally over a spatial accelerator, capturing both the intra-phase dataflow and the inter-phase (pipelined) dataflow. Using this taxonomy, we do deep-dives into the cost and benefits of several dataflows and perform case studies on implications of hardware parameters for dataflows and value of flexibility to support pipelined execution.

97 MATHEMATICS AND COMPUTING↗

Graph Neural Networks for Parameterized Quantum Circuits Expressibility Estimation (Rev.1)

Parameterized quantum circuits (PQCs) are fundamental to quantum machine learning (QML), quantum optimization, and variational quantum algorithms (VQAs). The expressibility of PQCs is a measure that determines their capability to harness the full potential of the quantum state space. It is thus a crucial guidepost to know when selecting a particular PQC ansatz. However, the existing technique for expressibility computation through statistical estimation requires a large number of samples, which poses significant challenges due to time and computational resource constraints. This paper introduces a novel approach for expressibility estimation of PQCs using Graph Neural Networks (GNNs). We demonstrate the predictive power of our GNN model with a dataset consisting of 25,000 samples from the noiseless IBM QASM Simulator and 12,000 samples from three distinct noisy quantum backends. The model accurately estimates expressibility, with root mean square errors (RMSE) of 0.05 and 0.06 for the noiseless and noisy backends, respectively. We compare our model’s predictions with reference circuits from Sim et al. and IBM Qiskit’s hardwareefficient ansatz sets to further evaluate our model’s performance. Our experimental evaluation in noiseless and noisy scenarios reveals a close alignment with ground truth expressibility values, highlighting the model’s efficacy. Moreover, our model exhibits promising extrapolation capabilities, predicting expressibility values with low RMSE for out-of-range qubit circuits trained solely on only up to 5-qubit circuit sets. This work thus provides a reliable means of efficiently evaluating the expressibility of diverse PQCs on noiseless simulators and hardware.

97 MATHEMATICS AND COMPUTING↗

Co-location Pattern Mining of Geosocial Data to Characterize Urban Functional Spaces

Spatial Co-location Pattern (SCP) mining continues to play a critical role in understanding the morphology of urban functional spaces of world cities. It requires a large amount of fine-granular data and computing efficiency to handle the combinatorial explosion of co-location patterns. To this end, this work has two main contributions - i) We showcase a novel approach to perform SCP mining to characterize intra-city scale structure of urban functionality or co-located activity patterns using geosocial Points-of-Interest (POI) vector data. ii) We present a generalized and optimized parallel/distributed SCP mining algorithm implemented on a Hadoop MapReduce system and demonstrate the utility of our approach using the city of Berlin (Germany) as an example. The SCPs tend to vary across Berlin's municipal boroughs and at different spatial scales. Our findings on Berlin's functional structure conform to existing urban geography models. Such a data-driven exploration of massive urban POIs using distributed computing is first of its kind and can help better understand the changing dynamics of urban functionality, as well as physical, and social network structure around the world.

Masrur, Arif↗

FPGA-accelerated SpeckleNN with SNL for real-time X-ray single-particle imaging

We present the implementation of a specialized version of our previously published unified embedding model, SpeckleNN, for real-time speckle pattern classification in X-ray Single-Particle Imaging (SPI), using the SLAC Neural Network Library (SNL) on an FPGA platform. This hardware realization transitions SpeckleNN from a prototypic model into a practical edge solution, optimized for running inference near the detector in high-throughput X-ray free-electron laser (XFEL) facilities, such as those found at the Linac Coherent Light Source (LCLS). To address the resource constraints inherent in FPGAs, we developed a more specialized version of SpeckleNN. The original model, which was designed for broader classification across multiple biological samples, comprised ~5.6 million parameters. The new implementation, while reducing the parameter count to 64.6K (a 98.8% reduction), focuses on maintaining the model's essential functionality for real-time operation, achieving an accuracy of 90%. Furthermore, we compressed the latent space from 128 to 50 dimensions. This implementation was demonstrated on the KCU1500 FPGA board, utilizing 71% of available DSPs, 75% of LUTs, and 48% of FFs, with an average power consumption of 9.4W according to the Vivado post-implementation report. The FPGA performed inference on a single image with a latency of 45.015 microseconds at a 200 MHz clock rate. In comparison, running the same inference on an NVIDIA A100 GPU resulted in an average power consumption of ~73W and an image processing latency of around 400 microseconds. Our FPGA-accelerated version of SpeckleNN demonstrated significant improvements, achieving an 8.9 × speedup and a 7.8 × reduction in power consumption compared to the GPU implementation. Key advancements include model specialization and dynamic weight loading through SNL, which eliminates the need for time-consuming FPGA design re-synthesis, allowing fast and continuous deployment of models (re)trained online. These innovations enable real-time adaptive classification and efficient vetoing of speckle patterns, making SpeckleNN more suited for deployment in XFEL facilities. This implementation has the potential to significantly accelerate SPI experiments and enhance adaptability to evolving experimental conditions.

47 OTHER INSTRUMENTATION↗

Secondary Pore Network Design Optimization Analytical Diffusion Model for Lithium Ion Battery

Fast ion transport along the electrode thickness is required for Lithium ion battery (LIB) to sustain continuous high-rate discharge or charge currents, which is a desired feature for the fast charging of electric vehicle batteries. Advance in LIB electrode manufacturing allows to control, to a certain extent, the electrode microstructure architecture in order to improve the macroscopic performances of these devices. For instance, several groups have experimentally tested architectures tailored specifically to increase the through plane ionic diffusion in regards for fast charge application by adding channels or groove-like large pores oriented along the electrode thickness. These voids do not replace the existing pores of the electrode microstructure but consist in a second, coarser, pore network, called the secondary pore network (SPN). The model quantifies the impact of SPN on ionic diffusion with a composite electrode through a simple analytical approach, considering various pore channel geometries and comparing to standard electrodes with identical gravimetric and identical volumetric specific theoretical capacity. The goal is to find optimal SPN design parameters according to three optimization objectives aiming to balance the improved overall through-plane, thanks to the coarse aligned channels, and the degraded in-plane diffusion, due to the porous matrix densification required to maintain gravimetric and volumetric specific theoretical capacity. The analytical model must be considered as a pre-screening tool to quickly investigate large design space, that can be refined later with more complex electrochemical CPU-expensive numerical models.

Usseglio Viretta, Francois↗

Solving differential equations using deep neural networks

Recent work on solving partial differential equations (PDEs) with deep neural networks (DNNs) is presented. The paper reviews and extends some of these methods while carefully analyzing a fundamental feature in numerical PDEs and nonlinear analysis: irregular solutions. First, the Sod shock tube solution to the compressible Euler equations is discussed and analyzed. This analysis includes a comparison of a DNN-based approach with conventional finite element and finite volume methods, and demonstrates that the DNN is competitive in terms of degrees of freedom required for a given accuracy. Further, the DNN-based approach is extended to consider performance improvements and simultaneous parameter space exploration. Next, a shock solution to compressible magnetohydrodynamics (MHD) is solved for, and used in a scenario where experimental data is utilized to enhance a PDE system that is a priori insufficient to validate against the observed/experimental data. This is accomplished by enriching the model PDE system with source terms that are then inferred via supervised training with synthetic experimental data. The resulting DNN framework for PDEs enables straightforward system prototyping and natural integration of large data sets (be they synthetic or experimental), all while simultaneously enabling single-pass exploration of an entire parameter space.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Modular and Transferable Reinforcement Learning Framework for the Fleet Rebalancing Problem

Mobility on demand (MoD) systems show great promise in realizing flexible and efficient urban transportation. However, significant technical challenges arise from operational decision making associated with MoD vehicle dispatch and fleet rebalancing. For this reason, operators tend to employ simplified algorithms that have been demonstrated to work well in a particular setting. To help bridge the gap between novel and existing methods, we propose a modular framework for fleet rebalancing based on model-free reinforcement learning (RL) that can leverage an existing dispatch method to minimize system cost. In particular, by treating dispatch as part of the environment dynamics, a centralized agent can learn to intermittently direct the dispatcher to reposition free vehicles and mitigate against fleet imbalance. We formulate RL state and action spaces as distributions over a grid partitioning of the operating area, making the framework scalable and avoiding the complexities associated with multiagent RL. Numerical experiments, using real-world trip and network data, demonstrate that RL reduces waiting time by 28% to 38% for the same-day evaluation, 17% to 44% for cross-day evaluation, and 22% to 25% for cross-season evaluation compared with no rebalancing scenarios. This approach has several distinct advantages over baseline methods including: improved system cost; high degree of adaptability to the selected dispatch method; and the ability to perform scale-invariant transfer learning between problem instances with similar vehicle and request distributions.

33 ADVANCED PROPULSION SYSTEMS↗

Control simulations of many-body quantum systems by a synergism of discrete real-time learning and optimal control theory

We present a self-consistent algorithm for optimal control simulations of many-body quantum systems. The algorithm features a two-step synergism that combines discrete real-time machine learning (DRTL) with Quantum Optimal Control Theory (QOCT) using the time-dependent Schrödinger equation. Specifically, in step (1), DRTL is employed to identify a compact working space (i.e., the important portion of the Hilbert space) for the time evolution of the many-body quantum system in the presence of a control field (i.e., the initial or previously updated field), and in step (2), QOCT utilizes the DRTL-determined working space to find a newly updated control field for a chosen objective. Steps 1 and 2 are iterated until a self-consistent control objective value is reached such that the resulting optimal control field yields the same targeted objective value when the corresponding working space is systematically enlarged. Furthermore, to demonstrate this two-step self-consistent DRTL-QOCT synergistic algorithm, we perform optimal control simulations of strongly interacting 1D as well as 2D Heisenberg spin systems. In both scenarios, only a single spin (at the left end site for 1D and the upper left corner site for 2D) is driven by the time-dependent control fields to create an excitation at the opposite site as the target. It is found that, starting from all spin-down zero excitation states, the synergistic method is able to identify working spaces and convergence of the desired controlled dynamics with just a few iterations of the overall algorithm. In the cases studied, the dimensionality of the working space scales only quasi-linearly with the number of spins.

Artificial neural networks↗

Solid-State Mixed-Potential Electrochemical Sensors for Natural Gas Leak Detection and Quality Control (Final Technical Report)

Mitigation of methane emissions are a critical factor to limiting the impact of the natural gas industry on global climate change. Throughout the period of 2020-2024, the University of New Mexico and its commercialization partner and subcontractor, SensorComm Technologies, Inc. (SCT), have worked together to develop a low-cost Artificial Intelligence (AI)-driven Internet of Things (IoT)-based multi-gas sensor platform for methane emissions detection. In the final year of the project, we extended this work to include hydrogen detection in support of a transition to a hydrogen economy where hydrogen could be transported through existing natural gas infrastructure. Mixed potential electrochemical sensors were first prototyped by ceramic additive manufacturing and then transitioned to conventional ceramic manufacturing tape casting and screen-printing technologies in preparation for mass production. Demonstrated limits of detection of 5 ppm of methane in natural gas and 1 ppm of hydrogen were measured. These limits of detection are among the lowest of solid-state electrochemical sensors that have been reported in the literature or available in the industry. Machine learning algorithms were developed to identify natural gas mixtures with > 98% accuracy level and quantify methane concentrations at 97% accuracy. The presence of hydrogen could also be identified, and its concentration quantified at these accuracy levels. These algorithms were optimized for running on portable computing hardware which enabled > 1 Hz processing rates. A portable packaged IoT system was integrated with the electrochemical sensor in collaboration with SCT. The package consists of readout electronics with < 1 mV resolution, sensor temperature control, and data transmission over cellular wireless and/or Wi-Fi networks. Field testing was performed in two rounds at Colorado State University’s Methane Emissions Technology Evaluation Center (CSU METEC). The first round of testing demonstrated successful measurements of methane from an underground natural gas leak of 20 standard liters per minute (SLPM), which agreed with previously published literature using more sophisticated and expensive analytical equipment. The second round of testing showed that an above ground leak of 2 SLPM of hydrogen could be detected at 32 ft. This project has resulted in six published peer reviewed journal articles, over ten presentations at professional conferences, and one full patent application filed in 2023. Future work on this project includes increased sensitivity, higher production yields, and applications in the hydrogen safety and flare emissions monitoring spaces.

03 NATURAL GAS↗

Exploring the All-to-All Collective Optimization Space with ConnectX CORE-Direct

The all-to-all collective communication operation is used by many scientific applications, and is one of the most time consuming and challenging collective operation to optimize. The algorithms for all-to-all operations typically fall into two classes, logarithmic and linear scaling algorithms, with Bruck's algorithm, a logarithmic scaling algorithm, used in many small-data all-to-all implementations. The recent addition of InfiniBand CORE-Direct support for network management of collective communications offers new opportunities for optimizing all-to-all operation as well as supporting truly asynchronous implementations of these operations. This paper presents several new enhancements to the Bruck small-data algorithm that leverage CORE-Direct and other InfiniBand network capabilities to produce efficient implementations of this collective operation. These include RDMA, SR-RNR, and SR-RTR algorithms. In addition, nonblocking implementations of these collective operations are also presented. Benchmark results show that the RDMA algorithm, which uses CORE-Direct capabilities to offload collective communication management to the Host Channel Adapter (HCA), hardware gather support for sending non-continuous data, and low-latency RDMA semantics, performs the best. For a 64 processes and 128 byte-per-process all-to-all, the RDMA algorithm performs 27% better than Bruck's algorithm implementation in Open MPI and 136% better than the SR-RTR algorithm. In addition, the nonblocking versions of these algorithms have the same performance characteristics as the blocking algorithms. Finally, measurements of computation/communication overlap capacity show that all offloaded algorithms achieve about 98% overlap for large data all-to-all, whereas implementations using host-based progress achieve only about 9.5% overlap.

Venkata, Manjunath Gorentla↗

Supercapacitors Based on Three-Dimensional Hierarchical Graphene Aerogels with Periodic Macropores

Graphene is an atomically thin, two-dimensional (2D) carbon material that offers a unique combination of low density, exceptional mechanical properties, thermal stability, large surface area, and excellent electrical conductivity. Recent progress has resulted in macro-assemblies of graphene, such as bulk graphene aerogels for a variety of applications. However, these three-dimensional (3D) graphenes exhibit physicochemical property attenuation compared to their 2D building blocks because of one-fold composition and tortuous, stochastic porous networks. These limitations can be offset by developing a graphene composite material with an engineered porous architecture. In this work, we report the fabrication of 3D periodic graphene composite aerogel microlattices for supercapacitor applications, via a 3D printing technique known as direct-ink writing. The key factor in developing these novel aerogels is creating an extrudable graphene oxide-based composite ink and modifying the 3D printing method to accommodate aerogel processing. The 3D-printed graphene composite aerogel (3D-GCA) electrodes are lightweight, highly conductive, and exhibit excellent electrochemical properties. In particular, the supercapacitors using these 3D-GCA electrodes with thicknesses on the order of millimeters display exceptional capacitive retention (ca. 90% from 0.5 to 10 A·g –1 ) and power densities (>4 kW·kg –1 ) that equal or exceed those of reported devices made with electrodes 10–100 times thinner. This work provides an example of how 3D-printed materials, such as graphene aerogels, can significantly expand the design space for fabricating high-performance and fully integrable energy storage devices optimized for a broad range of applications.

36 MATERIALS SCIENCE↗

Understanding latent timescales in neural ordinary differential equation models of advection-dominated dynamical systems

The neural ordinary differential equation (ODE) framework has shown considerable promise in recent years in developing highly accelerated surrogate models for complex physical systems characterized by partial differential equations (PDEs). For PDE-based systems, state-of-the-art neural ODE strategies leverage a two-step procedure to achieve this acceleration: a nonlinear dimensionality reduction step provided by an autoencoder, and a time integration step provided by a neural-network based model for the resultant latent space dynamics (the neural ODE). This work explores the applicability of such autoencoder-based neural ODE strategies for PDEs in which advection terms play a critical role. More specifically, alongside predictive demonstrations, physical insight into the sources of model acceleration (i.e., how the neural ODE achieves its acceleration) is the scope of the current study. Such investigations are performed by quantifying the effects of both autoencoder and neural ODE components on latent system time-scales using eigenvalue analysis of dynamical system Jacobians. To this end, the sensitivity of various critical training parameters – de-coupled versus end-to-end training, latent space dimensionality, and the role of training trajectory length, for example – to both model accuracy and the discovered latent system timescales is quantified. Furthermore, this work specifically uncovers the key role played by the training trajectory length (the number of rollout steps in the loss function during training) on the latent system timescales: larger trajectory lengths correlate with an increase in limiting neural ODE time-scales, and optimal neural ODEs are found to recover the largest time-scales of the full-order (ground-truth) system. Demonstrations are performed across fundamentally different unsteady fluid dynamics configurations influenced by advection: (1) the Kuramoto–Sivashinsky equations (2) Hydrogen-Air channel detonations (the compressible reacting Navier–Stokes equations with detailed chemistry), and (3) 2D Atmospheric flow.

Advection-dominated dynamical systems↗

Cognitive simulation models for inertial confinement fusion: Combining simulation and experimental data

The design space for inertial confinement fusion (ICF) experiments is vast, and experiments are extremely expensive. Researchers rely heavily on computer simulations to explore the design space in search of high-performing implosions. However, ICF multiphysics codes must make simplifying assumptions, and thus deviate from experimental measurements for complex implosions. For more effective design and investigation, simulations require input from past experimental data to better predict future performance. In this work, we describe a cognitive simulation method for combining simulation and experimental data into a common, predictive model. This method leverages a machine learning technique called “transfer learning,” the process of taking a model trained to solve one task, and partially retraining it on a sparse dataset to solve a different, but related task. In the context of ICF design, neural network models are trained on large simulation databases and partially retrained on experimental data, producing models that are far more accurate than simulations alone. Here, we demonstrate improved model performance for a range of ICF experiments at the National Ignition Facility and predict the outcome of recent experiments with less than 10% error for several key observables. We discuss how the methods might be used to carry out a data-driven experimental campaign to optimize performance, illustrating the key product—models that become increasingly accurate as data are acquired.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Pre-training Vision Models for the Classification of Alerts from Wide-field Time-domain Surveys

Modern wide-field time-domain surveys facilitate the study of transient, variable and moving phenomena by conducting image differencing and relaying alerts to their communities. Machine learning tools have been used on data from these surveys and their precursors for more than a decade, and convolutional neural networks (CNNs), which make predictions directly from input images, saw particularly broad adoption through the 2010s. Since then, continually rapid advances in computer vision have transformed the standard practices around using such models. It is now commonplace to use standardized architectures pre-trained on large corpora of everyday images (e.g., ImageNet). In contrast, time-domain astronomy studies still typically design custom CNN architectures and train them from scratch. Here, we explore the effects of adopting various pre-training regimens and standardized model architectures on the performance of alert classification. We find that the resulting models match or outperform a custom, specialized CNN like what is typically used for filtering alerts. Moreover, our results show that pre-training on galaxy images from Galaxy Zoo tends to yield better performance than pre-training on ImageNet or training from scratch. We observe that the design of standardized architectures are much better optimized than the custom CNN baseline, requiring significantly less time and memory for inference despite having more trainable parameters. On the eve of the Legacy Survey of Space and Time and other image-differencing surveys, these findings advocate for a paradigm shift in the creation of vision models for alerts, demonstrating that greater performance and efficiency, in time and in data, can be achieved by adopting the latest practices from the computer vision field.

79 ASTRONOMY AND ASTROPHYSICS↗