Search NASA⌕ Search

SEARCH · Search NASA

Results for “gradient methods”

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 379 records · Page 21

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↗

Poblano v1.0 : a Matlab toolbox for gradient-based optimization.

We present Poblano v1.0, a Matlab toolbox for solving gradient-based unconstrained optimization problems. Poblano implements three optimization methods (nonlinear conjugate gradients, limited-memory BFGS, and truncated Newton) that require only first order derivative information. In this paper, we describe the Poblano methods, provide numerous examples on how to use Poblano, and present results of Poblano used in solving problems from a standard test collection of unconstrained optimization problems.

99 GENERAL AND MISCELLANEOUS↗

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↗

Programmable Chemical Gradient Patterns by Soft Grayscale Lithography

A method for fabricating chemical gradients on planar and nonplanar substrates using grayscale lithography is reported. Compliant grayscale amplitude masks are fabricated using a vacuum-assisted microfluidic filling protocol that employs dilutions of a carbon-black-containing polydimethylsiloxane emulsion (bPDMS) within traditional clear PDMS (cPDMS) to create planar, fully self-supporting mask elements. The mask is then placed over a surface functionalized with a hydrophobic coumarin-based photocleavable monolayer, which exposes a polar group upon irradiation. The mask serves to modulate the intensity of incident UV light, thereby controlling the density of molecules cleaved. The resulting molecular-level grayscale patterns are characterized by condensation microscopy and imaging mode time-of-flight secondary-ion mass spectrometry (ToF-SIMS). Due to the inherent flexibility of this technique, the photofuse as well as the gradient patterns can be designed for a wide range of applications; in this paper two proof-of-concept demonstrations are shown. The first utilizes the ability to control the resulting contact angle of the surface for the fabrication of a passive pressure-sensitive microfluidic gating system. The second is a model surface modification process that utilizes the functional groups deprotected during the photocleavage to pattern the deposition of moieties with complementary chemistry. The spatial layout, resolution, and concentration of these covalently linked molecules follow the gradient pattern created by the grayscale mask during exposure. Furthermore, the programmable chemical gradient fabrication scheme presented in this work allows explicit engineering of both surface properties that dictate nonspecific interactions (surface energy, charge, etc.) and functional chemistry necessary for covalent bonding.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Multithreaded parallelization of the energy and analytic gradient in the fragment molecular orbital method

The fragment molecular orbital method in GAMESS is parallelized in a multithreaded OpenMP implementation combined with the MPI version of the two-level generalized distributed data interface. The energy and analytic gradient in gas phase and the polarizable continuum model of solvation are parallelized in this hybrid three-level scheme, achieving a large memory footprint reduction and a high parallel efficiency on Intel Xeon Phi processors. The parallel efficiency is demonstrated on the Stampede2 and Theta supercomputers using up to 2048 nodes (262 144 threads).

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Land surface model parameter optimisation using in situ flux data: comparison of gradient-based versus random search algorithms (a case study using ORCHIDEE v1.9.5.2)

Land surface models (LSMs), which form the land component of earth system models, rely on numerous processes for describing carbon, water and energy budgets, often associated with highly uncertain parameters. Data assimilation (DA) is a useful approach for optimising the most critical parameters in order to improve model accuracy and refine future climate predictions. In this study, we compare two different DA methods for optimising the parameters of seven plant functional types (PFTs) of the ORCHIDEE LSM using daily averaged eddy-covariance observations of net ecosystem exchange and latent heat flux at 78 sites across the globe. We perform a technical investigation of two classes of minimisation methods – local gradient-based (the L-BFGS-B algorithm, limited memory Broyden–Fletcher–Goldfarb–Shanno algorithm with bound constraints) and global random search (the genetic algorithm) – by evaluating their relative performance in terms of the model–data fit and the difference in retrieved parameter values. We examine the performance of each method for two cases: when optimising parameters at each site independently (“single-site” approach) and when simultaneously optimising the model at all sites for a given PFT using a common set of parameters (“multi-site” approach). We find that for the single site case the random search algorithm results in lower values of the cost function (i.e. lower model–data root mean square differences) than the gradient-based method; the difference between the two methods is smaller for the multi-site optimisation due to a smoothing of the cost function shape with a greater number of observations. The spread of the cost function, when performing the same tests with 16 random first-guess parameters, is much larger with the gradient-based method, due to the higher likelihood of being trapped in local minima. When using pseudo-observation tests, the genetic algorithm results in a closer approximation of the true posterior parameter value in the L-BFGS-B algorithm. We demonstrate the advantages and challenges of different DA techniques and provide some advice on using it for the LSM parameter optimisation.

58 GEOSCIENCES↗

Friction stir gradient alloying: A high-throughput method to explore the influence of V in enabling HCP to BCC transformation in a γ-FCC dominated high entropy alloy

The compositional possibilities in high entropy alloys (HEAs) is very vast and effective strategies are needed to establish potential alloy chemistries. In this study, friction stir gradient alloying (FSGA), a recently-introduced high-throughput (HT) technique incorporating compositional and microstructural gradients, was used to explore the possibility of introducing a bcc transformation domain in γ-fcc dominated TRIP HEA Fe 38.5 Mn 20 Cr 15 Co 20 Si 5 Cu 1.5 (at.%) by vanadium addition. FSGA has accelerated the process of attaining the composition-microstructure library and the results suggest that vanadium addition of ~1 at.% results in nucleation of α-bcc. Additionally, this is the first observation of ε-hcp to α-bcc transformation in a TRIP HEA and supports the Olson-Cohen model of martensitic transformation (γ-fcc → ε-hcp → α-bcc). ε-hcp is nucleated with a pyramidal orientation by the formation of planar faults on the {111} close-packed planes of γ-fcc, and α-bcc is nucleated in the vicinity of ε-hcp along the {111} γ-fcc trace. There are indications for the formation of basal orientated ε-hcp from intersecting ε-hcp planes orientated for the pyramidal slip. Thus, the study shows the nucleation and growth of the α-bcc phase attributed to the dual effects of chemistry and strain and potential co-existence of all the three phases.

36 MATERIALS SCIENCE↗

Accurate gradient approximation for complex interface problems in 3D by an improved coupling interface method

Most elliptic interface solvers become complicated for complex interface problems at those “exceptional points” where there are not enough neighboring interior points for high order interpolation. Such complication increases especially in three dimensions. Usually, the solvers are thus reduced to low order accuracy. In this paper, we classify these exceptional points and propose two recipes to maintain order of accuracy there, aiming at improving the previous coupling interface method [26]. Yet the idea is also applicable to other interface solvers. The main idea is to have at least first order approximations for second order derivatives at those exceptional points. Recipe 1 is to use the finite difference approximation for the second order derivatives at a nearby interior grid point, whenever this is possible. Recipe 2 is to flip domain signatures and introduce a ghost state so that a second-order method can be applied. This ghost state is a smooth extension of the solution at the exceptional point from the other side of the interface. The original state is recovered by a post-processing using nearby states and jump conditions. The choice of recipes is determined by a classification scheme of the exceptional points. The method renders the solution and its gradient uniformly second-order accurate in the entire computed domain. Numerical examples are provided to illustrate the second order accuracy of the presently proposed method in approximating the gradients of the original states for some complex interfaces which we had tested previous in two and three dimensions, and a real molecule ( (1D63)) which is double-helix shape and composed of hundreds of atoms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Compositionally gradient nickel-rich cathode materials and methods for the manufacture thereof

The present invention relates to lithium rechargeable battery cathode materials. More specifically, the cathode materials are compositionally gradient nickel-rich cathode materials produced using single-source composite precursor materials containing inorganic and/or metalorganic salts of lithium, nickel, manganese, and cobalt. Methods and systems for manufacturing the cathode materials by a combined spray pyrolysis/fluidized bed process are also disclosed.

Kodenkandath, Thomas A.↗

SU-E-T-780: Use Robustness Optimization (RO) Method to Improve the Planning Efficiency for Pencil Beam Scanning Cranial Spinal Irradiation

Purpose: We evaluate the feasibility of using robustness optimization (RO) function to improve the planning efficiency of pencil beam scanning (PBS) craniospinal irradiation (CSI) with gradient matching technique. Methods: A CSI patient was planned with 2 lateral brain fields and 4 posterior fields to cover the entire spine to maximal field of 24 cm × 20 cm on a compact PBS gantry, ProteusONE. CSI plans were generated using traditional volumetric gradient dose optimization (VGDO) and robustness optimization (RO) method respectively. In traditional VGDO, besides the sectioned spine target volumes, gradient volume (GV) were generated as 4 equally spaced structures e.g. 80%, 60%, 40%, and 20% of prescription dose. In RO method, only sectioned spine target volumes with an overlap of 4cm were created. In the robustness optimization settings, 5mm uncertainty in superior and inferior direction was defined for auto gradient optimization. Dosimetric metrics of conformity number (CN), homogeneity index (HI), and maximal cord doses were compared in Raystation version 4.6.100.6. Results: In VGDO method, total 16 GV structures and five 100% dose level target structures were contoured compared to total 5 target structures in RO method which saves 30 min in contour. With the same PTV coverage (95% volume receive 30.6Gy prescription dose), maximum cord dose is 32.64Gy in VGDO and 31.94Gy in RO. HI is 1.03 and 1.04 for VGDO and RO respectively. CN is 0.93 and 0.94 for VGDO and RO respectively. Conclusions: The dosimetric comparison demonstrated both methods are equivalent in terms of plan quality. With robust optimization for CSI gradient matching, it efficiently reduces the amount of planning target contour structure by factor of 4 and thus improves the planning efficiency especially for 4 or more gradient junction area.

60 APPLIED LIFE SCIENCES↗

Multi-variance replica exchange SGMCMC for inverse and forward problems via Bayesian PINN

Physics-informed neural network (PINN) has been successfully applied in solving a variety of nonlinear non-convex forward and inverse problems. However, the training is challenging because of the non-convex loss functions and the multiple optima in the Bayesian inverse problem. In this work, we propose a multi-variance replica exchange stochastic gradient Langevin dynamics method to tackle the challenge of the multiple local optima in the optimization and the challenge of the multiple modal posterior distribution in the inverse problem. Replica exchange methods are capable of escaping from the local traps and accelerating the convergence; two chains with different temperatures are designed where the low temperature chain aims for the local convergence, and the target of the high temperature chain is to travel globally and explore the whole loss function entropy landscape. However, it may not be efficient to solve mathematical inversion problems by using the vanilla replica method directly since the method doubles the computational cost in evaluating the forward solvers (likelihood functions) in the two chains. To address this issue, we propose to make different assumptions on the energy function estimation and this facilities one to use solvers of different fidelities in the likelihood function evaluation. More precisely, one can use a solver with low fidelity in the high temperature chain while using a solver with high fidelity in the low temperature chain. Our proposed method significantly lowers the computational cost in the high temperature chain, meanwhile preserving the accuracy and converging very fast. Here we give an unbiased estimate of the swapping rate and give an estimation of the discretization error of the scheme. To verify our idea, we design and solve four inverse problems which have multiple modes. The proposed method is also employed to train the Bayesian PINN to solve the forward and inverse problems; faster and more accurate convergence has been observed when compared to the stochastic gradient Langevin dynamics (SGLD) method and vanilla replica exchange methods.

97 MATHEMATICS AND COMPUTING↗

Application of the Differential Evolution Method to Solving Inverse Transport Problems

The differential evolution method, a powerful stochastic optimization algorithm that mimics the process of evolution in nature, is applied to inverse transport problems with several unknown parameters of mixed types, including interface location identification, source composition identification, and material mass density identification, in spherical and cylindrical radioactive source/shield systems. In spherical systems, measurements of leakages of discrete gamma-ray lines are assumed, while in cylindrical systems, measurements of scalar fluxes of discrete lines at points outside the system are assumed. The performance of the differential evolution algorithm is compared to the Levenberg-Marquardt method, a standard gradient-based technique, and the covariance matrix adaptation evolution strategy, another stochastic technique, on a variety of numerical test problems with several (i.e., three or more) unknown parameters. Numerical results indicate that differential evolution is the most adept method for finding the global optimum for these problems. In spherical geometry, differential evolution implemented serially is run-time competitive with gradient-based methods, while a parallel version of differential evolution would be run-time competitive with gradient-based techniques in cylindrical geometry. A hybrid differential evolution/Levenberg-Marquardt method is also introduced, and numerical results indicate that it can be a fast and robust optimizer for inverse transport problems.

99 GENERAL AND MISCELLANEOUS↗

Laplacian Smoothing Stochastic Gradient Markov Chain Monte Carlo

As an important Markov chain Monte Carlo (MCMC) method, the stochastic gradient Langevin dynamics (SGLD) algorithm has achieved great success in Bayesian learning and posterior sampling. Furthermore, SGLD typically suffers from a slow convergence rate due to its large variance caused by the stochastic gradient. In order to alleviate these drawbacks, we leverage the recently developed Laplacian smoothing technique and propose a Laplacian smoothing stochastic gradient Langevin dynamics (LS-SGLD) algorithm. We prove that for sampling from both log-concave and non-log-concave densities, LS-SGLD achieves strictly smaller discretization error in 2-Wasserstein distance, although its mixing rate can be slightly slower. Experiments on both synthetic and real datasets verify our theoretical results and demonstrate the superior performance of LS-SGLD on different machine learning tasks including posterior sampling, Bayesian logistic regression, and training Bayesian convolutional neural networks.

97 MATHEMATICS AND COMPUTING↗

A learned closure method applied to phase mixing in a turbulent gradient-driven gyrokinetic system in simple geometry

We present a new method for formulating closures that learn from kinetic simulation data. We apply this method to phase mixing in a simple gyrokinetic turbulent system – temperature-gradient-driven turbulence in an unsheared slab. The closure, called the learned multi-mode (LMM) closure, is constructed by, first, extracting an optimal basis from a nonlinear kinetic simulation using singular value decomposition. Subsequent nonlinear fluid simulations are projected onto this basis and the results are used to formulate the closure. We compare the closure with other closures schemes over a broad range of the relevant two-dimensional parameter space (collisionality and gradient drive). We find that the turbulent kinetic system produces phase-mixing rates much lower than the linear expectations, which the LMM closure is capable of capturing. We also compare radial heat fluxes. A Hammett–Perkins closure, generalized to include collisional effects, is quite successful throughout the parameter space, producing ${\sim }14\,\%$ root-mean-square (r.m.s.) error. The LMM closure is also very effective: when trained at three (two) points (in a 35 point parameter grid), the LMM closure produces $8\,\%$ ( $12\,\%$ ) r.m.s. errors. The LMM procedure can be readily generalized to other closure problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A deterministic gradient-based approach to avoid saddle points

Abstract Loss functions with a large number of saddle points are one of the major obstacles for training modern machine learning (ML) models efficiently. First-order methods such as gradient descent (GD) are usually the methods of choice for training ML models. However, these methods converge to saddle points for certain choices of initial guesses. In this paper, we propose a modification of the recently proposed Laplacian smoothing gradient descent (LSGD) [Osher et al., arXiv:1806.06317 ], called modified LSGD (mLSGD), and demonstrate its potential to avoid saddle points without sacrificing the convergence rate. Our analysis is based on the attraction region, formed by all starting points for which the considered numerical scheme converges to a saddle point. We investigate the attraction region’s dimension both analytically and numerically. For a canonical class of quadratic functions, we show that the dimension of the attraction region for mLSGD is $\lfloor (n-1)/2\rfloor$ , and hence it is significantly smaller than that of GD whose dimension is $n-1$ .

Mathematics↗

Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization

Here, we consider unconstrained stochastic optimization problems with no available gradient information. Such problems arise in settings from derivative-free simulation optimization to reinforcement learning. We propose an adaptive sampling quasi-Newton method where we estimate the gradients using finite differences of stochastic function evaluations within a common random number framework. We develop modified versions of a norm test and an inner product quasi-Newton test to control the sample sizes used in the stochastic approximations and provide global convergence results to the neighborhood of a locally optimal solution. We present numerical experiments on simulation optimization problems to illustrate the performance of the proposed algorithm. When compared with classical zeroth-order stochastic gradient methods, we observe that our strategies of adapting the sample sizes significantly improve performance in terms of the number of stochastic function evaluations required.

97 MATHEMATICS AND COMPUTING↗

Demonstrating the Temperature Gradient Impact on Grain Growth in UO2 Using the Phase Field Method

Grain boundaries (GBs) are driven to migrate up a temperature gradient. In this work, we use a phase field (PF) model to investigate the impact of temperature gradients on normal grain growth. GB motion in 2D UO2 polycrystals is predicted under increasing temperature gradients. We find that the temperature gradient does not significantly impact the average grain growth behavior, because the curvature driving force is dominant. However, it does cause significant local migration of the individual grains. In addition, the change in the GB mobility due to the temperature gradient results in larger grains in the hot portion of the polycrystal.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗