Search NASA⌕ Search

SEARCH · Search NASA

Results for “Gradient method”

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 55 records · Page 3

Subspace Methods in Multi-Parameter Seismic Full Waveform Inversion

In full waveform inversion (FWI) high-resolution subsurface model parameters are sought. FWI is normally treated as a nonlinear least-squares inverse problem, in which the minimum of the corresponding misfit function is found by updating the model parameters. When multiple elastic or acoustic properties are solved for, simple gradient methods tend to confuse parameter classes. This is referred to as parameter cross-talk; it leads to incorrect model solutions, poor convergence and strong dependence on the scaling of the different parameter types. Determining step lengths in a subspace domain, rather than directly in terms of gradients of different parameters, is a potentially valuable approach to address this problem. The particular subspace used can be defined over a span of different sets of data or different parameter classes, provided it involves a small number of vectors compared to those contained in the whole model space. Additionally, in a subspace method, the basis vectors are defined first, and a local minimum is found in the space spanned by these. We examine the application of the subspace method within acoustic FWI in determining simultaneously updates for velocity and density. We first discuss the choice of basis vectors to construct the spanned space, from linear updates by distinguishing only the contributions of different parameter classes towards nonlinear updates by adding the contributions of higher-order perturbations of each parameter class. The numerical character of FWI solutions generated via subspace methods involving different basis vectors is then analyzed and compared with traditional FWI methods. The subspace methods can provide better reconstructions of the model, especially for the velocity, as well as improved convergence rates, while the computational costs are still comparable with the traditional FWI methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Inference of main ion particle transport coefficients with experimentally constrained neutral ionization during edge localized mode recovery on DIII-D

Abstract The plasma and neutral density dynamics after an edge localized mode are investigated and utilized to infer the plasma transport coefficients for the density pedestal. The Lyman-Alpha Measurement Apparatus (LLAMA) diagnostic provides sub-millisecond profile measurements of the ionization and neutral density and shows significant poloidal asymmetries in both. Exploiting the absolute calibration of the LLAMA diagnostic allows quantitative comparison to the electron and main ion density profiles determined by charge-exchange recombination, Thomson scattering and interferometry. Separation of diffusion and convection contributions to the density pedestal transport are investigated through flux gradient methods and time-dependent forward modeling with Bayesian inference by adaptation of the Aurora transport code and IMPRAD framework to main ion particle transport. Both methods suggest time-dependent transport coefficients and are consistent with an inward particle pinch on the order of 1 m s −1 and diffusion coefficient of 0.05 m 2 s −1 in the steep density gradient region of the pedestal. While it is possible to recreate the experimentally observed phenomena with no pinch in the pedestal, low diffusion in the core and high outward convection in the near scrape-off layer are required without an inward pedestal pinch.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Extending XACC for Quantum Optimal Control

Quantum computing vendors are beginning to open up application programming interfaces for direct pulse-level quantum control. With this, programmers can begin to describe quantum kernels of execution via sequences of arbitrary pulse shapes. This opens new avenues of research and development with regards to smart quantum compilation routines that enable direct translation of higher-level digital assembly representations to these native pulse instructions. In this work, we present an extension to the XACC system-level quantum-classical software framework that directly enables this compilation lowering phase via user-specified quantum optimal control techniques. This extension enables the translation of digital quantum circuit representations to equivalent pulse sequences that are optimal with respect to the backend system dynamics. Our work is modular and extensible, enabling third party optimal control techniques and strategies in both C++ and Python. We demonstrate this extension with familiar gradient-based methods like gradient ascent pulse engineering (GRAPE), gradient optimization of analytic controls (GOAT), and Krotov's method. Our work serves as a foundational component of future quantum-classical compiler designs that lower high-level programmatic representations to low-level machine instructions.

Nguyen, Thien↗

Improved Guarantees for Optimal Nash Equilibrium Seeking and Bilevel Variational Inequalities

We consider a class of hierarchical variational inequality (VI) problems that subsumes VI-constrained optimization and several other problem classes, including the optimal solution selection problem and the optimal Nash equilibrium (NE) seeking problem. Our main contribution is threefold. (i) We consider bilevel VIs with monotone and Lipschitz continuous mappings and devise a single-timescale iteratively regularized extragradient method, named IR-EG 𝚖,𝚖 . We improve the existing iteration complexity results for addressing both bilevel VI and VI-constrained convex optimization problems. (ii) Under the strong monotonicity of the outer-level mapping, we develop a method named IR-EG 𝚜,𝚖 and derive faster guarantees than those in (i). We also study the iteration complexity of this method under a constant regularization parameter. These results appear to be new for both bilevel VIs and VI-constrained optimization. (iii) To our knowledge, complexity guarantees for computing the optimal NE in nonconvex settings do not exist. Motivated by this lacuna, we consider VI-constrained nonconvex optimization problems and devise an inexactly projected gradient method, named IPR-EG, where the projection onto the unknown set of equilibria is performed using IR-EG 𝚜,𝚖 with a prescribed termination criterion and an adaptive regularization parameter. We obtain new complexity guarantees in terms of a residual map and an infeasibility metric for computing a stationary point. Here, we validate the theoretical findings using preliminary numerical experiments for computing the best and the worst NEs.

bilevel optimization↗

Adaptive Activation Functions Accelerate Convergence in Deep and Physics-informed Neural Networks

We employ adaptive activation functions for regression in deep and physics-informed neural networks (PINNs) to approximate smooth and discontinuous functions as well as solutions of linear and nonlinear partial differential equations. In particular, we solve the nonlinear Klein-Gordon equation, which has smooth solutions, the nonlinear Burgers equation, which can admit high gradient solutions, and the Helmholtz equation. We introduce a scalable hyper-parameter in the activation function, which can be optimized to achieve best performance of the network as it changes dynamically the topology of the loss function involved in the optimization process. The adaptive activation function has better learning capabilities than the traditional one (fixed activation) as it improves greatly the convergence rate, especially at early training, as well as the solution accuracy. To better understand the learning process, we plot the neural network solution in the frequency domain to examine how the network captures successively different frequency bands present in the solution. We consider both forward problems, where the approximate solutions are obtained, as well as inverse problems, where parameters involved in the governing equation are identified. Our simulation results show that the proposed method is a very simple and effective approach to increase the efficiency, robustness and accuracy of the neural network approximation of nonlinear functions as well as solutions of partial differential equations, especially for forward problems. We theoretically prove that in the proposed method, gradient descent algorithms are not attracted to suboptimal critical points or local minima.

machine leaning, Bad minima, Inverse problems, Phy↗

Identification and Quantification of Beta-Emitters in Waste Packages by Segmented Gamma-Scanning - 20114

A commonly applied method for the non-destructive characterization of the radioactive inventory of waste packages (e.g. 200-l drums) is segmented gamma-scanning. The gamma-emitting inventory is identified via their characteristic lines in the measured spectra. The corresponding net peak areas allow for quantification applying appropriate models. The identification and quantification of beta-emitters present in the waste package require further evaluation. While some of them emit gamma-rays, too, which can be used for identification and quantification, pure beta-emitters contribute to the gamma-spectra only by their Bremsstrahlung-spectra. {sup 32}P, {sup 90}Sr and {sup 90}Y are typical representatives of these isotopes. A method is developed for identification and quantification of these pure beta-emitters in radioactive waste packages. Origin of the procedure is the evaluation of the measured gamma-spectrum. After the identification of all lines present in the spectrum (characteristic gamma-lines, single- and double-escape-lines, X-ray-lines, annihilation peak etc.) this information is used together with calibration data of the detection system and further a-priori information like matrix composition, cross-section data from databases etc. to simulate the spectra without the Bremsstrahlung-components by an appropriate method. This may be Monte Carlo simulations or, like in our case, a computer code taking into account mathematical descriptions of the physical effects like photo effect, (multiple) Compton scattering, backscattering etc. and the attenuation effects of the waste matrix. In any case, the resulting spectrum must simulate the real spectrum without its Bremsstrahlung-component as good as possible. Subtracting the simulated from the measured spectrum then results in the Bremsstrahlung-components caused by the beta-emitters. Prior to evaluation, a set of Bremsstrahlung-spectra is calculated and stored for different beta-emitters in different matrices using the Bethe-Heitler equation. This data set can be extended for new conditions, if necessary, and is allocated in a data base for future application. Applying a non-linear optimization using the generalized reduced gradient method for comparing the calculated with the derived Bremsstrahlung-spectra results in the identification of the beta-emitter and a factor, which is proportional to its activity. The proportionality is determined by previous calibration measurements. The application of the method is demonstrated by measurements on a 200-l mock-up drum and a real waste package. (authors)

07 ISOTOPE AND RADIATION SOURCES↗

Inverse point source location with the Helmholtz equation on a bounded domain

The problem of recovering acoustic sources, more specifically monopoles, from point-wise measurements of the corresponding acoustic pressure at a limited number of frequencies is addressed. To this purpose, a family of sparse optimization problems in measure space in combination with the Helmholtz equation on a bounded domain is considered in this study. A weighted norm with unbounded weight near the observation points is incorporated into the formulation. Optimality conditions and conditions for recovery in the small noise case are discussed, which motivates concrete choices of the weight. The numerical realization is based on an accelerated conditional gradient method in measure space and a finite element discretization.

97 MATHEMATICS AND COMPUTING↗

Stochasticity and robustness in spiking neural networks

Despite drawing inspiration from biological systems which are inherently noisy and variable, artificial neural networks have been shown to require precise weights to carry out the task which they are trained to accomplish. This creates a challenge when adapting these artificial networks to specialized execution platforms which may encode weights in a manner which restricts their accuracy and/or precision.Reflecting back on the non-idealities which are observed in biological systems, we investigated the effect these properties have on the robustness of spiking neural networks under perturbations to weights. First, we examined techniques extant in conventional neural networks which resemble noisy processes, and postulated they may produce similar beneficial effects in spiking neural networks. Second, we evolved a set of spiking neural networks utilizing biological non-idealities to solve a pole-balancing task, and estimated their robustness. We showed it is higher in networks using noisy neurons, and demonstrated that one of these networks can perform well under the variance expected when a hafnium-oxide based resistive memory is used to encode synaptic weights. Lastly, we trained a series of networks using a surrogate gradient method on the MNIST classification task. We confirmed that these networks demonstrate similar trends in robustness to the evolved networks. We discuss these results and argue that they display empirical evidence supporting the role of noise as a regularizer which can increase network robustness.

97 MATHEMATICS AND COMPUTING↗

A machine learning framework for accurate and robust analysis of radiation detector pulses

The microscopic properties of atomic nuclei are used to study various scientific questions. They are essential for understanding the fundamental forces of nature and the chemical evolution of the universe. Detecting decay radiation from radioactive nuclei makes it possible to probe these fundamental nuclear properties. Detector waveform traces may contain additional information about the radiation. Generally, advanced signal processing techniques are needed to extract this additional information, often involving fitting the waveform with model response functions using non-linear least-squares optimization with second-order gradient methods. While this is a powerful technique, it is also computationally expensive, leading to slow processing time, which scales with the volume of data. To address this problem, we have developed a machine learning (ML) approach that infers the characteristics of traces from a model detector response function. In particular, we are interested in classifying whether a single recorded trace consists of one or two pulse constituents and estimating the pulse parameters. Furthermore, our proposed ML method can precisely extract the pulses’ parameters, such as energy and timing information, and accurately classify the pulse multiplicity of a trace. Unlike non-learning-based approaches, our ML approach uses neural networks that are significantly faster at inference, as they do not require any optimization during this stage.

Curve fitting↗

Perspective on Many-Body Methods for Molecular Polaritonic Systems

Recent advances in strong light–matter interactions have revealed a wealth of new physical phenomena in molecules embedded in optical cavities, including modified chemical reactivity, altered excitation spectra, and novel quantum correlations. To describe these effects from first-principles, the field of ab initio quantum electrodynamics (QED) has emerged as a compelling extension of quantum chemistry that treats electronic and photonic degrees of freedom on equal footing. In this Perspective, we review the growing landscape of many-body QED methods, including Hartree–Fock, density functional theory (QEDFT), time-dependent DFT (QED-TDDFT), configuration interaction (QED-CI), complete active space (QED-CASSCF), coupled cluster (QED-CC), quantum Monte Carlo (QED-QMC), and density matrix renormalization group (QED-DMRG), highlighting recent developments and implementations. We further explore real-time methods, gradient and Hessian formalisms, and the integration of nonadiabatic nuclear dynamics. Applications range from benchmark simulations of polaritonic chemistry to quantum simulations on emerging quantum hardware. We conclude by outlining future directions for theory development and interdisciplinary efforts at the interface of quantum chemistry, condensed matter, and quantum optics.

36 MATERIALS SCIENCE↗

High-Quality SnSe 2 Single Crystals: Electronic and Thermoelectric Properties

In this work, high-quality SnSe 2 single crystals were successfully synthesized using a temperature gradient method. N-type characteristics and strong anisotropic transport properties of SnSe 2 single crystals were exhibited between the ab plane and the c-axis. At 673 K, the power factor (PF) value along the ab plane is 3.43 μW cm -1 K -2 , while it is 0.92 μW cm -1 K -2 along the c-axis. The ratio between thermal conductivities along the ab plane (κ ab ) and c-axis (κ c ) is on the order of 7.6 at 300 K, while this value is about 5.6 at 673 K. The thermoelectric figure of merit (ZT) in the c-axis (0.15) is higher than that (0.1) along the ab plane, according to the ultralow out-of-plane thermal conductivity. The electronic band structure results, which were examined by angle-resolved photoemission spectroscopy (ARPES) predicted the potential of improving the thermoelectric performance of SnSe 2 single crystals by electron doping.

36 MATERIALS SCIENCE↗

Learning in continuous action space for developing high dimensional potential energy models

Reinforcement learning (RL) approaches that combine a tree search with deep learning have found remarkable success in searching exorbitantly large, albeit discrete action spaces, as in chess, Shogi and Go. Many real-world materials discovery and design applications, however, involve multi-dimensional search problems and learning domains that have continuous action spaces. Exploring high-dimensional potential energy models of materials is an example. Traditionally, these searches are time consuming (often several years for a single bulk system) and driven by human intuition and/or expertise and more recently by global/local optimization searches that have issues with convergence and/or do not scale well with the search dimensionality. Here, in a departure from discrete action and other gradient-based approaches, we introduce a RL strategy based on decision trees that incorporates modified rewards for improved exploration, efficient sampling during playouts and a “window scaling scheme" for enhanced exploitation, to enable efficient and scalable search for continuous action space problems. Using high-dimensional artificial landscapes and control RL problems, we successfully benchmark our approach against popular global optimization schemes and state of the art policy gradient methods, respectively. We demonstrate its efficacy to parameterize potential models (physics based and high-dimensional neural networks) for 54 different elemental systems across the periodic table as well as alloys. We analyze error trends across different elements in the latent space and trace their origin to elemental structural diversity and the smoothness of the element energy surface. Broadly, our RL strategy will be applicable to many other physical science problems involving search over continuous action spaces.

36 MATERIALS SCIENCE↗

Light in the dark forest. Part I. An efficient optimal estimator for 3D Lyman-alpha forest power spectrum

The highly anisotropic nature of the Lyman-alpha (Lyα) forest data introduces a complex survey window function that complicates the measurement of the three-dimensional power spectrum ( P 3D ). In this paper, we present the first fully optimal estimator for P 3D , which exactly deconvolves the survey window function and marginalizes contaminated modes that distort the power spectrum. Our approach adapts optimal estimator techniques developed for the 2D cosmic microwave background data to the 3D case. To achieve computational feasibility, we employ the conjugate gradient method and implement the P 3 M formalism to handle large-scale and small-scale operations separately and efficiently. We validate our estimator using Monte Carlo mocks and Gaussian simulations, demonstrating its accuracy and computational efficiency. We confirm that mode marginalization eliminates distortions arising from quasar continuum errors and delivers robust power spectrum estimation, though it also inflates errors at large scales. This first implementation works in the flat-sky case; we discuss the remaining steps needed to generalize it to the curved-sky case. This formalism offers a foundation for the Lyα forest P 3D measurements and a new path toward cosmological constraints from the Lyα forest data.

Lyman alpha forest↗

Efficient quantum circuits based on the quantum natural gradient

Efficient preparation of arbitrary entangled quantum states is crucial for quantum computation. This is particularly important for noisy intermediate-scale quantum simulators relying on variational hybrid quantum-classical algorithms. To that end, we propose symmetry-conserving modified quantum approximate optimization algorithm (SCom-QAOA) circuits. The depths of these circuits depend not only on the desired fidelity to the target state but also on the amount of entanglement the state contains. The parameters of the SCom-QAOA circuits are optimized using the quantum natural gradient method based on the Fubini-Study metric. The SCom-QAOA circuit transforms an unentangled state into a ground state of a gapped one-dimensional Hamiltonian with a circuit depth that depends not on the system size but rather on the finite correlation length. In contrast, the circuit depth grows proportionally to the system size for preparing low-lying states of critical one-dimensional systems. Even in the latter case, SCom-QAOA circuits with depth less than the system size were sufficient to generate states with fidelity in excess of 99%, which is relevant for near-term applications. The proposed scheme enlarges the set of the initial states accessible for variational quantum algorithms and widens the scope of investigation of nonequilibrium phenomena in quantum simulators. Published by the American Physical Society 2024

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Deploying Traffic Smoothing Cruise Controllers Learned from Trajectory Data

Autonomous vehicle-based traffic smoothing con- trollers are often not transferred to real-world use due to challenges in calibrating many-agent traffic simulators. We show a pipeline to sidestep such calibration issues by collecting trajectory data and learning controllers directly from trajectory data that are then deployed zero-shot onto the highway. We construct a dataset of 772.3 kilometers of recorded drives on the I-24. We then construct a simple simulator using the recorded drives as the lead vehicle in front of a simulated platoon consisting of one autonomous vehicle and five human followers. Using policy-gradient methods with an asymmetric critic to learn the controller, we show that we are able to improve average MPG by 11% in simulation on congested trajectories. We deploy this controller to a mixed platoon of 4 autonomous Toyota RAV-4’s and 7 human drivers in a validation experiment and demonstrate that the expected time-gap of the controller is maintained in the real world test. Finally, we release the driving dataset [1], the simulator, and the trained controller at https://github.com/nathanlct/trajectory-training-icra.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A High-Throughput Solver for Marginalized Graph Kernels on GPU

Here, we present the design and optimization of a solver for efficient and high-throughput computation of the marginalized graph kernel on General Purpose GPUs. The graph kernel is computed using the conjugate gradient method to solve a generalized Laplacian of the tensor product between a pair of graphs. To cope with the large gap between the instruction throughput and the memory bandwidth of the GPUs, our solver forms the graph tensor product on-the-fly without storing it in memory. This is achieved by using threads in a warp cooperatively to stream the adjacency and edge label matrices of individual graphs by small square matrix blocks called tiles, which are then staged in registers and the shared memory for later reuse. Warps across a thread block can further share tiles via the shared memory to increase data reuse. We exploit the sparsity of the graphs hierarchically by storing only non-empty tiles using a coordinate format and nonzero elements within each tile using bitmaps. We propose a new partition-based reordering algorithm for aggregating nonzero elements of the graphs into fewer but denser tiles to further exploit sparsity. We carry out extensive theoretical analyses on the graph tensor product primitives for tiles of various density and evaluate their performance on synthetic and real-world datasets. Our solver delivers three to four orders of magnitude speedup over existing CPU-based solvers such as GraKeL and GraphKernels. The capability of the solver enables kernel-based learning tasks at unprecedented scales.

97 MATHEMATICS AND COMPUTING↗

Improving Deep Neural Networks’ Training for Image Classification With Nonlinear Conjugate Gradient-Style Adaptive Momentum

Momentum is crucial in stochastic gradient-based optimization algorithms for accelerating or improving training deep neural networks (DNNs). In deep learning practice, the momentum is usually weighted by a well-calibrated constant. However, tuning the hyperparameter for momentum can be a significant computational burden. In this article, we propose a novel adaptive momentum for improving DNNs training; this adaptive momentum, with no momentum-related hyperparame- ter required, is motivated by the nonlinear conjugate gradient (NCG) method. Stochastic gradient descent (SGD) with this new adaptive momentum eliminates the need for the momentum hyperparameter calibration, allows using a significantly larger learning rate, accelerates DNN training, and improves the final accuracy and robustness of the trained DNNs. For example, SGD with this adaptive momentum reduces classification errors for training ResNet110 for CIFAR10 and CIFAR100 from 5.25% to 4.64% and 23.75% to 20.03%, respectively. Furthermore, SGD, with the new adaptive momentum, also benefits adversarial training and, hence, improves the adversarial robustness of the trained DNNs.

97 MATHEMATICS AND COMPUTING↗

ARC-DPA 1-MeV Neutron Fluence Equivalence Model for GaAs

Here, the legacy data used in the production of the American Society for Testing and Materials (ASTM) E722 standard for gallium arsenide (GaAs) were fit with the athermal recombination corrected-displacements per atom (ARC-DPA) model for the development of a novel 1-MeV neutron equivalent fluence metric. Improving on previous work, the coefficients for the ARC-DPA model were optimized using a conjugate gradient method, and the uncertainties in the observed damage in different benchmark neutron fields were sampled to quantify their contribution to the damage metric. The optimized parameters of −0.474 ± 0.03 for b arcdpa and 0.016 ± 0.002 for c arcdpa provided good agreement and indicated that the solution is not sensitive to the corresponding fluence uncertainties. Compared to the current 1-MeV neutron fluence equivalence standard for displacement damage in GaAs, our results indicate that for a thermal reactor neutron environment, displacement damage has been underestimated by around 25% and that the saturation value for the damage efficiency had been higher than previously modeled.

1-MeV equivalent fluence↗