Search NASASearch

SEARCH · Search NASA

Results for “pruning”

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 37 records · Page 2

Unsupervised atomic data mining via multi-kernel graph autoencoders for machine learning force fields

Constructing a chemically diverse dataset while avoiding sampling bias is critical to training efficient and generalizable force fields. However, in computational chemistry and materials science, many common dataset generation techniques are prone to oversampling regions of the potential energy surface. Furthermore, these regions can be difficult to identify and isolate from each other or may not align well with human intuition, making it challenging to systematically remove bias in the dataset. While traditional clustering and pruning (down-sampling) approaches can be useful for this, they can often lead to information loss or a failure to properly identify distinct regions of the potential energy surface due to difficulties associated with the high dimensionality of atomic descriptors. In this work, we introduce the Multi-kernel Edge Attention-based Graph Autoencoder (MEAGraph) model, an unsupervised approach for analyzing atomic datasets. MEAGraph combines multiple linear kernel transformations with attention-based message passing to capture geometric sensitivity and enable effective dataset pruning without relying on labels or extensive training. Demonstrated applications on niobium, tantalum, and iron datasets show that MEAGraph efficiently groups similar atomic environments, allowing for the use of basic pruning techniques for removing sampling bias. This approach provides an effective method for representation learning and clustering that can be used for data analysis, outlier detection, and dataset optimization.

Materials science

Uncontrolled Learning: Codesign of Neuromorphic Hardware Topology for Neuromorphic Algorithms

Neuromorphic computing has the potential to revolutionize future technologies and our understanding of intelligence, yet it remains challenging to realize in practice. The learning-from-mistakes algorithm, inspired by the brain's simple learning rules of inhibition and pruning, is one of the few brain-like training methods. This algorithm is implemented in neuromorphic memristive hardware through a codesign process that evaluates essential hardware trade-offs. While the algorithm effectively trains small networks as binary classifiers and perceptrons, performance declines significantly with increasing network size unless the hardware is tailored to the algorithm. This work investigates the trade-offs between depth, controllability, and capacity—the number of learnable patterns—in neuromorphic hardware. This highlights the importance of topology and governing equations, providing theoretical tools to evaluate a device's computational capacity based on its measurements and circuit structure. The findings show that breaking neural network symmetry enhances both controllability and capacity. Additionally, by pruning the circuit, neuromorphic algorithms in all-memristive circuits can utilize stochastic resources to create local contrasts in network weights. Through combined experimental and simulation efforts, the parameters are identified that enable networks to exhibit emergent intelligence from simple rules, advancing the potential of neuromorphic computing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC

DESIVAST: Catalogs of Low-redshift Voids Using Data from the DESI Data Release 1 Bright Galaxy Survey

We present three separate void catalogs created using a volume-limited sample of the DESI Data Release 1 Bright Galaxy Survey. We use the algorithms VoidFinder and V 2 to construct void catalogs out to a redshift of z = 0.24. Excluding voids affected by the boundaries of the survey, we obtain 1489 voids with VoidFinder, 389 with V 2 using REVOLVER pruning, and 297 with V 2 using VIDE pruning. Comparing our catalogs with overlapping Sloan Digital Sky Survey void catalogs, we find generally consistent void properties but significant differences in the void volume overlap, which we attribute to differences in the galaxy selection and survey masks. These catalogs are suitable for studying the variation in galaxy properties with cosmic environment and for cosmological studies.

79 ASTRONOMY AND ASTROPHYSICS

Development of an Accelerated Test Design for Predicting the Service Life of the Solar Array at Mead, Nebraska

Potential long-term degradation modes for the two types of modules in the Mead array were determined and judgments were made as to those environmental stresses and combinations of stresses which accelerate the degradation of the power output. Hierarchical trees representing the severity of effects of stresses (test conditions) on eleven individual degradation modes were constructed and were pruned of tests judged to be nonessential. Composites of those trees were developed so that there is now one pruned tree covering eight degradation modes, another covering two degradation modes, and a third covering one degradation mode. These three composite trees form the basis for selection of test conditions in the final test plan which is now being prepared.

Gaines, G. B.

Greenhouse tomato limited cluster production systems: crop management practices affect yield

Limited-cluster production systems may be a useful strategy to increase crop production and profitability for the greenhouse tomato (Lycopersicon esculentum Mill). In this study, using an ebb-and-flood hydroponics system, we modified plant architecture and spacing and determined the effects on fruit yield and harvest index at two light levels. Single-cluster plants pruned to allow two leaves above the cluster had 25% higher fruit yields than did plants pruned directly above the cluster; this was due to an increase in fruit weight, not fruit number. Both fruit yield and harvest index were greater for all single-cluster plants at the higher light level because of increases in both fruit weight and fruit number. Fruit yield for two-cluster plants was 30% to 40% higher than for single-cluster plants, and there was little difference in the dates or length of the harvest period. Fruit yield for three-cluster plants was not significantly different from that of two-cluster plants; moreover, the harvest period was delayed by 5 days. Plant density (5.5, 7.4, 9.2 plants/m2) affected fruit yield/plant, but not fruit yield/unit area. Given the higher costs for materials and labor associated with higher plant densities, a two-cluster crop at 5.5 plants/m2 with two leaves above the cluster was the best of the production system strategies tested.

Non-NASA Center

New high performance algorithmic solution for diagnosis problem

In this paper we address the problem of generating the minimal diagnosis from the conflicts. This problem can be formulated as the well-known Hitting Set Problem. Our approach starts by mapping the Hitting Set problem into the Integer Programming Problem that enables us, for the first time, a priori determination of the lower and upper bounds on the size for the solution. Based on these bounds, we introduce a new concept of solution window for the problem. We also propose a new branch-and-bound technique that not only is faster than the current techniques in terms of number of operations (by exploiting the structure of the problem) but also, using the concept of window, allows a massive reduction (pruning) in the number of branches. Furthermore, as the branch-and-bound proceeds, the solution window is dynamically updated and narrowed to enable further pruning.

diagnosis problems

Statistical Symbolic Execution with Informed Sampling

Symbolic execution techniques have been proposed recently for the probabilistic analysis of programs. These techniques seek to quantify the likelihood of reaching program events of interest, e.g., assert violations. They have many promising applications but have scalability issues due to high computational demand. To address this challenge, we propose a statistical symbolic execution technique that performs Monte Carlo sampling of the symbolic program paths and uses the obtained information for Bayesian estimation and hypothesis testing with respect to the probability of reaching the target events. To speed up the convergence of the statistical analysis, we propose Informed Sampling, an iterative symbolic execution that first explores the paths that have high statistical significance, prunes them from the state space and guides the execution towards less likely paths. The technique combines Bayesian estimation with a partial exact analysis for the pruned paths leading to provably improved convergence of the statistical analysis. We have implemented statistical symbolic execution with in- formed sampling in the Symbolic PathFinder tool. We show experimentally that the informed sampling obtains more precise results and converges faster than a purely statistical analysis and may also be more efficient than an exact symbolic analysis. When the latter does not terminate symbolic execution with informed sampling can give meaningful results under the same time and memory limits.

Reliability

An Active Learning Framework for Hyperspectral Image Classification Using Hierarchical Segmentation

Augmenting spectral data with spatial information for image classification has recently gained significant attention, as classification accuracy can often be improved by extracting spatial information from neighboring pixels. In this paper, we propose a new framework in which active learning (AL) and hierarchical segmentation (HSeg) are combined for spectral-spatial classification of hyperspectral images. The spatial information is extracted from a best segmentation obtained by pruning the HSeg tree using a new supervised strategy. The best segmentation is updated at each iteration of the AL process, thus taking advantage of informative labeled samples provided by the user. The proposed strategy incorporates spatial information in two ways: 1) concatenating the extracted spatial features and the original spectral features into a stacked vector and 2) extending the training set using a self-learning-based semi-supervised learning (SSL) approach. Finally, the two strategies are combined within an AL framework. The proposed framework is validated with two benchmark hyperspectral datasets. Higher classification accuracies are obtained by the proposed framework with respect to five other state-of-the-art spectral-spatial classification approaches. Moreover, the effectiveness of the proposed pruning strategy is also demonstrated relative to the approaches based on a fixed segmentation.

classification

Improving Coverage of Test Cases Generated by Symbolic PathFinder for Programs with Loops

Symbolic execution is a program analysis technique that is used for many purposes, one of which is test-case generation. For loop-free programs, this generates a test-set that achieves path coverage. Program loops, however, imply exponential growth of the number of paths in the best case and non-termination in the worst case. In practice, the number of loop unwindings needs to be bounded for analysis. We consider symbolic execution in the context of the tool Symbolic Pathfinder. This tool extends the model-checker Java Pathfinder and relies on its bounded state-space exploration for termination. We present an implementation of k-bounded loop unwinding, which increases the amount of user-control over the symbolic execution of loops. Bounded unwinding can be viewed as a naive way to prune paths through loops. When using symbolic execution for test-case generation, naively pruning paths is likely at the cost of coverage. In order to improve coverage of branches within a loop body, we present a technique that semi-automatically concretizes variables used in a loop. The basic technique is limited and we therefore present annotations to manually steer symbolic execution towards certain branches, as well as ideas on how the technique can be extended to be more widely applicable.

Programs With Loops

Semi-analytic preliminary design of low-thrust missions

Using generalized logarithmic spirals to approximate low-thrust trajectories, a new strategy for the design of low-thrust gravity-assist transfers has been developed. Each transfer leg is defined by a semi-analytic model, and its solution is equivalent to a hybrid Lambert’s problem. The method is suitable for approximating both flyby and rendezvous transfer legs. A branch and prune algorithm is used to generate a collection of initial guesses for further optimization. The analytic nature of the low-thrust model simplifies the pruning step, since dynamical and operational constraints (like maximum thrust or total v) can be imposed easily. The solutions obtained with the global search algorithm can be post-processed, filtered, and ranked according to various criteria. This is where the versatility of the method resides, because changing the selection criteria does not require a new search. Selected candidates are then optimized further, in order to generate actual low-thrust orbits. Two mission design examples are presented: an asteroid deflection mission using a kinetic impactor, and a rendezvous mission to Jupiter. These examples are used to analyze the convergence of the optimization stage, in particular how far from the optimal solution the initial guesses are.

Park, Ryan S.

Neural architecture codesign for fast physics applications

We develop a pipeline to streamline neural architecture codesign for physics applications to reduce the need for ML expertise when designing models for novel tasks. Our method employs neural architecture search and network compression in a two-stage approach to discover hardware efficient models. This approach consists of a global search stage that explores a wide range of architectures while considering hardware constraints, followed by a local search stage that fine-tunes and compresses the most promising candidates. We exceed performance on various tasks and show further speedup through model compression techniques such as quantization-aware-training and neural network pruning. We synthesize the optimal models to high level synthesis code for FPGA deployment with the hls4ml library. Additionally, our hierarchical search space provides greater flexibility in optimization, which can easily extend to other tasks and domains. We demonstrate this with two case studies: Bragg peak finding in materials science and jet classification in high energy physics, achieving models with improved accuracy, smaller latencies, or reduced resource utilization relative to the baseline models.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS

Flexible AI Models for Grid Resilience

The rapid growth in size and complexity of artificial intelligence (AI) and machine learning (ML) models has led to increased energy demands, posing a threat to the reliability of the existing power grid. This project addresses the challenge of highly intermittent and energy-intensive inference workloads by (1) developing fidelity-adaptive neural networks capable of dynamic response to grid conditions and (2) integrating these networks with power flow simulations to assess their impact on power grid reliability. We will explore both top-down and bottom-up approaches to create hierarchies of submodels that provide a controlled trade-off between power draw and prediction accuracy. The top-down method utilizes NN pruning to reduce a flagship model into progressively smaller, energy-efficient variants. The bottom-up approach employs geometrically principled weight setting strategies to construct depth-efficient models from the ground up. A real-time hardware-in-the-loop (HIL) platform will be developed to simulate a scaled AC power grid, integrating live AI workload power draw and enabling dynamic model switching in response to grid feedback. This work will provide a novel framework for evaluating the impact of flexible AI/ML workloads on grid performance and establish new methodologies for energy-aware computing in data centers. The outcomes will demonstrate that adaptive AI/ML can play a critical role in improving grid stability while advancing NREL's leadership in energy-efficient computing research.

24 POWER TRANSMISSION AND DISTRIBUTION

Improved Statistics for F-theory Standard Models

Much of the analysis of F-theory-based Standard Models boils down to computing cohomologies of line bundles on matter curves. By varying parameters one can degenerate such matter curves to singular ones, typically with many nodes, where the computation is combinatorial and straightforward. The question remains to relate the (a priori possibly smaller) value on the original curve to the singular one. In this work, we introduce some elementary techniques (pruning trees and removing interior edges) for simplifying the resulting nodal curves to a small collection of terminal ones that can be handled directly. When applied to the QSMs, these techniques yield optimal results in the sense that obtaining more precise answers would require currently unavailable information about the QSM geometries. This provides us with an opportunity to enhance the statistical bounds established in earlier research regarding the absence of vector-like exotics on the quark-doublet curve.

Bies, Martin

Learning interpretable surface elasticity properties from bulk properties via neural network equation learners

Surface elasticity is central to understanding the mechanics and stability of surfaces and interfaces. It is characterized by quantities such as surface tension, residual surface stress, and surface stiffness. However their analytical expressions are typically difficult to derive from atomistic data, and depend strongly on modeling choices. This work presents a neural network-based equation learner which combines customized activation functions and connection-based pruning to discover parsimonious, closed-form equations for surface elasticity from atomistic simulations. Applying the method to seven face-centered cubic (FCC) metals, our equation learner uncovers interpretable equations that describe both low-Miller index and high-Miller index surface properties, capturing long-tail property distributions accurately. The discovered expressions are decoupled into two components: a universal, geometry-driven orientation function, and material-specific baseline coefficients. We find that lower-order properties such as surface tension are fundamentally geometry dependent, while higher-order properties such as surface stress and elasticity show more complex geometry and material dependence. We also relate material dependent coefficients to bulk properties, forming a clear map from bulk material properties to surface elasticity. Overall, this approach demonstrates that interpretable neurosymbolic machine learning can bridge the gap between atomistic simulations and physical laws, enabling the discovery of generalizable structure–property relationships for materials science phenomena such as surface elasticity.

Equation learning

Physics-Driven Construction of Compact Primitive Gaussian Density Fitting Basis Sets

We present a model-assisted density fitting (MADF) basis set generator, an algorithm for generating primitive atomic Gaussian density fitting (DF) basis sets (DFBSs) from a contracted Gaussian orbital basis set (OBS). The MADF algorithm produces DFBSs suitable for accurate robust DF approximation of 2-particle interactions in mean-field and correlated electronic structures. The algorithm is designed to (a) saturate the OBS product space by a large regularized set of primitive solid-harmonic Gaussian shells with nonuniform distribution of exponents, followed by (b) pruning of the shells according to their contributions to the 2- body energy of a correlated atomic ensemble. Building the DFBS generator model almost exclusively on mathematical and physical principles allows one to limit the number of parameters that control the density fitting error to three, with a single set of parameters sufficient for computations with all basis cardinal numbers, with and without correlation of core electrons, with and without scalar and spin-dependent relativistic effects, spanning almost all of the Periodic Table. Performance assessment included basis sets up to quadruple-ζ quality from several major basis set families, using molecules composed of main-group, d-block, and f-block elements. The resulting DF errors in Hartree−Fock and second-order MP2 energies (with relativistic all-electron treatments, when appropriate) were on the order of 20 and 10 μE h per electron, respectively.

Approximation

Global River Topology (GRIT): A Bifurcating River Hydrography

Existing global river networks underpin a wide range of hydrological applications but do not represent channels with divergent river flows (bifurcations, multi‐threaded channels, canals), as these features defy the convergent flow assumption that elevation‐derived networks (e.g., HydroSHEDS, MERIT Hydro) are based on. Yet, bifurcations are important features of the global river drainage system, especially on large floodplains and river deltas, and are also often found in densely populated regions. Here we developed the first raster and vector‐based Global RIver Topology that not only represents the tributaries of the global drainage network but also the distributaries, including multi‐threaded rivers, canals and deltas. We achieve this by merging a 30 m Landsat‐based river mask with elevation‐generated streams to ensure a homogeneous drainage density outside of the river mask for rivers narrower than approximately 30 m. Crucially, we employ the new 30 m digital terrain model, FABDEM, based on TanDEM‐X, which shows greater accuracy over the traditionally used SRTM derivatives. After vectorization and pruning, directionality is assigned by a series of elevation, flow angle and continuity approaches. The new global network and its attributes are validated using gauging stations, comparison with existing networks, and randomized manual checks. The new network represents 19.6 million km of streams and rivers with drainage areas greater than 50 km 2 and includes 67,495 bifurcations. With the advent of hyper‐resolution modeling and artificial intelligence, GRIT is expected to greatly improve the accuracy of many river‐based applications such as flood forecasting, water availability and quality simulations, or riverine habitat mapping.

54 ENVIRONMENTAL SCIENCES

Maximizing efficiency of dataset compression for machine learning potentials with information theory

Machine learning interatomic potentials (MLIPs) balance high accuracy and lower costs compared to density functional theory calculations, but their performance often depends on the size and diversity of training datasets. Large datasets improve model accuracy and generalization but are computationally expensive to produce and train on, while smaller datasets risk discarding rare but important atomic environments and compromising MLIP accuracy/reliability. Here, we develop an information-theoretical framework to quantify the efficiency of dataset compression methods and propose an algorithm that maximizes this efficiency. By framing atomistic dataset compression as an instance of the minimum set cover (MSC) problem over atom-centered environments, our method identifies the smallest subset of structures that contains as much information as possible from the original dataset while pruning redundant information. The approach is extensively demonstrated on the GAP-20 and TM23 datasets and validated on 64 varied datasets from the ColabFit repository. Across all cases, MSC consistently retains outliers, preserves dataset diversity, and reproduces the long-tail distributions of forces even at high compression rates, outperforming other subsampling methods. Furthermore, MLIPs trained on MSC-compressed datasets exhibit reduced error for out-of-distribution data even in low-data regimes. We explain these results using an outlier analysis and show that such quantitative conclusions could not be achieved with conventional dimensionality reduction methods. The algorithm is implemented in the open-source QUESTS package and can be used for several tasks in atomistic modeling, from data subsampling, outlier detection, and training improved MLIPs at a lower cost.

36 MATERIALS SCIENCE

Spatial Correlations of the Poisson Model for Radiation Transport

Characterizing the relationship between bulk physical properties and mixing in randomly heterogeneous media is a central challenge across many areas of science and engineering. A benchmark model for such studies is the Poisson model, a random tessellation of space by a Poisson process of hyperplanes. In radiation transport studies, the lack of exact expressions for the Poisson model’s spatial multipoint functions has led to approximate methods being used, introducing unquantified sources of error. Here, we recently introduced an exact solution for the Poisson model’s multipoint functions and closely related conditional probability functions (CPFs), providing a new opportunity to understand and reduce these sources of error. In this paper, we enable a more rigorous investigation of radiation transport in stochastic media by applying the recently introduced exact solution for the Poisson model’s CPFs. This paper consists of three main contributions. First, we introduce a unified framework for CPFs of the Poisson model, encompassing the recently introduced exact CPFs as well as the previously introduced atomic mix, nearest-neighbor, and combination CPFs. This framework also includes existing pruning techniques for the approximate CPFs, such as angular exclusion, as well as a novel form of angular exclusion suitable for the exact CPFs. Second, we use the exact CPFs to characterize the spatial regions where each approximate three-point CPF is most accurate, thereby explaining the observed hierarchy of accuracy among the approximate models. Finally, we evaluate material transmittance, reflectance, and flux in a three-dimensional test problem using conditional point sampling, demonstrating the relationship between CPF accuracy and transport simulation accuracy.

Poisson model