Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic differentiation”

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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

OmniFed: A Modular Framework for Configurable Federated Learning from Edge to HPC

Federated Learning (FL) is critical for edge and High Performance Computing (HPC) where data is not centralized and privacy is crucial. We present OmniFed, a modular framework designed around decoupling and clear separation of concerns for configuration, orchestration, communication, and training logic. Its architecture supports configuration-driven prototyping and code-level override-what-you-need customization. We also support different topologies, mixed communication protocols within a single deployment, and popular training algorithms. It also offers optional privacy mechanisms including Differential Privacy (DP), Homomorphic Encryption (HE), and Secure Aggregation (SA), as well as compression strategies. These capabilities are exposed through well-defined extension points, allowing users to customize topology and orchestration, learning logic, and privacy/compression plugins, all while preserving the integrity of the core system. We evaluate multiple models and algorithms to measure various performance metrics. By unifying topology configuration, mixed-protocol communication, and pluggable modules in one stack, OmniFed streamlines FL deployment across heterogeneous environments. Github repository is available at https://github.com/at-aaims/OmniFed.

Tyagi, Sahil [ORNL] (ORCID:0009000783144745)↗
DOE OSTI2022

Optimal band selection for target detection with a LWIR multispectral imager

Multispectral imaging can offer many benefits in cost, complexity, resolution, size, weight, and power, relative to hyperspectral imaging. When designing a multispectral system, spectral bandpasses can be selected using optimization algorithms configured to maximally separate target detection scores between target and background regions. A hyperspectral image (HSI) can serve as the source of data from which band groupings can be tested for optimality. The output of an adaptive cosine estimator target detection algorithm is used in an objective function. Three optimization algorithms are compared: particle swarm, dual annealing, and differential evolution. A global optimum is also found using a brute force approach on the Livermore Computing Syrah supercomputer. Three materials are investigated: calcite, gypsum, and limestone. This is done for 3-, 4-, and 5-band systems. The data originate from a longwave infrared HSI of a material display board. The optimization algorithms were run 30 times for every scenario. Performance statistics (maximum, minimum, mean, standard deviation, and median) based on the separation values are given. Additional characterization was performed using receiver operator characteristic (ROC) curves and the area under the ROC curve. While good performance was obtained for the three optimization algorithms, the dual annealing algorithm produced the highest and most consistent detection separation scores on average.

47 OTHER INSTRUMENTATION↗
DOE OSTI2021

Relocating microseismicity from downhole monitoring of the Decatur CCS site using a modified double-difference algorithm

SUMMARY The injection of CO2 at the Decatur carbon capture and storage site has generated significant microseismic activity, which occurs in distinct spatial clusters up to approximately 2.2 km from the primary injection well. Accurate and precise event locations are vital for the characterization of the microseismicity to help understand the reservoir response to the CO2 injection, whilst enabling the identification of minor faults and fractures below the resolution of conventional active seismic imaging. However, microseismic monitoring of fluid injection sites, such as Decatur, is often performed using a network of borehole sensors often from a single well. While these downhole sensors have excellent detection capabilities, their poor azimuthal coverage limits the ability to precisely determine event locations. We have developed a modified double-difference relocation algorithm suitable for both 1-D and 3-D velocity models, and which incorporates differential back azimuth observations to allow the benefits of the original double-difference algorithm to be applicable to a downhole microseismic monitoring setting. Applying the modified double-difference algorithm to the microseismicity at Decatur, we have successfully relocated 4293 events. The relocation included over 59 million observations for 757 285 event pairs, split across seven geographic regions. Despite the majority of observations being recorded in only two boreholes, with an almost identical azimuthal coverage, the results have shown to be reliable with significantly reduced residuals and low uncertainties associated with the final locations. We have analysed the residuals in terms of their association with each geographic region, data type, station and individual events, to fully appreciate their influence in the inversion and the fit of the data to the final set of event locations. For each region, the relocated seismicity has become less diffuse with improved clustering, and with newly visible linear features often orientated in a NE–SW direction. These results show the potential improvements that can be made to microseismic event locations recorded by a borehole network with a limited and variable azimuthal distribution.

58 GEOSCIENCES↗
DOE OSTI2022

Quantum-inspired method for solving the Vlasov-Poisson equations

Kinetic simulations of collisionless (or weakly collisional) plasmas using the Vlasov equation are often infeasible due to high-resolution requirements and the exponential scaling of computational cost with respect to dimension. Recently, it has been proposed that matrix product state (MPS) methods, a quantum-inspired but classical algorithm, can be used to solve partial differential equations with exponential speed-up, provided that the solution can be compressed and efficiently represented as a MPS within some tolerable error threshold. Here, in this work, we explore the practicality of MPS methods for solving the Vlasov-Poisson equations for systems with one coordinate in space and one coordinate in velocity, and find that important features of linear and nonlinear dynamics, such as damping or growth rates and saturation amplitudes, can be captured while compressing the solution significantly. Furthermore, by comparing the performance of different mappings of the distribution functions onto the MPS, we develop an intuition of the MPS representation and its behavior in the context of solving the Vlasov-Poisson equations, which will be useful for extending these methods to higher-dimensional problems.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Differentially Private Map Matching (DPMM) v1.0

Human mobility trajectories provide valuable information for developing mobility applications, as they contain diverse and rich information about the users. User mobility data is valuable for various applications such as intelligent transportation systems (ITS), commercial business models, and disease-spread models. However, such spatio-temporal traces may pose a threat to user privacy. GPS trajectories in their raw form are not suitable for transportation studies, as they require matching locations with nearest road links — a process called map-matching. This software implements a differential privacy (DP)-based map-matching algorithm, called DPMM, that generates link-level location trajectories in a privacy-preserving manner to protect users' origin destinations (OD) and travel paths. OD privacy is achieved by injecting Planar Laplace noise to the user OD GPS points. Travel-path privacy is provided with randomized travel path construction using exponential DP mechanism. The injected noise level is selected adaptively, by considering the link density of the location and the functional category of the localized links. For path privacy, our mechanism samples waypoints and selects candidate paths between waypoints. DPMM provides privacy effectively with respect to link density instead of other trajectory samples in the database compared to other privacy mechanisms. Compared to the different baseline models our DP-based privacy model offers closer query responses to the raw data in terms of individual and aggregate trajectory-level statistics with an average at absolute deviation from the baseline for individual statistics on ϵ = 1.0. Beyond individual trajectory statistics, the DPMM outperforms the other benchmark DP-based mechanisms on different aggregate statistics with up to 8x improvement in utility.

Peisert, Sean [Lawrence Berkeley National Laborato↗
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 OSTI2024

Adiabatic quantum imaginary time evolution

We introduce an adiabatic state preparation protocol which implements quantum imaginary time evolution under the Hamiltonian of the system. Unlike the original quantum imaginary time evolution algorithm, adiabatic quantum imaginary time evolution does not require quantum state tomography during its runtime and, unlike standard adiabatic state preparation, the final Hamiltonian is not the system Hamiltonian. Instead, the algorithm obtains the adiabatic Hamiltonian by integrating a classical differential equation that ensures that one follows the imaginary time evolution state trajectory. We introduce some heuristics that allow this protocol to be implemented on quantum architectures with limited resources. We explore the performance of this algorithm via classical simulations in a one-dimensional spin model and highlight essential features that determine its cost, performance, and implementability for longer times, and compare to the original quantum imaginary time evolution for ground-state preparation. More generally, our algorithm expands the range of states accessible to adiabatic state preparation methods beyond those that are expressed as ground states of simple explicit Hamiltonians. Published by the American Physical Society 2024

Hejazi, Kasra (ORCID:000000032349478X)↗
DOE OSTI2022

End-to-end learning of multiple sequence alignments with differentiable Smith–Waterman

Abstract Motivation Multiple sequence alignments (MSAs) of homologous sequences contain information on structural and functional constraints and their evolutionary histories. Despite their importance for many downstream tasks, such as structure prediction, MSA generation is often treated as a separate pre-processing step, without any guidance from the application it will be used for. Results Here, we implement a smooth and differentiable version of the Smith–Waterman pairwise alignment algorithm that enables jointly learning an MSA and a downstream machine learning system in an end-to-end fashion. To demonstrate its utility, we introduce SMURF (Smooth Markov Unaligned Random Field), a new method that jointly learns an alignment and the parameters of a Markov Random Field for unsupervised contact prediction. We find that SMURF learns MSAs that mildly improve contact prediction on a diverse set of protein and RNA families. As a proof of concept, we demonstrate that by connecting our differentiable alignment module to AlphaFold2 and maximizing predicted confidence, we can learn MSAs that improve structure predictions over the initial MSAs. Interestingly, the alignments that improve AlphaFold predictions are self-inconsistent and can be viewed as adversarial. This work highlights the potential of differentiable dynamic programming to improve neural network pipelines that rely on an alignment and the potential dangers of optimizing predictions of protein sequences with methods that are not fully understood. Availability and implementation Our code and examples are available at: https://github.com/spetti/SMURF. Supplementary information Supplementary data are available at Bioinformatics online.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Binary operations on neuromorphic hardware with application to linear algebraic operations and stochastic equations

Abstract Non-von Neumann computational hardware, based on neuron-inspired, non-linear elements connected via linear, weighted synapses—so-called neuromorphic systems—is a viable computational substrate. Since neuromorphic systems have been shown to use less power than CPUs for many applications, they are of potential use in autonomous systems such as robots, drones, and satellites, for which power resources are at a premium. The power used by neuromorphic systems is approximately proportional to the number of spiking events produced by neurons on-chip. However, typical information encoding on these chips is in the form of firing rates that unarily encode information. That is, the number of spikes generated by a neuron is meant to be proportional to an encoded value used in a computation or algorithm. Unary encoding is less efficient (produces more spikes) than binary encoding. For this reason, here we present neuromorphic computational mechanisms for implementing binary two’s complement operations. We use the mechanisms to construct a neuromorphic, binary matrix multiplication algorithm that may be used as a primitive for linear differential equation integration, deep networks, and other standard calculations. We also construct a random walk circuit and apply it in Brownian motion simulations. We study how both algorithms scale in circuit size and iteration time.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Differentiable physics-enabled closure modeling for Burgers’ turbulence

Abstract Data-driven turbulence modeling is experiencing a surge in interest following algorithmic and hardware developments in the data sciences. We discuss an approach using the differentiable physics paradigm that combines known physics with machine learning to develop closure models for Burgers’ turbulence. We consider the one-dimensional Burgers system as a prototypical test problem for modeling the unresolved terms in advection-dominated turbulence problems. We train a series of models that incorporate varying degrees of physical assumptions on an a posteriori loss function to test the efficacy of models across a range of system parameters, including viscosity, time, and grid resolution. We find that constraining models with inductive biases in the form of partial differential equations that contain known physics or existing closure approaches produces highly data-efficient, accurate, and generalizable models, outperforming state-of-the-art baselines. Addition of structure in the form of physics information also brings a level of interpretability to the models, potentially offering a stepping stone to the future of closure modeling.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

New approach to QCD final-state evolution in processes with massive partons

We present an algorithm for massive parton evolution which is based on the differentially accurate simulation of soft-gluon radiation by means of a nontrivial azimuthal angle dependence of the splitting functions. The kinematics mapping is chosen such as to reflect the symmetry of the final state in soft-gluon radiation and collinear splitting processes. We compute the counterterms needed for a fully differential next-to-leading order matching and discuss the analytic structure of the parton shower in the next-to-leading logarithmic limit. We implement the new algorithm in the numerical code Alaric and present a first comparison to experimental data. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

A Computational Framework to design 3D stiffness gradient acoustic metamaterials for impedance matching

Acoustic waves play a crucial role in various applications, including medical imaging, non-destructive testing, and sonar systems. One of the significant challenges in these applications is impedance matching, which is essential for minimizing reflections and maximizing the transfer of acoustic energy between different media. Acoustic metamaterials offer a promising solution to this challenge. In addition to impedance control, gradient stiffness can enhance structural efficiency and enable spatial control of wave propagation, making it a valuable feature in acoustic metamaterial design. In this pa- per, we present our developed computational method to design 3D stiffness gradient acoustic metamaterials for impedance matching. The key steps in our approach include generating initial designs using a periodic covariance function to provide unit cells that are both periodic on the boundaries and randomly formed inside the unit cell. Furthermore, we integrated manufacturing constraints into the design process, ensuring that the structures are interconnected for fabrication. We propose two computational optimization algorithms: GenUnit, based on a non-dominated sorting genetic algorithm (NSGA-II), and MLMatch, which leverages differentiable machine learning. The two approaches are not separate contributions but complementary com- ponents of a unified framework. GenUnit requires no training data and directly interfaces with physics-based simulations, making it highly accurate but slower for large-scale exploration. In contrast, MLMatch is data-hungry during training but, once trained, enables near-instantaneous inference and broad design-space coverage. Together, they form a hybrid strategy: ML- Match rapidly explores the global design space, and GenUnit provides local refinement with high-fidelity accuracy. This balance between training cost, inference time, and precision is the motivation for including both methods in the same study. We applied this dual-algorithm framework to generate two metallic-based metamaterial designs that match the acoustic impedance of water while exhibiting a controlled gradient in stiffness (from stiff to soft). The stiffness gradient is particularly advantageous in applications where one side of the structure must interface with soft or sensitive surfaces, such as human tissue or delicate components. Here, this work paves the way for improved materials in various acoustic applications, particularly in ultrasound devices, by providing better impedance.

Metamaterial↗
DOE OSTI2021

Informing nuclear physics via machine learning methods with differential and integral experiments

Information from differential nuclear-physics experiments and theory is often too uncertain to accurately define nuclear-physics observables such as cross sections or energy spectra. Integral experimental data, representing the applications of these observables, are often more precise but depend simultaneously on too many of them to unambiguously identify issues in the observable with human expert analysis alone. Here, we explore how we can leverage physics knowledge gained from differential experimental data, nuclear theory, integral experiments, and neutron-transport calculations to better understand nuclear-physics observables in the context of the application area represented by integral experiments. We support this task with machine-learning methods to discern trends in a large amount of convoluted data. Differential and integral information was used in an analysis augmented by the random forest and the Shapley additive explanations metric. We chose as an application area one that is represented by criticality measurements and pulsed-sphere neutron-leakage spectra. We show one representative example ( 241 Pu fission observables) where the combination of differential and integral information allowed to resolve issues in data representing these observables. As a starting point, the machine learning (ML) algorithms highlighted several observables as leading potentially to bias in simulating integral experiments. Differential information, paired with sensitivity to integral quantities, allowed us then to pinpoint one specific observable ( 241 Pu fission cross section) as the main driver of bias. The comparison to integral experiments, on the other hand, allowed us to indicate a likely reliable experiment among several discrepant ones for this observables. In other cases (e.g., 239 Pu observables), we were not able to resolve the confounding introduced by integral experiments but instead highlighted the need for targeted new experiments and theory developments to better constrain the nuclear-physics space for the application area represented by integral experiments. We were able to combine information from differential experimental data, nuclear-physics theory, integral experiments, and neutron-transport simulations of the latter experiments with the help of the random forest algorithm and expert judgment. This combination of knowledge allows to improve our description of nuclear-physics observables as applied to a particular application area.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

A Robust Segmented Mixed Effect Regression Model for Baseline Electricity Consumption Forecasting

Renewable energy production has been surging around the world in recent years. To mitigate the increasing uncertainty and intermittency of the renewable generation, proactive demand response algorithms and programs are proposed and developed to further improve the utilization of load flexibility and increase the efficiency of power system operation. One of the biggest challenges to efficient control and operation of demand response resources is how to forecast the baseline electricity consumption and estimate the load impact from demand response resources accurately. In this paper, we propose a mixed effect segmented regression model and a new robust estimate for forecasting the baseline electricity consumption in Southern California, USA, by combining the ideas of random effect regression model, segmented regression model, and the least trimmed squares estimate. Since the log-likelihood of the considered model is not differentiable at breakpoints, we propose a new backfitting algorithm to estimate the unknown parameters. The estimation performance of the new estimation procedure has been demonstrated with both simulation studies and the real data application for the electric load baseline forecasting in Southern California.

42 ENGINEERING↗
DOE OSTI2021

Electromagnetic Transient Simulation Algorithms for Evaluation of Large-Scale Extreme Fast Charging Systems (Distribution Grid Models)

The distribution and transmission grids are observing an increased penetration of power electronics in loads and generations. For example, there is increasing interest in integrating in extreme fast charging (XFC) systems for fast charging of electrical vehicles. As these systems are integrated, developing high-fidelity electromagnetic transient model of XFC systems in distribution grids and evaluating their interactions with the power grid would be of significant interest. This model will be utilized for design of XFC systems, to identify upgrades in distribution and/or transmission grids, for planning purposes by transmission planners or operators or owners, among others. It can also be utilized in operations for improved reliable performance of the grid and/or XFC station. The challenge with simulating these models is the high computational complexity introduced by the large number of states present in the system and the time-step needed to simulate the system. In this paper, advanced simulations algorithms are applied to reduce the computational complexity of simulating large-scale XFC systems. The algorithms include numerical stiffness-based segregation, time constant-based segregation, clustering and aggregation on differential algebraic equations (DAEs), and multi-order integration approaches. While the first three algorithms split the matrix that needs to be inverted from a large matrix to much smaller matrices, the final algorithm reduces the computational burden of applying higher-order integration approaches in the complete system. The comparison made in the previous sentence is with respect to use of homogeneous integration approaches used in conventional electromagnetic transient simulators like power systems computer aided design (PSCAD). The approaches mentioned here have resulted in speed-up of 36x in the simulation of a single distribution system with 15 XFCs.

Debnath, Suman↗
DOE OSTI2021

Multilevel Hierarchical Decomposition of Finite Element White Noise with Application to Multilevel Markov Chain Monte Carlo

In this work we develop a new hierarchical multilevel approach to generate Gaussian random field realizations in an algorithmically scalable manner that is well suited to incorporating into multilevel Markov chain Monte Carlo (MCMC) algorithms. This approach builds off of other partial differential equation (PDE) approaches for generating Gaussian random field realizations; in particular, a single field realization may be formed by solving a reaction-diffusion PDE with a spatial white noise source function as the right-hand side. While these approaches have been explored to accelerate forward uncertainty quantification tasks, e.g., multilevel Monte Carlo, the previous constructions are not directly applicable to multilevel MCMC frameworks which build fine-scale random fields in a hierarchical fashion from coarse-scale random fields. Our new hierarchical multilevel method relies on a hierarchical decomposition of the white noise source function in $L^2$ which allows us to form Gaussian random field realizations across multiple levels of discretization in a way that fits into multilevel MCMC algorithmic frameworks. After presenting our main theoretical results and numerical scaling results to showcase the utility of this new hierarchical PDE method for generating Gaussian random field realizations, this method is tested on a four-level MCMC algorithm to explore its feasibility.

algebraic multigrid↗
DOE OSTI2023

Differentiable Earth mover’s distance for data compression at the high-luminosity LHC

Abstract The Earth mover’s distance (EMD) is a useful metric for image recognition and classification, but its usual implementations are not differentiable or too slow to be used as a loss function for training other algorithms via gradient descent. In this paper, we train a convolutional neural network (CNN) to learn a differentiable, fast approximation of the EMD and demonstrate that it can be used as a substitute for computing-intensive EMD implementations. We apply this differentiable approximation in the training of an autoencoder-inspired neural network (encoder NN) for data compression at the high-luminosity LHC at CERN The goal of this encoder NN is to compress the data while preserving the information related to the distribution of energy deposits in particle detectors. We demonstrate that the performance of our encoder NN trained using the differentiable EMD CNN surpasses that of training with loss functions based on mean squared error.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2022

A backward SDE method for uncertainty quantification in deep learning

Here, we develop a backward stochastic differential equation based probabilistic machine learning method, which formulates a class of stochastic neural networks as a stochastic optimal control problem. An efficient stochastic gradient descent algorithm is introduced with the gradient computed through a backward stochastic differential equation. Convergence analysis for stochastic gradient descent optimization and numerical experiments for applications of stochastic neural networks are carried out to validate our methodology in both theory and performance.

97 MATHEMATICS AND COMPUTING↗