Search NASA⌕ Search

SEARCH · Search NASA

Results for “Differentiable programming”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Fuel-Cladding Eutectic Study of Legacy Fast Flux Test Facility (FFTF) MFF HT9/U-10Zr Metallic Fuel

This report presents the first systematic investigation of fuel-cladding eutectic interaction (FCEI) in irradiated HT9/U-10Zr metallic fuel from the Fast Flux Test Facility (FFTF) Materials Fuels Form (MFF) program, using differential scanning calorimetry (DSC) coupled with scanning electron microscopy (SEM) and energy dispersive X-ray spectroscopy (EDS). Two irradiated fuel cross-sections, MNT07H (9.5 at% burnup, x/L = 0.78) and MNT08H (7.0 at% burnup, x/L = 0.93), were subjected to three successive isothermal annealing rounds (R1–R3) at 820°C for 20 minutes each, yielding a cumulative transient duration of one hour. This study directly addresses a recognized gap in the existing FCEI database, which previously lacked irradiated HT9/U-10Zr data at burnup levels above 8 at%. Two principal findings emerge from the study. First, for both samples, FCEI remained spatially confined within the pre-existing fuel-cladding chemical interaction (FCCI) zone boundaries after R3, with no measurable eutectic penetration into unaffected cladding beyond the original FCCI layer. This self-limiting behavior is consistent with historical Fuel Behavior Test Apparatus (FBTA) results and is attributed to the near-eutectic phase composition of the FCCI zone, which rapidly absorb the available eutectic-forming constituents and then stall penetration once the FCCI zone is consumed. A comparison with unirradiated surrogate data further supports this mechanism: whereas a U–34 at.% Fe sample would be expected to show ~176 µm of iron penetration under comparable conditions, the irradiated samples exhibited only ~20 µm, a discrepancy attributed to irradiation-induced interfacial porosity and pre-existing FCCI composition gradients. Second, for MNT08H, FCEI was observed exclusively on the half of the cladding circumference where pre-existing steady-state FCCI was present, with no detectable FCEI on the opposite half. Three hypotheses are proposed to explain this asymmetry: the inhibiting role of a zirconium-rich rind at the fuel-cladding interface; the chemical sequestration of iron by redistributed zirconium within the fuel matrix; and the persistence of fuel-cladding gaps on the FCEI-free half that preclude direct contact. All three hypotheses require further experimental investigation. The results extend the empirical FCEI database into higher-burnup territory and demonstrate the viability of DSC-based testing as a substitute for the no-longer-available FBTA apparatus. Future work will include additional cross-section testing, compilation of the full FCEI dataset, model evaluation, and DSC testing of ternary fuel compositions to broaden the experimental basis for safety assessment of sodium-cooled fast reactor systems.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2022

Reverse-mode differentiation in arbitrary tensor network format: with application to supervised learning.

This paper describes an efficient reverse-mode differentiation algorithm for contraction operations of tensor networks that may have arbitrary and unconventional network topologies. The approach leverages the tensor contraction tree of Evenbly and Pfeifer (2014), which provides an instruction set for the contraction sequence of a network. We show that this tree can be efficiently leveraged for differentiation of a full tensor network contraction using a recursive scheme that exploits (1) the bilinear property of contraction and (2) the property that trees have single path from root to leaves. While differentiation of tensor-tensor contraction is already possible in most automatic differentiation packages, we show that exploiting these two additional properties in the specific context of contraction sequences can improve efficiency. Following a description of the algorithm and computational complexity analysis, we investigate its utility for gradient-based supervised learning for low-rank function recovery and for fitting real-world unstructured datasets. We demonstrate improved performance over alternating least-squares optimization approaches and the capability to handle heterogeneous and arbitrary tensor network formats. When compared to alternating minimization algorithms, we find that the gradient-based approach requires a smaller oversampling ratio (number of samples compared to number model parameters) for recovery. This increased efficiency extends to fitting unstructured data of varying dimensionality and when employing a variety of tensor network formats. Here, we show improved learning using the hierarchical Tucker method over the tensor-train in high-dimensional settings on a number of benchmark problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A multi-language auto differentiation package (mAD) v1.0

This is a multi-language auto differentiation package. It includes multiple language versions of the package. It can be included/used as a module/class in users' application program to enable differentiability of the program. It is simple, transparent, extensible, efficient compared with the other AD package such as Enzyme or Pytorch.

Qiang, Ji [Lawrence Berkeley National Laboratory (↗
DOE OSTI2024

A taxonomy of automatic differentiation pitfalls

Automatic differentiation is a popular technique for computing derivatives of computer programs. While automatic differentiation has been successfully used in countless engineering, science, and machine learning applications, it can sometimes nevertheless produce surprising results. In this paper, we categorize problematic usages of automatic differentiation, and illustrate each category with examples such as chaos, time-averages, discretizations, fixed-point loops, lookup tables, linear solvers, and probabilistic programs, in the hope that readers may more easily avoid or detect such pitfalls. We also review debugging techniques and their effectiveness in these situations.

Autodiff↗
DOE OSTI2024

Qualitative and quantitative enhancement of parameter estimation for model-based diagnostics using automatic differentiation with an application to inertial fusion

Parameter estimation using observables is a fundamental concept in the experimental sciences. Mathematical models that represent the physical processes can enable reconstructions of the experimental observables and greatly assist in parameter estimation by turning it into an optimization problem which can be solved by gradient-free or gradient-based methods. In this work, the recent rise in flexible frameworks for developing differentiable scientific computing programs is leveraged in order to dramatically accelerate data analysis of a common experimental diagnostic relevant to laser–plasma and inertial fusion experiments, Thomson scattering. A differentiable Thomson-scattering data analysis tool is developed that uses reverse-mode automatic differentiation (AD) to calculate gradients. By switching from finite differencing to reverse-mode AD, three distinct outcomes are achieved. First, gradient descent is accelerated dramatically to the extent that it enables near real-time usage in laser–plasma experiments. Second, qualitatively novel quantities which require $\mathcal{O}(10^3)$ parameters can now be included in the analysis of data which enables unprecedented measurements of small-scale laser–plasma phenomena. Third, uncertainty estimation approaches that leverage the value of the Hessian become accurate and efficient because reverse-mode AD can be used for calculating the Hessian.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Varity

Brief Description for Public Release: Varity is a framework to identify variations in floating-point programs through randomized differential testing. Varity generates random tests that include floating-point operations and compile these tests with different compilers in a system. It also generates random floating-point inputs for the tests. When tests are executed, the results are compared to identify variations in the results. Varity helps users of a system to identify the compilers that produce the most similar results in the system.

Laguna Peralta, Ignacio↗
DOE OSTI2024

Towards reverse mode automatic differentiation of Kokkos-based codes

Derivative computation is a key component of optimization, sensitivity analysis, uncertainty quantification, and the solving of nonlinear problems. Automatic differentiation (AD) is a powerful technique for evaluating such derivatives, and in recent years, has been integrated into programming environments such as Jax, PyTorch, and TensorFlow to support derivative computations needed for training of machine learning models, facilitating wide-spread use of these technologies. The C++ language has become the de facto standard for scientific computing due to numerous factors, yet language complexity has made the wide-spread adoption of AD technologies for C++ difficult, hampering the incorporation of powerful differentiable programming approaches into C++ scientific simulations. This is exacerbated by the increasing emergence of architectures, such as GPUs, with limited memory capabilities and requiring massive thread-level concurrency. C++ AD tools must effectively use these environments to bring novel scientific simulations to next-generation DOE experimental and observational facilities. In this project, we investigated source transformation-based automatic differentiation using LLVM compiler infrastructure to automatically generate portable and efficient gradient computations of Kokkos-based code. We have demonstrated that our proposed strategy is feasible by investigating the usage of a prototype LLVM-based source transformation tool to generate gradients of simple functions made of sequences of simple Kokkos parallel regions. Speedups of up to 500x compared to Sacado were observed on NVIDIA V100 GPU.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Analysis of Abdominal Radiology fellowship website content and comprehensiveness

Purpose: Fellowship programs’ online content plays a key role in prospective Abdominal Radiology applicants’ evaluation of programs. The purpose of this study is to examine the online accessibility of Abdominal Radiology fellowships, the comprehensiveness of the program websites’ content, and evaluate whether specific program characteristics are associated with differentiated website comprehensiveness. Methods: A list of 67 Abdominal Radiology fellowship programs was obtained from the Society of Abdominal Radiology (SAR) website. Each of the 65 publicly-available fellowship websites was scored for the presence of 19 binary variables related to the program’s attributes and curriculum to assess informational comprehensiveness. Comprehensiveness scores were compared by program characteristics (accreditation status, region, and size) using Kruskal–Wallis and two-tailed t tests. Results: Mean comprehensiveness score of Abdominal Radiology fellowship websites as measured by online criteria met was 52.6% (10.0 ± 3.0/19). Application requirements and information, rotation scheduling, and program director contact were found on more than 87.5% of the 65 websites, whereas salary and benefits, social information, and alumni were listed on fewer than 33.8% (22/65) of websites. Program accreditation status, region, and size were not associated with difference in mean comprehensiveness scores. Conclusions: There is a discrepancy between information commonly sought by prospective Abdominal Radiology fellowship applicants and what is available on fellowship program websites. Programs and applicants alike may benefit from programs strengthening their online material.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2024

Optimization using pathwise algorithmic derivatives of electromagnetic shower simulations

Among the well-known methods to approximate derivatives of expectancies computed by Monte-Carlo simulations, averages of pathwise derivatives are often the easiest one to apply. Computing them via algorithmic differentiation typically does not require major manual analysis and rewriting of the code, even for very complex programs like simulations of particle-detector interactions in high-energy physics. However, the pathwise derivative estimator can be biased if there are discontinuities in the program, which may diminish its value for applications. This work integrates algorithmic differentiation into the electromagnetic shower simulation code HepEmShow based on G4HepEm, allowing us to study how well pathwise derivatives approximate derivatives of energy depositions in a sampling calorimeter with respect to parameters of the beam and geometry. We found that when multiple scattering is disabled in the simulation, means of pathwise derivatives converge quickly to their expected values, and these are close to the actual derivatives of the energy deposition. Additionally, we demonstrate the applicability of this novel gradient estimator for stochastic gradient-based optimization in a model example.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

GenASiS Mathematics: Object-oriented manifolds, operations, and solvers for large-scale physics simulations (version 2)

We report GenASiS Mathematics provides modern Fortran classes furnishing extensible object-oriented functionality for the solution of fields governed by selected partial differential equations. The initial release included extensible object-oriented implementations of simple meshes and the evolution of generic conserved currents thereon. This revision - Version 2 of Mathematics - includes significant reorganization and streamlining of these classes, higher-order reconstruction by a different method, a Poisson solver, coarsening to avoid Courant time step limitations near coordinate singularities, and the offloading of computational kernels to GPUs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A solution framework for linear PDE-constrained mixed-integer problems

Abstract We present a general numerical solution method for control problems with state variables defined by a linear PDE over a finite set of binary or continuous control variables. We show empirically that a naive approach that applies a numerical discretization scheme to the PDEs to derive constraints for a mixed-integer linear program (MILP) leads to systems that are too large to be solved with state-of-the-art solvers for MILPs, especially if we desire an accurate approximation of the state variables. Our framework comprises two techniques to mitigate the rise of computation times with increasing discretization level: First, the linear system is solved for a basis of the control space in a preprocessing step. Second, certain constraints are just imposed on demand via the IBM ILOG CPLEX feature of a lazy constraint callback. These techniques are compared with an approach where the relations obtained by the discretization of the continuous constraints are directly included in the MILP. We demonstrate our approach on two examples: modeling of the spread of wildfire and the mitigation of water contamination. In both examples the computational results demonstrate that the solution time is significantly reduced by our methods. In particular, the dependence of the computation time on the size of the spatial discretization of the PDE is significantly reduced.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Cross Section Evaluation for Exclusive Channels of K+Λ and K+Σ0 Electroproduction off Protons Using CLAS Detector Data

In this work, a method for evaluating the cross sections of electroproduction of K+Λ0 and K+Σ0 off protons in the region of invariant masses of final hadrons MK + MY <W < 2.65 GeV (MK and MY being the masses of the kaon and hyperon, respectively) and squares of four-momentum transfers of virtual photons, i.e., photon virtualities 0 < Q2 < 5 GeV2, is developed based on experimental data of these exclusive channels’ cross sections measured by the CLAS detector in Hall B at Jefferson Lab. A set of algorithms has been implemented to evaluate the differential cross sections of these channels, along with their statistical and systematic uncertainties. A program was developed for the evaluation of differential cross sections and structure functions using C++ and Python libraries. An interactive website was created for working with the program, enabling the analysis of one-dimensional and two-dimensional dependences of structure functions and differential cross sections. The evaluation of differential cross sections for the K+Λ and K+Σ0 electroproduction channels is necessary for extracting the structure function σLT from the data on the polarization asymmetry of electroproduction reactions of these final states with longitudinally polarized electrons. The obtained results are also important for the development of realistic Monte Carlo event generators in planning future experiments and for evaluating the efficiency of detecting final particles when extracting reaction cross sections from experimental data.

Golda, A. V.↗
DOE OSTI2019

Dynamic BAF chromatin remodeling complex subunit inclusion promotes temporally distinct gene expression programs in cardiogenesis

Chromatin remodeling complexes instruct cellular differentiation and lineage specific transcription. The BRG1/BRM-associated factor (BAF) complexes are important for several aspects of differentiation. We show that the catalytic subunit gene Brg1 has a specific role in cardiac precursors (CPs) to initiate cardiac gene expression programs and repress non-cardiac expression. Using immunopurification with mass spectrometry, we have determined the dynamic composition of BAF complexes during mammalian cardiac differentiation, identifying several cell-type specific subunits. We focused on the CP- and cardiomyocyte (CM)-enriched subunits BAF60c (SMARCD3) and BAF170 (SMARCC2). Baf60c and Baf170 co-regulate gene expression with Brg1 in CPs, and in CMs their loss results in broadly deregulated cardiac gene expression. BRG1, BAF60c and BAF170 modulate chromatin accessibility, to promote accessibility at activated genes while closing chromatin at repressed genes. BAF60c and BAF170 are required for proper BAF complex composition, and BAF170 loss leads to retention of BRG1 at CP-specific sites. Thus, dynamic interdependent BAF complex subunit assembly modulates chromatin states and thereby participates in directing temporal gene expression programs in cardiogenesis.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Simultaneous Measurements of Noncommuting Observables: Positive Transformations and Instrumental Lie Groups

We formulate a general program for describing and analyzing continuous, differential weak, simultaneous measurements of noncommuting observables, which focuses on describing the measuring instrument autonomously, without states. The Kraus operators of such measuring processes are time-ordered products of fundamental differential positive transformations, which generate nonunitary transformation groups that we call instrumental Lie groups. The temporal evolution of the instrument is equivalent to the diffusion of a Kraus-operator distribution function, defined relative to the invariant measure of the instrumental Lie group. This diffusion can be analyzed using Wiener path integration, stochastic differential equations, or a Fokker-Planck-Kolmogorov equation. This way of considering instrument evolution we call the Instrument Manifold Program. We relate the Instrument Manifold Program to state-based stochastic master equations. We then explain how the Instrument Manifold Program can be used to describe instrument evolution in terms of a universal cover that we call the universal instrumental Lie group, which is independent not just of states, but also of Hilbert space. The universal instrument is generically infinite dimensional, in which case the instrument’s evolution is chaotic. Special simultaneous measurements have a finite-dimensional universal instrument, in which case the instrument is considered principal, and it can be analyzed within the differential geometry of the universal instrumental Lie group. Principal instruments belong at the foundation of quantum mechanics. We consider the three most fundamental examples: measurement of a single observable, position and momentum, and the three components of angular momentum. As these measurements are performed continuously, they converge to strong simultaneous measurements. For a single observable, this results in the standard decay of coherence between inequivalent irreducible representations. For the latter two cases, it leads to a collapse within each irreducible representation onto the classical or spherical phase space, with the phase space located at the boundary of these instrumental Lie groups.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

A feasible order-arbitrarily-tunable optical differentiator

We propose a feasible temporal filtering (or spectrum weighting) system to implement optical differentiation with arbitrarily-tunable order. Differentiation order is tuned by programming the temporal weighting mask (TWM) as power function of different exponents, not limited by the structure of the system. Assembly of the system is feasible, since the active parts are implemented by electro-optic elements and some key elements are reused between sub-systems involved in the scheme. Tuning of the system is simple, since electronically pre-stored TWMs are easy to switch among each other. The order-tunable functionality is verified by numerically testing the differentiation cases of normalized input pulse duration ranging from 0.1 to 0.4, and of differentiation order tuned from 1 to 10. Good accuracy is achieved, and measured by root mean square error lower than 0.1. Feasibilities of the system are also verified in terms of accuracy maintaining and distortion avoiding. Compared with existing methods, apart from the arbitrary order-tunable capacity and good accuracy, our proposed optical differentiator also possesses properties of good compactness and constant complexity. The proposed differentiator has unique applications on multi-peak waveform generation for optical communications and photonics-aided Radars with enhanced agility and feasibility.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Automatic Differentiation for Adjoint Stencil Loops

Stencil loops are a common motif in computations including convolutional neural networks, structured-mesh solvers for partial differential equations, and image processing. Stencil loops are easy to parallelise, and their fast execution is aided by compilers, libraries, and domain-specific languages. Reverse-mode automatic differentiation, also known as algorithmic differentiation, autodiff, adjoint differentiation, or back-propagation, is sometimes used to obtain gradients of programs that contain stencil loops. Unfortunately, conventional automatic differentiation results in a memory access pattern that is not stencil-like and not easily parallelisable. In this paper we present a novel combination of automatic differentiation and loop transformations that preserves the structure and memory access pattern of stencil loops, while computing fully consistent derivatives. The generated loops can be parallelised and optimised for performance in the same way and using the same tools as the original computation. We have implemented this new technique in the Python tool PerforAD, which we release with this paper along with test cases derived from seismic imaging and computational fluid dynamics applications.

Automatic Differentiation↗
DOE OSTI2023

A Fast Temporal Decomposition Procedure for Long-Horizon Nonlinear Dynamic Programming

We propose a fast temporal decomposition procedure for solving long-horizon nonlinear dynamic programs. The core of the procedure is sequential quadratic programming (SQP) that utilizes a differentiable exact augmented Lagrangian as the merit function. Within each SQP iteration, we approximately solve the Newton system using an overlapping temporal decomposition strategy. We show that the approximate search direction is still a descent direction of the augmented Lagrangian provided the overlap size and penalty parameters are suitably chosen, which allows us to establish the global convergence. Moreover, we show that a unit step size is accepted locally for the approximate search direction and further establish a uniform, local linear convergence over stages. This local convergence rate matches the rate of the recent Schwarz scheme (Na et al. 2022). However, the Schwarz scheme has to solve nonlinear subproblems to optimality in each iteration, whereas we only perform a single Newton step instead. Numerical experiments validate our theories and demonstrate the superiority of our method.

97 MATHEMATICS AND COMPUTING↗