Search NASA⌕ Search

SEARCH · Search NASA

Results for “stochastic gradient”

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 109 records · Page 6

Scalable Second Order Optimization for Machine Learning

Many machine learning (ML) training tasks are essentially optimization processes that would at first glance appear eminently parallelizable and scalable. However, effective acceleration of these tasks with scalable parallel hardware has proven to be elusive. While standard methods for machine learning, e.g., stochastic gradient descent (SGD) for DNNs, tend to be resource efficient, they appear to be fundamentally sequential in nature.

97 MATHEMATICS AND COMPUTING↗

Trustworthy Physics-Informed Deep Learning for Predictive Scientific Computing

This project has developed powerful trustworthy physics-informed deep learning (TPiDL) models and methods to fundamentally enhance the scale and power of computational modeling in the scientific and engineering domains. Deep learning (DL) has radically advanced the state-of-the-art in machine learning, computer vision, natural language processing, and also scientific computing. Nevertheless, progress has been driven almost entirely by empirical observations, hacks, and tricks. Under the support of this project, the graph operator learning tools and advanced trustworthy physical informed neural networks have been developed. In addition, stochastic gradient replica-exchange Markov Chain Monte Carlo (MCMC) sampling algorithms have been designed to quantify the uncertainties and speed up the training of large-scale neural networks.

97 MATHEMATICS AND COMPUTING↗

An Adaptive Optimizer for Measurement-Frugal Variational Algorithms

Variational hybrid quantum-classical algorithms (VHQCAs) have the potential to be useful in the era of near-term quantum computing. However, recently there has been concern regarding the number of measurements needed for convergence of VHQCAs. Here, we address this concern by investigating the classical optimizer in VHQCAs. We introduce a novel optimizer called individual Coupled Adaptive Number of Shots (iCANS). This adaptive optimizer frugally selects the number of measurements (i.e., number of shots) both for a given iteration and for a given partial derivative in a stochastic gradient descent. We numerically simulate the performance of iCANS for the variational quantum eigensolver and for variational quantum compiling, with and without noise. In all cases, and especially in the noisy case, iCANS tends to out-perform state-of-the-art optimizers for VHQCAs. We therefore believe this adaptive optimizer will be useful for realistic VHQCA implementations, where the number of measurements is limited.

97 MATHEMATICS AND COMPUTING↗

Reinforcement Learning-based Output Structured Feedback for Distributed Multi-Area Power System Frequency Control

Load frequency control (LFC) is a key factor to maintain the stable frequency in multi-area power systems. As the modern power systems evolve from centralized to decentralized paradigm, LFC needs to consider the decentralized scheme that considers limited information from the information-exchange graph for the generator control of each interconnected area. This paper aims to solve a data-driven constrained LQR problem with mean-variance risk constraints and output structured feedback, and applies this framework to solve the LFC problem in multi-area power systems. By reformulating the constrained optimization problem into a minimax problem, the stochastic gradient descent max-oracle (SGDmax) algorithm with zero-order policy gradient (ZOPG) is adopted to find the optimal feedback gain from the learning, while guaranteeing the convergence. In addition, to improve the adaptation of the proposed learning method to new or varying models, we construct an emulator grid that approximates the dynamics of a physical grid and performs training based on this model. Once the feedback gain is obtained from the emulator grid, it is applied to the physical grid with a robustness test to check whether the controller from the approximated emulator applies to the actual system. Numerical tests show that the obtained feedback controller can successfully control the frequency of each area, while mitigating the uncertainty from the loads, with reliable robustness that ensures the adaptability of the obtained feedback gain to the actual physical grid.

Kwon, Kyung-bin↗

Patterns, drivers, and a predictive model of dam removal cost in the United States

Given the burgeoning dam removal movement and the large number of dams approaching obsolescence in the United States, cost estimating data and tools are needed for dam removal prioritization, planning, and execution. We used the list of removed dams compiled by American Rivers to search for publicly available reported costs for dam removal projects. Total cost information could include component costs related to project planning, dam deconstruction, monitoring, and several categories of mitigation activities. We compiled reported costs from 455 unique sources for 668 dams removed in the United States from 1965 to 2020. The dam removals occurred within 571 unique projects involving 1–18 dams. When adjusted for inflation into 2020 USD, cost of these projects totaled $\$1.522$ billion, with per-dam costs ranging from $\$1$ thousand (k) to $\$268.8$ million (M). The median cost for dam removals was $\$157$k, $\$823$k, and $\$6.2$M for dams that were< 5 m, between 5–10 m, and > 10 m in height, respectively. Geographic differences in total costs showed that northern states in general, and the Pacific Northwest in particular, spent the most on dam removal. The Midwest and the Northeast spent proportionally more on removal of dams less than 5 m in height, whereas the Northwest and Southwest spent the most on larger dam removals > 10 m tall. We used stochastic gradient boosting with quantile regression to model dam removal cost against potential predictor variables including dam characteristics (dam height and material), hydrography (average annual discharge and drainage area), project complexity (inferred from construction and sediment management, mitigation, and post-removal cost drivers), and geographic region. Dam height, annual average discharge at the dam site, and project complexity were the predominant drivers of removal cost. The final model had an R 2 of 57% and when applied to a test dataset model predictions had a root mean squared error of $\$5.09$M and a mean absolute error of $\$1.45$M, indicating its potential utility to predict estimated costs of dam removal. We developed a R shiny application for estimating dam removal costs using customized model inputs for exploratory analyses and potential dam removal planning.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

General-Purpose Bayesian Tensor Learning With Automatic Rank Determination and Uncertainty Quantification

A major challenge in many machine learning tasks is that the model expressive power depends on model size. Low-rank tensor methods are an efficient tool for handling the curse of dimensionality in many large-scale machine learning models. The major challenges in training a tensor learning model include how to process the high-volume data, how to determine the tensor rank automatically, and how to estimate the uncertainty of the results. While existing tensor learning focuses on a specific task, this paper proposes a generic Bayesian framework that can be employed to solve a broad class of tensor learning problems such as tensor completion, tensor regression, and tensorized neural networks. We develop a low-rank tensor prior for automatic rank determination in nonlinear problems. Our method is implemented with both stochastic gradient Hamiltonian Monte Carlo (SGHMC) and Stein Variational Gradient Descent (SVGD). We compare the automatic rank determination and uncertainty quantification of these two solvers. We demonstrate that our proposed method can determine the tensor rank automatically and can quantify the uncertainty of the obtained results. We validate our framework on tensor completion tasks and tensorized neural network training tasks.

Bayesian inference↗

NSGA-PINN: A Multi-Objective Optimization Method for Physics-Informed Neural Network Training

This paper presents NSGA-PINN, a multi-objective optimization framework for the effective training of physics-informed neural networks (PINNs). The proposed framework uses the non-dominated sorting genetic algorithm (NSGA-II) to enable traditional stochastic gradient optimization algorithms (e.g., ADAM) to escape local minima effectively. Additionally, the NSGA-II algorithm enables satisfying the initial and boundary conditions encoded into the loss function during physics-informed training precisely. We demonstrate the effectiveness of our framework by applying NSGA-PINN to several ordinary and partial differential equation problems. In particular, we show that the proposed framework can handle challenging inverse problems with noisy data.

Lu, Binghang (ORCID:0009000160016632)↗

A Framework for Incorporating General Domain Knowledge into Latent Dirichlet Allocation using First-Order Logic

Topic models have been used successfully for a variety of problems, often in the form of application-specific extensions of the basic Latent Dirichlet Allocation (LDA) model. Because deriving these new models in order to encode domain knowledge can be difficult and time-consuming, we propose the Fold-all model, which allows the user to specify general domain knowledge in First-Order Logic (FOL). However, combining topic modeling with FOL can result in inference problems beyond the capabilities of existing techniques. We have therefore developed a scalable inference technique using stochastic gradient descent which may also be useful to the Markov Logic Network (MLN) research community. Experiments demonstrate the expressive power of Fold-all, as well as the scalability of our proposed inference method.

97 MATHEMATICS AND COMPUTING↗

Method and apparatus for constructing informative outcomes to guide multi-policy decision making

In Multi-Policy Decision-Making (MPDM), many computationally-expensive forward simulations are performed in order to predict the performance of a set of candidate policies. In risk-aware formulations of MPDM, only the worst outcomes affect the decision making process, and efficiently finding these influential outcomes becomes the core challenge. Recently, stochastic gradient optimization algorithms, using a heuristic function, were shown to be significantly superior to random sampling. In this disclosure, it was shown that accurate gradients can be computed-even through a complex forward simulation—using approaches similar to those in dep networks. The proposed approach finds influential outcomes more reliably, and is faster than earlier methods, allowing one to evaluate more policies while simultaneously eliminating the need to design an easily-differentiable heuristic function.

Olson, Edwin↗

Estimation of terrain iso-gradients from a stochastic range data measurement matrix

The problem of estimating terrain iso-gradients for an autonomous roving vehicle is complicated by the measurement error inherent in the range data matrix. In this paper, the in-path and cross-path slopes at each data point in the multivariable range matrix are expressed in terms of parameters at that data point and those at its surrounding points. The sensitivity in the change of these slopes - due to the errors in measurements in range, elevation angle and azimuth angle are formulated. These sensitivities are used to determine the appropriate statistics of the gradient, which are then used to describe the terrain with a known probability of accuracy.

Shen, C. N.↗

Stochastic Simplex Approximate Gradient for Robust Life-cycle Production Optimization: Applied to Brugge Field

In oil and gas production industry, production optimization is a viable technique to maximize the oil/gas production or net present value (NPV). Robust optimization is one type of production optimization techniques where the geological uncertainty of reservoir is considered. When well operating conditions, e.g., well flow rates and bottom-hole pressures, are the optimization variables, ensemble-based optimization (EnOpt) is the most popular ensemble-based algorithm for robust life-cycle production optimization. Recently, however, a superior algorithm, stochastic simplex approximate gradient (StoSAG), was proposed. Finally, the purpose of this study is to provide a theoretical discussion on why StoSAG is generally superior to EnOpt and provide reasonable example (Brugge field) where StoSAG generates estimates of optimal well controls that give a life-cycle net present value (NPV) significantly higher than the NPV obtained from EnOpt.

02 PETROLEUM↗

Stochastic estimates of gradient from laser measurements for an autonomous Martian roving vehicle

The general problem of estimating the state vector x from the state equation h = Ax where h, A, and x are all stochastic, is presented. Specifically, the problem is for an autonomous Martian roving vehicle to utilize laser measurements in estimating the gradient of the terrain. Error exists due to two factors - surface roughness and instrumental measurements. The errors in slope depend on the standard deviations of these noise factors. Numerically, the error in gradient is expressed as a function of instrumental inaccuracies. Certain guidelines for the accuracy of permissable gradient must be set. It is found that present technology can meet these guidelines.

Burger, P. A.↗

Stochastic estimates of gradient from laser measurements for an autonomous Martian Roving Vehicle

The general problem presented in this paper is one of estimating the state vector x from the state equation h = Ax, where h, A, and x are all stochastic. Specifically, the problem is for an autonomous Martian Roving Vehicle to utilize laser measurements in estimating the gradient of the terrain. Error exists due to two factors - surface roughness and instrumental measurements. The errors in slope depend on the standard deviations of these noise factors. Numerically, the error in gradient is expressed as a function of instrumental inaccuracies. Certain guidelines for the accuracy of permissable gradient must be set. It is found that present technology can meet these guidelines.-

Shen, C. N.↗

Optimization using pathwise algorithmic derivatives of electromagnetic shower simulations

Among the well-known methods to approximate derivatives of expectancies computed by Monte-Carlo simulations, averages of pathwise derivatives are often the easiest one to apply. Computing them via algorithmic differentiation typically does not require major manual analysis and rewriting of the code, even for very complex programs like simulations of particle-detector interactions in high-energy physics. However, the pathwise derivative estimator can be biased if there are discontinuities in the program, which may diminish its value for applications. This work integrates algorithmic differentiation into the electromagnetic shower simulation code HepEmShow based on G4HepEm, allowing us to study how well pathwise derivatives approximate derivatives of energy depositions in a sampling calorimeter with respect to parameters of the beam and geometry. We found that when multiple scattering is disabled in the simulation, means of pathwise derivatives converge quickly to their expected values, and these are close to the actual derivatives of the energy deposition. Additionally, we demonstrate the applicability of this novel gradient estimator for stochastic gradient-based optimization in a model example.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Particle transport in Markov stochastic mixtures with spatial gradients

Markov geometries are a prototype class of stochastic media that are widely used to model complex disordered systems. In a series of recent works, we have shown that spatially homogeneous (but possibly non-isotropic) Poisson tessellations can be conveniently used in order to generate three-dimensional realizations of Markov media and thus characterize the features of particle transport e.g. in fragmented fuel elements following severe nuclear accidents or Rayleigh-Taylor turbulent mixing for inertial confinement fusion. In this paper we show that Poisson tessellations can be extended to take into account the presence of spatial gradients, which commonly occur in real-world applications due to material stratification. For this purpose, we will provide an explicit construction of spatially-non-homogeneous Poisson tessellations, fully characterize their statistical properties, and finally illustrate the behaviour of particle transport in such random media. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Heat Transport Hysteresis Generated Through Frequency Switching of a Time-Dependent Temperature Gradient

A stochastic energetics framework is applied to examine how periodically shifting the frequency of a time-dependent oscillating temperature gradient affects heat transport in a nanoscale molecular model. We specifically examine the effects that frequency switching, i.e., instantaneously changing the oscillation frequency of the temperature gradient, has on the shape of the heat transport hysteresis curves generated by a particle connected to two thermal baths, each with a temperature that is oscillating in time. Analytical expressions are derived for the energy fluxes in/out of the system and the baths, with excellent agreement observed between the analytical expressions and the results from nonequilibrium molecular dynamics simulations. We find that the shape of the heat transport hysteresis curves can be significantly altered by shifting the frequency between fast and slow oscillation regimes. We also observe the emergence of features in the hysteresis curves such as pinched loops and complex multi-loop patterns due to the frequency shifting. The presented results have implications in the design of thermal neuromorphic devices such as thermal memristors and thermal memcapacitors.

36 MATERIALS SCIENCE↗

Stochastic renormalization group and gradient flow

A non-perturbative and continuous definition of RG transformations as stochastic processes is proposed, inspired by the observation that the functional RG equations for effective Boltzmann factors may be interpreted as Fokker-Planck equations. The result implies a new approach to Monte Carlo RG that is amenable to lattice simulation. Long-distance correlations of the effective theory are shown to approach gradient-flowed correlations, which are simpler to measure. The Markov property of the stochastic RG transformation implies an RG scaling formula which allows for the measurement of anomalous dimensions when transcribed into gradient flow expectation values.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Gradient flow of the stochastic relaxation on a generic exponential family

We study the natural gradient flow of the expected value E{sub p} [f] of an objective function f for p in an exponential family. We parameterize the exponential family with the expectation parameters and we show that the dynamical system associated to the natural gradient flow can be extended outside the marginal polytope.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗