Search NASA⌕ Search

SEARCH · Search NASA

Results for “Gradient estimation”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Random coordinate descent: A simple alternative for optimizing parameterized quantum circuits

Variational quantum algorithms rely on the optimization of parameterized quantum circuits in noisy settings. The commonly used back-propagation procedure in classical machine learning is not directly applicable in this setting due to the collapse of quantum states after measurements. Thus, gradient estimations constitute a significant overhead in a gradient-based optimization of such quantum circuits. This paper introduces a random coordinate descent algorithm as a practical and easy-to-implement alternative to the full gradient descent algorithm. This algorithm only requires one partial derivative at each iteration. Motivated by the behavior of measurement noise in the practical optimization of parameterized quantum circuits, this paper presents an optimization problem setting that is amenable to analysis. Under this setting, the random coordinate descent algorithm exhibits the same level of stochastic stability as the full gradient approach, making it as resilient to noise. The complexity of the random coordinate descent method is generally no worse than that of the gradient descent and can be much better for various quantum optimization problems with anisotropic Lipschitz constants. Theoretical analysis and extensive numerical experiments validate our findings. Published by the American Physical Society 2024

Ding, Zhiyan (ORCID:000000018863403X)↗
DOE OSTI2020

On the use of adjoints in the inversion of observed quasi-static deformation

An adjoint-based conjugate gradient algorithm provides an efficient means for imaging sources of deformation within the Earth, such as volume stresses associated with fluid flow in aquifers and reservoirs. For time intervals over which the overburden deforms elastically, one can calculate the gradient elements for a single model update using just two numerical simulations. The first is a forward run that is used to compute the residuals associated with the given iteration. The second simulation is to evaluate the application of the adjoint operator to the residuals. In this adjoint calculation, the residual displacements are applied as sources at the measurement locations, driving the deformation in the simulation. The volume stress on the source grid blocks, in response to the residual displacements, provide the gradient components. We apply this technique to satellite-based interferometric synthetic aperture radar (InSAR) line-of-sight displacements that were observed over an oil reservoir in California’s Central Valley. Furthermore, we find that the adjoint-based gradient estimates, requiring 18 CPU seconds, agree with conventional numerical calculations that take over 3700 CPU seconds to compute. Conjugate gradient algorithms utilizing the conventional approach and adjoint-based gradient computations give roughly the same reductions in misfit and similar final estimates of reservoir volume change.

58 GEOSCIENCES↗
DOE OSTI2023

An adaptive sampling augmented Lagrangian method for stochastic optimization with deterministic constraints

The primary goal of this paper is to provide an efficient solution algorithm based on the augmented Lagrangian framework for optimization problems with a stochastic objective function and deterministic constraints. Our main contribution is combining the augmented Lagrangian framework with adaptive sampling, resulting in an efficient optimization methodology validated with practical examples. To achieve the presented efficiency, here we consider inexact solutions for the augmented Lagrangian subproblems, and through an adaptive sampling mechanism, we control the variance in the gradient estimates. Furthermore, we analyze the theoretical performance of the proposed scheme by showing equivalence to a gradient descent algorithm on a Moreau envelope function, and we prove sublinear convergence for convex objectives and linear convergence for strongly convex objectives with affine equality constraints. The worst-case sample complexity of the resulting algorithm, for an arbitrary choice of penalty parameter in the augmented Lagrangian function, is $\mathscr{O}$(ϵ -3-δ ) , where ϵ > 0 is the expected error of the solution and δ > 0 is a user-defined parameter. If the penalty parameter is chosen to be $\mathscr{O}$(ϵ -1 ), we demonstrate that the result can be improved to $\mathscr{O}$(ϵ -2 ) , which is competitive with the other methods employed in the literature. Moreover, if the objective function is strongly convex with affine equality constraints, we obtain $\mathscr{O}$(ϵ -1 log(1/ϵ)) complexity. Finally, we empirically verify the performance of our adaptive sampling augmented Lagrangian framework in machine learning optimization and engineering design problems, including topology optimization of a heat sink with environmental uncertainty.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Towards Query-Efficient Black-Box Adversary with Zeroth-Order Natural Gradient Descent

Despite the great achievements of the modern deep neural networks (DNNs), the vulnerability/robustness of state-of-the-art DNNs raises security concerns in many application domains requiring high reliability. Various adversarial attacks are proposed to sabotage the learning performance of DNN models. Among those, the black-box adversarial attack methods have received special attentions owing to their practicality and simplicity. Black-box attacks usually prefer less queries in order to maintain stealthy and low costs. However, most of the current black-box attack methods adopt the first-order gradient descent method, which may come with certain deficiencies such as relatively slow convergence and high sensitivity to hyper-parameter settings. In this paper, we propose a zeroth-order natural gradient descent (ZO-NGD) method to design the adversarial attacks, which incorporates the zeroth-order gradient estimation technique catering to the black-box attack scenario and the second-order natural gradient descent to achieve higher query efficiency. The empirical evaluations on image classification datasets demonstrate that ZO-NGD can obtain significantly lower model query complexities compared with state-of-the-art attack methods.

Zhao, Pu↗
DOE OSTI2021

Natural evolutionary strategies for variational quantum computation

Abstract Natural evolutionary strategies (NES) are a family of gradient-free black-box optimization algorithms. This study illustrates their use for the optimization of randomly initialized parameterized quantum circuits (PQCs) in the region of vanishing gradients. We show that using the NES gradient estimator the exponential decrease in variance can be alleviated. We implement two specific approaches, the exponential and separable NES, for parameter optimization of PQCs and compare them against standard gradient descent. We apply them to two different problems of ground state energy estimation using variational quantum eigensolver and state preparation with circuits of varying depth and length. We also introduce batch optimization for circuits with larger depth to extend the use of ES to a larger number of parameters. We achieve accuracy comparable to state-of-the-art optimization techniques in all the above cases with a lower number of circuit evaluations. Our empirical results indicate that one can use NES as a hybrid tool in tandem with other gradient-based methods for optimization of deep quantum circuits in regions with vanishing gradients.

Anand, Abhinav (ORCID:0000000280812310)↗
NASA NTRS2001

AMSU-A Tropical Cyclone Maximum Sustained Winds and Web Site

The Advanced Microwave Sounding Unit (AMSU)-A instruments on the NOAA-15 and NOAA-16 satellites provide information on the warm cores of tropical cyclones from oxygen channel brightness temperature (Tb) measurements near 55 GHz. With appropriate assumptions, cyclone-scale Tb gradients can be directly related to middle-to-lower tropospheric height gradients. We have developed a method for diagnosis of maximum sustained winds (Vmax) from radially averaged Tb gradients in several of the AMSU channels. Calibration of the method with recon-based (or other in situ) winds results in better agreement than with Dvorak wind estimates. Gradient wind theory shows that the warm core Tb gradient signal increases non-linearly with wind speed, making microwave temperature sounders useful for diagnosing high wind speeds, but at the expense of a minimum useful detection limit of about 40 knots. It is found that accurate wind diagnoses depend upon (1) accounting for hydrometeor effects in the AMSU channels, and (2) maximizing signal-to-noise, since the 50 km resolution data cannot fully resolve the temperature gradients in the Vmax region, typically 10-20 km in scale. AMSU imagery and max diagnoses from specific hurricanes will be shown, including independent tests from the 2000 hurricane season.

Spencer, Roy↗
NASA NTRS1986

Automated remote sensing of sea ice using synthetic aperture radar

Two techniques for automated sea ice tracking: image pyramids (hierarchical correlation) and feature tracking were applied to a pair of SEASAT SAR sea ice images. The results compare well with each other and manually tracked estimates of the ice velocity field. Refinement of the image pyramid technique should include removal of a small number of erroneous velocity vectors using constraints dependent on correlation coefficient, near neighbor velocities, and velocity gradients. Estimates of sea ice velocity are successfully obtained over limited areas using the boundary segment tracking technique. Refinement of the feature tracking technique should include use of pressure ridge features, constrained search, and relaxation techniques.

Vesecky, J. F.↗
DOE OSTI2018

Efficient Generalizable Deep Learning

Stochastic optimization is a fundamental field of research for machine learning. Stochastic gradient descent (SGD) and related methods provide a feasible means to train complicated prediction models over large datasets. SGD, however, does not explicitly address the problem of overfitting, which can lead to predictions that perform poorly on new data. This difference between loss performance on unseen testing data verses that of training data defines the generalization gap of a model. We introduce a new computational kernel called Stochastic Hessian Projection (SHP) that uses a maximum likelihood framework to simultaneously estimate gradient noise covariance and local curvature of the loss function. Our analysis illustrates that these quantities affect the evolution of parameter uncertainty and therefore generalizability. We show how these computations allow us to predict the generalization gap without requiring holdout data. Explicitly assessing this metric for generalizability during training may improve machine learning predictions when data is scarce and understanding prediction variability is critical.

42 ENGINEERING↗
DOE OSTI2024

A simple method for obtaining heat capacity coefficients of minerals

Abstract Heat capacity data are unavailable or incomplete for many minerals at geologically relevant temperatures. Despite the availability of entropy and enthalpy values in numerous thermodynamic tables (even sometimes at elevated temperatures), there remains need for extrapolation beyond, or interpolation between, temperatures. This approach inevitably results in estimates for entropy and enthalpy values because the heat capacity coefficients required for optimal thermodynamic treatment are less frequently available. Here we propose a simple method for obtaining heat capacity coefficients of minerals. This method requires only the empirically measured temperature-specific heat capacity for calculation via a matrix algorithm. The system of equations solver is written in the Python computing language and has been made accessible in an online repository. Thermodynamically, the solution to a system of equations represents the heat capacity coefficients that satisfy the mineral-specific polynomial. Direct coefficient calculation will result in more robust thermodynamic data, which are not subject to fitting uncertainties. Using hematite as an example, this method provides results that are comparable to conventional means and is applicable to any solid material. Coefficients vary within the traditional large 950 K temperature interval, indicating that best results should instead utilize a smaller 400 K temperature interval. Examples of large-scale implications include the refinement of geothermal gradient estimation in rapidly subsiding sedimentary basins or metamorphic and hydrothermal evolution.

Geochemistry & Geophysics↗
DOE OSTI2023

Risk-Constrained Reinforcement Learning for Inverter-Dominated Power System Controls

Here, this paper develops a risk-aware controller for grid-forming inverters (GFMs) to minimize large frequency oscillations in GFM inverter-dominated power systems. To tackle the high variability from loads/renewables, we incorporate a mean-variance risk constraint into the classical linear quadratic regulator (LQR) formulation for this problem. The risk constraint aims to bound the time-averaged cost of state variability and thus can improve the worst-case performance for large disturbances. The resulting risk-constrained LQR problem is solved through the dual reformulation to a minimax problem, by using a reinforcement learning (RL) method termed as stochastic gradient-descent with max-oracle (SGDmax). In particular, the zero-order policy gradient (ZOPG) approach is used to simplify the gradient estimation using simulated system trajectories. Numerical tests conducted on the IEEE 68-bus system have validated the convergence of our proposed SGDmax for GFM model and corroborate the effectiveness of the risk constraint in improving the worst-case performance while reducing the variability of the overall control cost.

Frequency control↗
NASA NTRS1972

System identification computational considerations.

System identification methods may be accurately characterized as inverse computational problems. Three approaches to the computational problem are considered. Equation error methods are based on regression analysis techniques. Attention is given to the maximum conditional likelihood estimate and the maximum unconditional likelihood (Bayesian) estimate. Gradient dependent algorithms for solving the minimization problems are discussed, taking into account Gaussian methods, quadratic model methods, and the homogeneous function model method of Jacobson and Oksman. Some advanced methods are also examined.

Bowles, R. L.↗
NASA NTRS1979

Data acquisition and path selection decision making for an autonomous roving vehicle

The feasibility of using range/pointing angle data such as might be obtained by a laser rangefinder for the purpose of terrain evaluation in the 10-40 meter range on which to base the guidance of an autonomous rover was investigated. The decision procedure of the rapid estimation scheme for the detection of discrete obstacles has been modified to reinforce the detection ability. With the introduction of the logarithmic scanning scheme and obstacle identification scheme, previously developed algorithms are combined to demonstrate the overall performance of the intergrated route designation system using laser rangefinder. In an attempt to cover a greater range, 30 m to 100 mm, the problem estimating gradients in the presence of positioning angle noise at middle range is investigated.

Shen, C. N.↗
NASA NTRS1991

The effect of model uncertainty on some optimal routing problems

The effect of model uncertainties on optimal routing in a system of parallel queues is examined. The uncertainty arises in modeling the service time distribution for the customers (jobs, packets) to be served. For a Poisson arrival process and Bernoulli routing, the optimal mean system delay generally depends on the variance of this distribution. However, as the input traffic load approaches the system capacity the optimal routing assignment and corresponding mean system delay are shown to converge to a variance-invariant point. The implications of these results are examined in the context of gradient-based routing algorithms. An example of a model-independent algorithm using online gradient estimation is also included.

Mohanty, Bibhu↗
NASA NTRS2000

VLBI Contribution to ITRF2000

The VLBI data set spanning Aug. 1919 to the present is a major constituent of ITRF2000 because of the time span, the geometric strength and the accuracy of the modeling. Formal velocity errors for the best stations are less than 0.3 mm/yr while the probable frame definition error for station velocities is approximately 0.4 mm/yr. The primary systematic errors are the troposphere and tidal loading (solid Earth and ocean). However, the scale of the VLBI TRF is probably only weakly affected because of continued improvements in the tropospheric mapping function and gradient estimation. There are some weaknesses in the spatial distribution of data, particularly in the southern hemisphere, and the quality of the mobile VLBI results is now suboptimal. The deployment of the TIGO system to Chile will improve the geometric coverage. The current state of the art of VLBI analysis will be discussed.

Ma, Chopo↗
NASA NTRS2011

Intelligent Control for Drag Reduction on the X-48B Vehicle

This paper focuses on the development of an intelligent control technology for in-flight drag reduction. The system is integrated with and demonstrated on the full X-48B nonlinear simulation. The intelligent control system utilizes a peak-seeking control method implemented with a time-varying Kalman filter. Performance functional coordinate and magnitude measurements, or independent and dependent parameters respectively, are used by the Kalman filter to provide the system with gradient estimates of the designed performance function which is used to drive the system toward a local minimum in a steepestdescent approach. To ensure ease of integration and algorithm performance, a single-input single-output approach was chosen. The framework, specific implementation considerations, simulation results, and flight feasibility issues related to this platform are discussed.

Griffin, Brian Joseph↗
DOE OSTI2026

Optimality of Gradient-MUSIC for Spectral Estimation

We introduce the Gradient-MUSIC algorithm for estimating the unknown frequencies and amplitudes of a nonharmonic signal from noisy time samples. While the classical MUSIC algorithm performs a computationally expensive search over a fine grid, Gradient-MUSIC is significantly more efficient and eliminates the need for discretization over a fine grid by using optimization techniques. It coarsely scans the 1D landscape to find initialization simultaneously for all frequencies followed by parallelizable local refinement via gradient descent. We also analyze its performance when the noise level is sufficiently small and the signal frequencies are separated by at least 8π/m, where π/m is the standard resolution of this problem. Even though the 1D landscape is nonconvex, we prove a global convergence result for Gradient-MUSIC: coarse scanning provably finds suitable initialization and gradient descent converges at a linear rate. In addition to convergence results, we also upper bound the error between the true signal frequencies and amplitudes with those found by Gradient-MUSIC. For example, if the noise has $\ell^\infty$ norm at most ϵ, then the frequencies and amplitudes are recovered up to error at most Cϵ/m and Cϵ respectively, which are minimax optimal in m and ϵ. Our theory can also handle stochastic noise with performance guarantees under nonstationary independent Gaussian noise. Our main approach is a comprehensive geometric analysis of the landscape, a perspective that has not been explored before.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1990

Performance analysis of structured gradient algorithm

The structured gradient algorithm uses a structured estimate of the array correlation matrix (ACM) to estimate the gradient required for the constrained least-mean-square (LMS) algorithm. This structure reflects the structure of the exact array correlation matrix for an equispaced linear array and is obtained by spatial averaging of the elements of the noisy correlation matrix. In its standard form the LMS algorithm does not exploit the structure of the array correlation matrix. The gradient is estimated by multiplying the array output with the receiver outputs. An analysis of the two algorithms is presented to show that the covariance of the gradient estimated by the structured method is less sensitive to the look direction signal than that estimated by the standard method. The effect of the number of elements on the signal sensitivity of the two algorithms is studied.

Godara, Lal C.↗
DOE OSTI2018

Gradient-based stochastic estimation of the density matrix

Fast estimation of the single-particle density matrix is key to many applications in quantum chemistry and condensed matter physics. The best numerical methods leverage the fact that the density matrix elements f(H) ij decay rapidly with distance rij between orbitals. This decay is usually exponential. However, for the special case of metals at zero temperature, algebraic decay of the density matrix appears and poses a significant numerical challenge. Here, we introduce a gradient-based probing method to estimate all local density matrix elements at a computational cost that scales linearly with system size. For zero-temperature metals, the stochastic error scales like S -(d+2)/2d , where d is the dimension and S is a prefactor to the computational cost. The convergence becomes exponential if the system is at finite temperature or is insulating.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗