Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Gradient information”

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 19 records

Gradient-Informed Design Optimization of Select Nuclear Systems

In this work, we present a gradient-informed design optimization of nuclear reactor core components based on neutronics objectives with both continuous and discrete materials. The main argument in favor of using gradient-informed design optimization is that it scales well with increasing dimensionality of the design space. First, a challenge problem with 121 free parameters is solved with a gradient-informed method and then with a genetic algorithm. Then, a challenge problem to optimize the flux profile of a simplified assembly with eight axial zones is solved. Both challenge problems are solved using directly calculated derivatives from Tools for Sensitivity and Uncertainty Analysis Methodology Implementation (TSUNAMI) in the SCALE package. Furthermore, we demonstrate how a discrete optimization problem—selection of materials for 121 voxels—can be lifted into a continuous problem with mixed materials. In the continuous space, adjoint-based gradients are well-defined, and gradient descent is applicable. Then, a forcing function is introduced that with the selection of an appropriately sized hyperparameter can be used to guide the optimized continuous solution back into a discrete solution. This paper presents an account of the challenges that were faced when applying a gradient-informed optimization algorithm using a Monte Carlo calculation to estimate the gradient information and compares a gradient descent optimization method to a genetic algorithm optimization of the same geometry. Overall, this work demonstrates the potential use of adjoint-based gradient calculations in design optimization of nuclear systems.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Gradient-informed Hamiltonian Monte Carlo for multicomponent CALPHAD model optimization and uncertainty quantification

CALPHAD model parameter optimization is inherently challenging due to non-smooth objective functions, high-dimensional parameter spaces, and the need for uncertainty quantification (UQ). Traditional weighted nonlinear least squares approaches are computationally efficient but local, whereas black-box global optimizers and ensemble Markov Chain Monte Carlo (MCMC) methods provide broader exploration at substantial computational cost. The objective of this work is to combine the global exploration capability of gradient-informed Hamiltonian Monte Carlo – specifically the No-U-Turn Sampler (NUTS) – with local deterministic refinement using BFGS to efficiently optimize multicomponent CALPHAD models with minimal manual intervention. Analytic gradients are computed via the Jansson derivative framework. The methodology is demonstrated on the Cr—Fe binary system and extended to the Cr—Fe—Ni ternary system with 32 degrees of freedom. For Cr—Fe, NUTS achieves comparable or superior optimality relative to ensemble MCMC while requiring over an order-of-magnitude fewer likelihood evaluations. Parameter uncertainties are quantified through NUTS sampling and propagated to thermodynamic observables using local expansion, demonstrating a novel modular approach that combines binary and ternary parameter subsets without requiring global relaxation. These results establish gradient-informed exploration as a scalable strategy for multicomponent CALPHAD optimization and provide a practical route towards efficient higher-order database development with quantified uncertainty.

36 MATERIALS SCIENCE↗

Nonlinear dimension reduction for surrogate modeling using gradient information

We introduce a method for the nonlinear dimension reduction of a high-dimensional function $u:{\mathbb{R}}^d\rightarrow{\mathbb{R}}$, $d\gg 1$. Our objective is to identify a nonlinear feature map $g:{\mathbb{R}}^d\rightarrow{\mathbb{R}}^m$, with a prescribed intermediate dimension $m\ll d$, so that $u$ can be well approximated by $f\circ g$ for some profile function $f:{\mathbb{R}}^m\rightarrow{\mathbb{R}}$. We propose to build the feature map by aligning the Jacobian $\nabla g$ with the gradient $\nabla u$, and we theoretically analyze the properties of the resulting $g$. Once $g$ is built, we construct $f$ by solving a gradient-enhanced least squares problem. Our practical algorithm uses a sample $\{{\textbf{x}}^{(i)},u({\textbf{x}}^{(i)}),\nabla u({\textbf{x}}^{(i)})\}_{i=1}^N$ and builds both $g$ and $f$ on adaptive downward-closed polynomial spaces, using cross validation to avoid overfitting. We numerically evaluate the performance of our algorithm across different benchmarks, and explore the impact of the intermediate dimension $m$. We show that building a nonlinear feature map $g$ can permit more accurate approximation of $u$ than a linear $g$, for the same input data set.

97 MATHEMATICS AND COMPUTING↗

Efficient gradient estimation using finite differencing and likelihood ratios for kinetic Monte Carlo simulations

While many optimization and control methods for stochastic processes require gradient information from the process of interest, obtaining gradient information from experiments is prohibitively expensive and time-consuming. As a result, such information is often obtained from stochastic process simulations. Computing gradients efficiently and accurately from stochastic simulations is challenging, especially for simulations involving computationally expensive models with significant inherent noise. In this work, we analyze and characterize the applicability of two gradient estimation methods for kinetic Monte Carlo simulations: finite differencing and likelihood ratio. We developed a systematic method for choosing an optimal perturbation size for finite differencing and discuss, for both methods, important implementation issues such as scaling with respect to the number of elements in the gradient vector. Through a series of numerical experiments, the methods were compared across different time and size regimes to characterize the precision and accuracy associated with each method. We determined that the likelihood ratio method is appropriate for estimating gradients at short (transient) times or for systems with small population sizes, whereas finite differencing is better-suited for gradient estimation at long times (steady state) or for systems with large population sizes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dynamic multiple thresholding breast boundary detection algorithm for mammograms

Purpose: Automated detection of breast boundary is one of the fundamental steps for computer-aided analysis of mammograms. In this study, the authors developed a new dynamic multiple thresholding based breast boundary (MTBB) detection method for digitized mammograms. Methods: A large data set of 716 screen-film mammograms (442 CC view and 274 MLO view) obtained from consecutive cases of an Institutional Review Board approved project were used. An experienced breast radiologist manually traced the breast boundary on each digitized image using a graphical interface to provide a reference standard. The initial breast boundary (MTBB-Initial) was obtained by dynamically adapting the threshold to the gray level range in local regions of the breast periphery. The initial breast boundary was then refined by using gradient information from horizontal and vertical Sobel filtering to obtain the final breast boundary (MTBB-Final). The accuracy of the breast boundary detection algorithm was evaluated by comparison with the reference standard using three performance metrics: The Hausdorff distance (HDist), the average minimum Euclidean distance (AMinDist), and the area overlap measure (AOM). Results: In comparison with the authors' previously developed gradient-based breast boundary (GBB) algorithm, it was found that 68%, 85%, and 94% of images had HDist errors less than 6 pixels (4.8 mm) for GBB, MTBB-Initial, and MTBB-Final, respectively. 89%, 90%, and 96% of images had AMinDist errors less than 1.5 pixels (1.2 mm) for GBB, MTBB-Initial, and MTBB-Final, respectively. 96%, 98%, and 99% of images had AOM values larger than 0.9 for GBB, MTBB-Initial, and MTBB-Final, respectively. The improvement by the MTBB-Final method was statistically significant for all the evaluation measures by the Wilcoxon signed rank test (p<0.0001). Conclusions: The MTBB approach that combined dynamic multiple thresholding and gradient information provided better performance than the breast boundary detection algorithm that mainly used gradient information.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

WE-AB-BRA-01: 3D-2D Image Registration for Target Localization in Spine Surgery: Comparison of Similarity Metrics Against Robustness to Content Mismatch

Purpose: In image-guided spine surgery, mapping 3D preoperative images to 2D intraoperative images via 3D-2D registration can provide valuable assistance in target localization. However, the presence of surgical instrumentation, hardware implants, and soft-tissue resection/displacement causes mismatches in image content, confounding existing registration methods. Manual/semi-automatic methods to mask such extraneous content is time consuming, user-dependent, error prone, and disruptive to clinical workflow. We developed and evaluated 2 novel similarity metrics within a robust registration framework to overcome such challenges in target localization. Methods: An IRB-approved retrospective study in 19 spine surgery patients included 19 preoperative 3D CT images and 50 intraoperative mobile radiographs in cervical, thoracic, and lumbar spine regions. A neuroradiologist provided truth definition of vertebral positions in CT and radiography. 3D-2D registration was performed using the CMA-ES optimizer with 4 gradient-based image similarity metrics: (1) gradient information (GI); (2) gradient correlation (GC); (3) a novel variant referred to as gradient orientation (GO); and (4) a second variant referred to as truncated gradient correlation (TGC). Registration accuracy was evaluated in terms of the projection distance error (PDE) of the vertebral levels. Results: Conventional similarity metrics were susceptible to gross registration error and failure modes associated with the presence of surgical instrumentation: for GI, the median PDE and interquartile range was 33.0±43.6 mm; similarly for GC, PDE = 23.0±92.6 mm respectively. The robust metrics GO and TGC, on the other hand, demonstrated major improvement in PDE (7.6 ±9.4 mm and 8.1± 18.1 mm, respectively) and elimination of gross failure modes. Conclusion: The proposed GO and TGC similarity measures improve registration accuracy and robustness to gross failure in the presence of strong image content mismatch. Such registration capability could offer valuable assistance in target localization without disruption of clinical workflow. G. Kleinszig and S. Vogt are employees of Siemens Healthcare.

60 APPLIED LIFE SCIENCES↗

MITgcm-AD v2: Open source tangent linear and adjoint modeling framework for the oceans and atmosphere enabled by the Automatic Differentiation tool Tapenade

The Massachusetts Institute of Technology General Circulation Model (MITgcm) is widely used by the climate science community to simulate planetary atmosphere and ocean circulations. A defining feature of the MITgcm is that it has been developed to be compatible with an algorithmic differentiation (AD) tool, TAF, enabling the generation of tangent-linear and adjoint models. These provide gradient information which enables dynamics-based sensitivity and attribution studies, state and parameter estimation, and rigorous uncertainty quantification. Importantly, gradient information is essential for computing comprehensive sensitivities and performing efficient large-scale data assimilation, ensuring that observations collected from satellites and in-situ measuring instruments can be effectively used to optimize a large uncertain control space. As a result, the MITgcm forms the dynamical core of a key data assimilation product employed by the physical oceanography research community: Estimating the Circulation and Climate of the Ocean (ECCO) state estimate. Although MITgcm and ECCO are used extensively within the research community, the AD tool TAF is proprietary and hence inaccessible to a large proportion of these users. The new version 2 (MITgcm-AD v2) framework introduced here is based on the source-to-source AD tool Tapenade, which has recently been open-sourced. Another feature of Tapenade is that it stores required variables by default (instead of recomputing them) which simplifies the implementation of efficient, AD-compatible code. The framework has been integrated with the MITgcm model’s main branch and is now freely available.

Adjoints↗

GIGA-Lens: Fast Bayesian Inference for Strong Gravitational Lens Modeling

We present GIGA-Lens: a gradient-informed, GPU-accelerated Bayesian framework for modeling strong gravitational lensing systems, implemented in TensorFlow and JAX. The three components, optimization using multistart gradient descent, posterior covariance estimation with variational inference, and sampling via Hamiltonian Monte Carlo, all take advantage of gradient information through automatic differentiation and massive parallelization on graphics processing units (GPUs). We test our pipeline on a large set of simulated systems and demonstrate in detail its high level of performance. The average time to model a single system on four Nvidia A100 GPUs is 105 s. The robustness, speed, and scalability offered by this framework make it possible to model the large number of strong lenses found in current surveys and present a very promising prospect for the modeling of ${ \mathcal O }({10}^{5})$ lensing systems expected to be discovered in the era of the Vera C. Rubin Observatory, Euclid, and the Nancy Grace Roman Space Telescope.

79 ASTRONOMY AND ASTROPHYSICS↗

Gaussian processes with built-in dimensionality reduction: Applications to high-dimensional uncertainty propagation

Uncertainty quantification (UQ) tasks, such as model calibration, uncertainty propagation, and optimization under uncertainty, typically require several thousand evaluations of the underlying computer codes. To cope with the cost of simulations, one replaces the real response surface with a cheap surrogate based, e.g., on polynomial chaos expansions, neural networks, support vector machines, or Gaussian processes (GP). However, the number of simulations required to learn a generic multivariate response grows exponentially as the input dimension increases. This curse of dimensionality can only be addressed, if the response exhibits some special structure that can be discovered and exploited. A wide range of physical responses exhibit a special structure known as an active subspace (AS). An AS is a linear manifold of the stochastic space characterized by maximal response variation. The idea is that one should first identify this low dimensional manifold, project the high-dimensional input onto it, and then link the projection to the output. If the dimensionality of the AS is low enough, then learning the link function is a much easier problem than the original problem of learning a high-dimensional function. The classic approach to discovering the AS requires gradient information, a fact that severely limits its applicability. Furthermore, and partly because of its reliance to gradients, it is not able to handle noisy observations. The latter is an essential trait if one wants to be able to propagate uncertainty through stochastic simulators, e.g., through molecular dynamics codes. In this work, we develop a probabilistic version of AS which is gradient-free and robust to observational noise. Our approach relies on a novel Gaussian process regression with built-in dimensionality reduction. In particular, the AS is represented as an orthogonal projection matrix that serves as yet another covariance function hyper-parameter to be estimated from the data. To train the model, we design a two-step maximum likelihood optimization procedure that ensures the orthogonality of the projection matrix by exploiting recent results on the Stiefel manifold, i.e., the manifold of matrices with orthogonal columns. The additional benefit of our probabilistic formulation, is that it allows us to select the dimensionality of the AS via the Bayesian information criterion. We validate our approach by showing that it can discover the right AS in synthetic examples without gradient information using both noiseless and noisy observations. We demonstrate that our method is able to discover the same AS as the classical approach in a challenging one-hundred-dimensional problem involving an elliptic stochastic partial differential equation with random conductivity. Finally, we use our approach to study the effect of geometric and material uncertainties in the propagation of solitary waves in a one dimensional granular system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Exploring Gradient-Based Multi-directional Controls in GANs

Generative Adversarial Networks (GANs) have been widely applied in modeling diverse image distributions. However, despite its impressive applications, the structure of the latent space in GANs largely remains as a black-box, leaving its controllable generation an open problem, especially when spurious correlations between different semantic attributes exist in the image distributions. To address this problem, previous methods typically learn linear directions or individual channels that control semantic attributes in the image space. However, they often suffer from imperfect disentanglement, or are unable to obtain multi-directional controls. Furthermore, in this work, in light of the above challenges, we propose a novel approach that discovers nonlinear controls, which enables multi-directional manipulation as well as effective disentanglement, based on gradient information in the learned GAN latent space. More specifically, we first learn interpolation directions by following the gradients from classification networks trained separately on the attributes, and then navigate the latent space by exclusively controlling channels activated for the target attribute in the learned directions. Empirically, with small training data, our approach is able to gain fine-grained controls over a diverse set of bi-directional and multi-directional attributes, and we showcase its ability to achieve disentanglement significantly better than state-of-the-art methods both qualitatively and quantitatively.

97 MATHEMATICS AND COMPUTING↗

Design of an additively manufactured functionally graded material of 316 stainless steel and Ti-6Al-4V with Ni-20Cr, Cr, and V intermediate compositions

This study presents a method for designing a computationally informed gradient pathway to fabricate a functionally graded material (FGM) with terminal alloys of 316 stainless steel (SS316) and Ti-6Al-4V via directed energy deposition additive manufacturing with powder feedstock. In this work, the grading is accomplished through the introduction of intermediate elements and alloys (Ni-20Cr, Cr, and V) to avoid the brittle Fe-Ti intermetallic phases that form in the direct liquid phase joining of Ti-alloys and stainless steels. Using a combination of equilibrium calculations and Scheil-Gulliver simulations, a compositional pathway was designed to avoid deleterious phases. FGM samples were fabricated and experimentally characterized to determine the viability of the pathway. A change in phases from fcc to bcc was predicted to occur within the Ni-20Cr/Cr gradient region, and this was validated through experimental characterization. No detrimental phases (intermetallic, Laves, or σ phases) formed along the gradient path, demonstrating a successful computationally-informed design and fabrication of an FGM from SS316 to Ti-6Al-4V.

36 MATERIALS SCIENCE↗

Semiautomatic registration of 3D transabdominal ultrasound images for patient repositioning during postprostatectomy radiotherapy

Purpose: The aim of the present work is to propose and evaluate registration algorithms of three-dimensional (3D) transabdominal (TA) ultrasound (US) images to setup postprostatectomy patients during radiation therapy. Methods: Three registration methods have been developed and evaluated to register a reference 3D-TA-US image acquired during the planning CT session and a 3D-TA-US image acquired before each treatment session. The first method (method A) uses only gray value information, whereas the second one (method B) uses only gradient information. The third one (method C) combines both sets of information. All methods restrict the comparison to a region of interest computed from the dilated reference positioning volume drawn on the reference image and use mutual information as a similarity measure. The considered geometric transformations are translations and have been optimized by using the adaptive stochastic gradient descent algorithm. Validation has been carried out using manual registration by three operators of the same set of image pairs as the algorithms. Sixty-two treatment US images of seven patients irradiated after a prostatectomy have been registered to their corresponding reference US image. The reference registration has been defined as the average of the manual registration values. Registration error has been calculated by subtracting the reference registration from the algorithm result. For each session, the method has been considered a failure if the registration error was above both the interoperator variability of the session and a global threshold of 3.0 mm. Results: All proposed registration algorithms have no systematic bias. Method B leads to the best results with mean errors of −0.6, 0.7, and −0.2 mm in left–right (LR), superior–inferior (SI), and anterior–posterior (AP) directions, respectively. With this method, the standard deviations of the mean error are of 1.7, 2.4, and 2.6 mm in LR, SI, and AP directions, respectively. The latter are inferior to the interoperator registration variabilities which are of 2.5, 2.5, and 3.5 mm in LR, SI, and AP directions, respectively. Failures occur in 5%, 18%, and 10% of cases in LR, SI, and AP directions, respectively. 69% of the sessions have no failure. Conclusions: Results of the best proposed registration algorithm of 3D-TA-US images for postprostatectomy treatment have no bias and are in the same variability range as manual registration. As the algorithm requires a short computation time, it could be used in clinical practice provided that a visual review is performed.

60 APPLIED LIFE SCIENCES↗

Classical-Quantum Algorithm for Solving Stochastic Programs

Stochastic programming provides a rigorous mathematical framework for making decisions under uncertainty in a risk-aware manner. Two-stage stochastic programming is, perhaps, the simplest form of this framework. Here the first-stage variables represent decisions that must be made "here and now" in the face of uncertainty, while the second-stage variables are decisions made after uncertain events. However, the broad adoption of stochastic programming has been hindered by computational challenges caused by the two-stage stochastic programming formulation which requires solving an ensemble of optimization problems. Using quantum amplitude estimation (QAE), quantum computers have shown the theoretic ability to compute expectations with Monte-Carlo methods with quadratically fewer samples than classical methods. In this work, we present a quantum algorithm for computing the expectation term using QAE for given first-stage decisions. Further, we detail methods of computing gradient information from the quantum calculation enabling the application of classical gradient-based optimization techniques. The result is a classical-quantum hybrid method of solving two-stage stochastic programs. These techniques are demonstrated with computational experiments based an engineering optimization problem.

97 MATHEMATICS AND COMPUTING↗

Derivative-free stochastic optimization via adaptive sampling strategies

In this paper, we present a novel derivative-free framework for solving unconstrained stochastic optimization problems. Many problems in fields ranging from simulation optimization to reinforcement learning to quantum computing involve settings where only stochastic function values are obtained via a zeroth-order oracle, which has no available gradient information and necessitates the usage of derivative-free optimization methodologies. Our approach includes estimating gradients using stochastic function evaluations and integrating adaptive sampling techniques to control the accuracy in these stochastic approximations. Our framework encapsulates several gradient estimation techniques, including standard finite-difference, Gaussian smoothing, sphere smoothing, randomized coordinate finite-difference, and randomized subspace finite-difference methods. We provide theoretical convergence guarantees for our framework and analyze the worst-case iteration and sample complexities associated with each gradient estimation method. Finally, we demonstrate the empirical performance of the methods on logistic regression and nonlinear least squares problems.

Adaptive sampling↗

Estimate of Geothermal Energy Resource in Major U.S. Sedimentary Basins (Presentation)

This study estimates the magnitude of geothermal energy from fifteen major known US sedimentary basins and ranks these basins relative to their potential. Because most sedimentary basins have been explored for oil and gas, well logs, temperatures at depth, and reservoir properties are known. This reduces exploration risk and allows development of geologic exploration models for each basin as wellas a relative assessment of geologic risk elements for each play. The total available thermal resource for each basin was estimated using the volumetric heat-in-place method originally proposed by Muffler (USGS). Total sedimentary thickness maps, stratigraphic columns, cross sections, and temperature gradient Information were gathered for each basin from published articles, USGS reports, andstate geological survey reports. When published data was insufficient, thermal gradients and reservoir properties were derived from oil and gas well logs obtained on oil and gas commission websites. Basin stratigraphy, structural history, and groundwater circulation patterns were studied in order to develop a model that estimates resource size and temperature distribution, and to qualitativelyassess reservoir productivity.

15 GEOTHERMAL ENERGY↗

Single-contact tunneling thermometry

A single-contact tunneling thermometry circuit includes a tunnel junction formed between two objects. Junction temperature gradient information is determined based on a mathematical relationship between a target alternating voltage applied across the junction and the junction temperature gradient. Total voltage measured across the junction indicates the magnitude of the target alternating voltage. A thermal gradient is induced across the junction. A reference thermovoltage is measured when zero alternating voltage is applied across the junction. An increasing alternating voltage is applied while measuring a thermovoltage component and a DC rectification voltage component created by the applied alternating voltage. The target alternating voltage is reached when the thermovoltage is nullified or doubled by the DC rectification voltage depending on the sign of the reference thermovoltage. Thermoelectric current and current measurements may be utilized in place of the thermovoltage and voltage measurements. The system may be automated with a feedback loop.

42 ENGINEERING↗

A non-intrusive parallel-in-time adjoint solver with the XBraid library

In this paper, an adjoint solver for the multigrid-in-time software library XBraid is presented. XBraid provides a non-intrusive approach for simulating unsteady dynamics on multiple processors while parallelizing not only in space but also in the time domain (XBraid: Parallel multigrid in time, http://llnl.gov/casc/xbraid). It applies an iterative multigrid reduction in time algorithm to existing spatially parallel classical time propagators and computes the unsteady solution parallel in time. Techniques from Automatic Differentiation are used to develop a consistent discrete adjoint solver which provides sensitivity information of output quantities with respect to design parameter changes. The adjoint code runs backwards through the primal XBraid actions and accumulates gradient information parallel in time. It is highly non-intrusive as existing adjoint time propagators can easily be integrated through the adjoint interface. The adjoint code is validated on advection-dominated flow with periodic upstream boundary condition. We report it provides similar strong scaling results as the primal XBraid solver and offers great potential for speeding up the overall computational costs for sensitivity analysis using multiple processors.

97 MATHEMATICS AND COMPUTING↗