Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Gradient descent”

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 253 records · Page 14

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↗

Tiny Bubbles in my BEC

Ultracold atomic gases provide a unique way for exploring many-body quantum phenomena that are inaccessible to conventional low-temperature experiments. Nearly two decades ago the Bose-Einstein condensate (BEC) - an ultracold gas of bosons in which almost all bosons occupy the same single-particle state - became experimentally feasible. Because a BEC exhibits superfluid properties, it can provide insights into the behavior of low-temperature helium liquids. We describe the case of a single distinguishable atom (an impurity) embedded in a BEC and strongly coupled to the BEC bosons. Depending on the strength of impurity-boson and boson-boson interactions, the impurity self-localizes into two fundamentally distinct regimes. The impurity atom can behave as a tightly localized 'polaron,' akin to an electron in a dielectric crystal, or as a 'bubble,' an analog to an electron bubble in superfluid helium. We obtain the ground state wavefunctions of the impurity and BEC by numerically solving the two coupled Gross-Pitaevskii equations that characterize the system. We employ the methods of imaginary time propagation and conjugate gradient descent. By appropriately varying the impurity-boson and boson-boson interaction strengths, we focus on the polaron to bubble crossover. Our results confirm analytical predictions for the polaron limit and uncover properties of the bubble regime. With these results we characterize the polaron to bubble crossover. We also summarize our findings in a phase diagram of the BEC-impurity system, which can be used as a guide in future experiments.

36 MATERIALS SCIENCE↗

A simplified regression building thermal modelling method for detached two-floor house in U.S.

The residential building sector accounts for approximately 37% of total U.S. electricity consumption. Within the residential building sector, heating and cooling is the main target for peak load shifting/reduction since it is the largest contributor to peak demand. In fact, the flexibility of residential HVAC loads can provide continuous variation of demand to provide grid services by varying their demand over a baseline. The performance of HVAC load control to provide grid services relies heavily on the accuracy of indoor air temperature or cooling/heating demand predictions and therefore the quality of building model. Besides forward models, popular building models are data-driven models which can be broken down into two categories: gray-box model, e.g. Resistance-Capacitance (RC) model and black-box model. RC model, also called lumped capacitance or network model, which is constituted with electrical analogue pattern with resistance (R) and capacitance (C). In general, RC models require considerable computation burden and long periods of data to train limited number of model coefficients. Black-box models have gained increasing interest due to their capability in analyzing large-scale data and flexibility in practical applications. But, the data-mining based (machine learning algorithms/techniques based) models tend to have invisible model structures which poses a problem when trying to use the model for optimal control or model predictive control of the HVAC system. Hence, there is a continuing need for efficient online system identification techniques, which can provide explicit parameters for the model. Traditional regression models fit well for this specific purpose. This paper presents an innovative way to predict average indoor temperature in separate floors of typical detached residential house. A rolling horizon linear regression model, which includes online adaptive correction component, is proposed to predict the temperature difference between downstairs and upstairs. A RC model is used to predict the overall mean indoor air temperature. Since the adaptive algorithm needs to be implemented online, a less computation-demanding polynomial fitting algorithm is adopted. This kind of fitting problem can be cast as linear regression problem with multiple variables, parameters of which can be efficiently obtained by well-known gradient descent method.The validation is conducted by comparing the predicted results with the results from data-mining based models as well as measured data from a real typical detached two-floor house. The results show that the developed method has satisfactory performance in predicting the building indoor temperature in 1st and 2nd floors.

Cui, Borui↗

A Modular Optimal Power Flow Method for Integrating New Technologies in Distribution Grids

This work proposes a modular concept to build optimal power flow (OPF) models for distribution networks containing various emerging technologies under diverse ownership structures, to efficiently deal with evolving technology capabilities and information sharing or privacy constraints. This concept will support any typical OPF application (e.g., optimal dispatch of a given asset without violating grid constraints) by coordinating between grid module and technology module without the need to recreate various modeling elements as technology capability changes due to innovation. Moreover, the modularity of the proposed concept enables achieving system level objectives without sharing detailed information on module level objectives and constraints among modules. To achieve this, the proposed work develops a gradient-descent algorithm which builds upon the literature on the state-of-the-art power flow approximation. The proposed concept is demonstrated with two case studies of i) controllable loads and ii) battery energy storage system (BESS) on an actual large-scale distribution grid.

Hanif, Sarmad↗

Do optimization methods in deep learning applications matter?

With advances in deep learning, exponential data growth and increasing model complexity, developing efficient optimization methods are attracting much research attention. Several implementations favor the use of Conjugate Gradient (CG) and Stochastic Gradient Descent (SGD) as being practical and elegant solutions to achieve quick convergence, however, these optimization processes also present many limitations in learning across deep learning applications. Recent research is exploring higher-order optimization functions as better approaches, but these present very complex computational challenges for practical use. Comparing first and higher-order optimization functions, in this paper, our experiments reveal that Levemberg-Marquardt (LM) significantly supersedes optimal convergence but suffers from very large processing time increasing the training complexity of both, classification and reinforcement learning problems. Our experiments compare off-the-shelf optimization functions(CG, SGD, LM and L-BFGS) in standard CIFAR, MNIST, CartPole and FlappyBird experiments.The paper presents arguments on which optimization functions to use and further, which functions would benefit from parallelization efforts to improve pretraining time and learning rate convergence.

Ozyildirim, Buse Melis↗

Analysis of Three Body Decays in Quasi-Real Photoproduction

This thesis presents preliminary measurements of the moments of angular distribution for the K?K+ mesonic final state using a quasi-real, linearly polarised photon. Two of the main points of focus for this analysis were the development of the formalism for photoproduced vector-pseudoscalar decay and the tools by which the analysis was carried out. The formalism described how the moments of angular distribution could be extracted from the angular decay variables, and how they related to resonance decays in terms of partial waves. In extracting the moments, it was found that adapted Markov Chain Monte Carlo (MCMC) methods proved to be more effective in terms of extracting results from the data compared to the sole use of gradient descent based fitting algorithms. These measurements are complementary to other decay channels and production mechanisms, with the global aim of probing the existence of exotic mesons. Data from this analysis was taken by the CLAS collaboration at the Thomas Jefferson National Accelerator Facility (JLab) by scattering from a liquid hydrogen target using a 10.6 GeV electron. This work was done within the MesonEx program at CLAS12 that aims to map the spectrum of mesons, and in doing so, gain a greater understanding of Quantum ChromoDynamics (QCD) and the strong force.

Wishart, Robert↗

Accelerating iterative ptychography with an integrated neural network

Electron ptychography is a powerful and versatile tool for high-resolution and dose-efficient imaging. Iterative reconstruction algorithms are powerful but also computationally expensive due to their relative complexity and the many hyperparameters that must be optimised. Gradient descent-based iterative ptychography is a popular method, but it may converge slowly when reconstructing low spatial frequencies. Here, in this work, we present a method for accelerating a gradient descent-based iterative reconstruction algorithm by training a neural network (NN) that is applied in the reconstruction loop. The NN works in Fourier space and selectively boosts low spatial frequencies, thus enabling faster convergence in a manner similar to accelerated gradient descent algorithms. We discuss the difficulties that arise when incorporating a NN into an iterative reconstruction algorithm and show how they can be overcome with iterative training. We apply our method to simulated and experimental data of gold nanoparticles on amorphous carbon and show that we can significantly speed up ptychographic reconstruction of the nanoparticles.

4DSTEM↗

Stochastic projective splitting

Here, we present a new, stochastic variant of the projective splitting (PS) family of algorithms for inclusion problems involving the sum of any finite number of maximal monotone operators. This new variant uses a stochastic oracle to evaluate one of the operators, which is assumed to be Lipschitz continuous, and (deterministic) resolvents to process the remaining operators. Our proposal is the first version of PS with such stochastic capabilities. We envision the primary application being machine learning (ML) problems, with the method’s stochastic features facilitating “mini-batch” sampling of datasets. Since it uses a monotone operator formulation, the method can handle not only Lipschitz-smooth loss minimization, but also min–max and noncooperative game formulations, with better convergence properties than the gradient descent-ascent methods commonly applied in such settings. The proposed method can handle any number of constraints and nonsmooth regularizers via projection and proximal operators. We prove almost-sure convergence of the iterates to a solution and a convergence rate result for the expected residual, and close with numerical experiments on a distributionally robust sparse logistic regression problem.

97 MATHEMATICS AND COMPUTING↗

Full waveform inversion for time-distance helioseismology

Inferring interior properties of the Sun from photospheric measurements of the seismic wavefield constitutes the helioseismic inverse problem. Deviations in seismic measurements (such as wave travel times) from their fiducial values estimated for a given model of the solar interior imply that the model is inaccurate. Contemporary inversions in local helioseismology assume that properties of the solar interior are linearly related to measured travel-time deviations. It is widely known, however, that this assumption is invalid for sunspots and active regions and is likely for supergranular flows. Here, we introduce nonlinear optimization, executed iteratively, as a means of inverting for the subsurface structure of large-amplitude perturbations. Defining the penalty functional as the L {sub 2} norm of wave travel-time deviations, we compute the total misfit gradient of this functional with respect to the relevant model parameters at each iteration around the corresponding model. The model is successively improved using either steepest descent, conjugate gradient, or the quasi-Newton limited-memory Broyden-Fletcher-Goldfarb-Shanno algorithm. Performing nonlinear iterations requires privileging pixels (such as those in the near field of the scatterer), a practice that is not compliant with the standard assumption of translational invariance. Measurements for these inversions, although similar in principle to those used in time-distance helioseismology, require some retooling. For the sake of simplicity in illustrating the method, we consider a two-dimensional inverse problem with only a sound-speed perturbation.

79 ASTRONOMY AND ASTROPHYSICS↗

Optimization Stability in Excited-State-Specific Variational Monte Carlo

Here, we investigate the issue of optimization stability in variance-based state-specific variational Monte Carlo, discussing the roles of the objective function, the complexity of wave function ansatz, the amount of sampling effort, and the choice of minimization algorithm. Using a small cyanine dye molecule as a test case, we systematically perform minimizations using variants of the linear method as both a standalone algorithm and in a hybrid combination with accelerated descent. We demonstrate that adaptive step control is crucial for maintaining the linear method's stability when optimizing complicated wave functions and that the hybrid method enjoys both greater stability and minimization performance.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Topological Optimization with Big Steps

Using persistent homology to guide optimization has emerged as a novel application of topological data analysis. Existing methods treat persistence calculation as a black box and backpropagate gradients only onto the simplices involved in particular pairs. We show how the cycles and chains used in the persistence calculation can be used to prescribe gradients to larger subsets of the domain. In particular, we show that in a special case, which serves as a building block for general losses, the problem can be solved exactly in linear time. This relies on another contribution of this paper, which eliminates the need to examine a factorial number of permutations of simplices with the same value. Here, we present empirical experiments that show the practical benefits of our algorithm: the number of steps required for the optimization is reduced by an order of magnitude.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Single-stage gradient-based stellarator coil design: Optimization for near-axis quasi-symmetry

Here we present a new coil design paradigm for magnetic confinement in stellarators. Our approach directly optimizes coil shapes and coil currents to produce a vacuum quasi-symmetric magnetic field with a target rotational transform on the magnetic axis. This approach differs from the traditional two-stage approach in which first a magnetic configuration with desirable physics properties is found, and then coils to approximately realize this magnetic configuration are designed. The proposed single-stage approach allows us to find a compromise between confinement and engineering requirements, i.e., find easy-to-build coils with good confinement properties. Using forward and adjoint sensitivities, we derive derivatives of the physical quantities in the objective, which is constrained by a nonlinear periodic differential equation. In two numerical examples, we compare different gradient-based descent algorithms and find that incorporating approximate second-order derivative information through a quasi-Newton method is crucial for convergence. We also explore the optimization landscape in the neighborhood of a minimizer and find many directions in which the objective is mostly flat, indicating ample freedom to find simple and thus easy-to-build coils.

97 MATHEMATICS AND COMPUTING↗

Convergence of variational Monte Carlo simulation and scale-invariant pre-training

We provide theoretical convergence bounds for the variational Monte Carlo (VMC) method as applied to optimize neural network wave functions for the electronic structure problem. Here, we study both the energy minimization phase and the supervised pre-training phase that is commonly used prior to energy minimization. For the energy minimization phase, the standard algorithm is scale-invariant by design, and we provide a proof of convergence for this algorithm without modifications. The pre-training stage typically does not feature such scale-invariance. We propose using a scale-invariant loss for the pretraining phase and demonstrate empirically that it leads to faster pre-training.

97 MATHEMATICS AND COMPUTING↗

Formulation and solution approach for calibrating activity-based travel demand model-system via microsimulation

This study addresses the problem of calibrating utility-maximizing nested logit activity-based travel demand model-systems. After estimation, it is common practice to use aggregate measurements to calibrate the estimated model-system’s parameters prior to their application in transportation planning, policy making, and operations. However, calibration of activity-based model-systems has received much less attention. Existing calibration approaches are myopic heuristics in the sense that they do not consider the fundamental inter-dependencies among choice-models and do not have a systematic way to adjust model parameters. Also, other purely simulation-based approaches do not perform well in large-scale applications. In this study, we focus on utility-maximizing nested logit activity-based model-systems and calibrating aggregate statistics such as activity shares, mode shares, time-dependent & mode-specific OD flows, and time-dependent & mode-specific sensor counts. We formulate the calibration problem as a simulation-based optimization problem and propose a stochastic gradient-based solution procedure to solve it. The solution procedure relies on microsimulation to calculate expectations of the aggregate statistics of interest to the calibration problem. Additionally, we derive approximate analytical expressions for the gradient of the objective function —that are evaluated through microsimulation on mini-batches of the population. The proposed solution procedure is sensitive to the fundamental structure of the activity-based model-system and is non-myopic in considering the dependencies across its model components. The formulated optimization problem is non-convex, highly nonlinear, and potentially has multiple-minima. Lastly, we show —through a real-world application— that the proposed solution procedure outperforms other state-of-the-art purely simulation-based optimization approaches in terms of computational efficiency, stability, and convergence. We also compare various gradient-based solution algorithms to determine the best algorithm to update the parameters. This work has the potential to facilitate wider and easier application of activity-based model-systems.

97 MATHEMATICS AND COMPUTING↗

Sentiment Analysis based Error Detection for Large-Scale Systems

Today's large-scale systems such as High Performance Computing (HPC) Systems are designed/utilized towards exascale computing, inevitably decreasing its reliability due to the increasing design complexity. HPC systems conduct extensive logging of their execution behaviour. In this paper, we leverage the inherent meaning behind the log messages and propose a novel sentiment analysis-based approach for the error detection in large-scale systems, by automatically mining the sentiments in the log messages. Our contributions are four-fold. (1) We develop a machine learning (ML) based approach to automatically build a sentiment lexicon, based on the system log message templates. (2) Using the sentiment lexicon, we develop an algorithm to detect system errors. (3) We develop an algorithm to identify the nodes and components with erroneous behaviors, based on sentiment polarity scores. (4) We evaluate our solution vs. other state-of-the-art machine/deep learning algorithms based on three representative supercomputers' system logs. Experiments show that our error detection algorithm can identify error messages with an average MCC score and f -score of 91% and 96% respectively, while state of the art ML/deep learning model (LSTM) obtains only 67% and 84%. To the best of our knowledge, this is the first work leveraging the sentiments embedded in log entries of large-scale systems for system health analysis.

error detection↗

Residential Demand Side Aggregation of Privacy-Conscious Consumers

The increasing adoption of smart meters has led to growing concerns regarding privacy risks stemming from the high resolution measurements. This has given rise to privacy protection techniques that physically alter the consumer's energy load profile, masking private information by using localised devices, e.g. batteries or flexible loads. Meanwhile, there has also been increasing interest in aggregating the distributed energy resources (DERs) of residential consumers to provide services to the grid. In this paper, we propose an online distributed algorithm to aggregate the DERs of privacy-conscious consumers to provide services to the grid, whilst preserving their privacy. Results show that the optimisation solution from the distributed method converges to one close to the optimum computed using an ideal centralised solution method, balancing between grid service provision, consumer preferences and privacy protection. More importantly, the distributed method preserves consumer privacy, and does not require high-bandwidth two-way communications infrastructure.

ancillary services↗

LATTE: Los Alamos TravelTime package based on Eikonal equation

This Fortran code focuses on traveltime computation and tomography based on eikonal equation. Specifically, the package provides three major functionalities: (1) forward modeling of traveltime from single-point or ensemble source based on factorized eikonal equation, (2) adjoint-state first-arrival traveltime tomography based on picked first arrival traveltime using steepest descent, conjugate gradient, or limited-memory BFGS inversion scheme, and (3) adjoint-state joint transmission-reflection tomography based on picked first-arrival and reflection traveltimes. The package applies to forward modeling and tomography based on traveltime in 2D and 3D isotropic regular-grid models. We name this package LATTE – Los Alamos TravelTime package based on Eikonal equation. * The code is for accompanying a journal paper under preparation. The paper will be submitted via LA-UR separately later.

Gao, Kai↗