Search NASA⌕ Search

SEARCH · Search NASA

Results for “stochastic gradient methods”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 181 records · Page 10

Finding MIDDLE Ground: Scalable and Secure Distributed Learning

Edge computing methods allow devices to efficiently train a high-performing, robust, and personalized model for predictive tasks. However, these methods succumb to privacy and scalability concerns such as adversarial data recovery and expensive model communication. Furthermore, edge computing methods unrealistically assume that all devices train an identical model. In practice, edge devices have varying computational and memory constraints which may not allow certain devices to have the space or speed to train a specific model. To overcome these issues, we propose MIDDLE: a model independent distributed learning algorithm which allows heterogeneous edge devices to assist each other’s training while communicating only non-sensitive information. MIDDLE unlocks the ability for edge devices, regardless of computational or memory constraints, to assist each other even with completely different model architectures. Furthermore, MIDDLE does not require model or gradient communication which greatly reduces communication size and time. We prove that MIDDLE attains the optimal convergence rate O(1/sqrt(TM)) of stochastic gradient descent for convex and non-convex smooth optimization (for total iterations T and batch size M). Finally, our experimental results demonstrate that MIDDLE (even in non-IID data settings) attains robust and high-performing models without model or gradient communication.

Bornstein, Marc I.↗

A parallel discrete dislocation dynamics/kinetic Monte Carlo method to study non-conservative plastic processes

Non-conservative processes play a fundamental role in plasticity and are behind important macroscopic phenomena such as creep, dynamic strain aging, loop raft formation, etc. In the most general case, vacancy-induced dislocation climb is the operating unit mechanism. While dislocation/vacancy interactions have been modeled in the literature using a variety of methods, the approaches developed rely on continuum descriptions of both the vacancy population and its fluxes. However, there are numerous situations in physics where point defect populations display heterogeneous concentrations and/or non-smooth kinetics. Here, a kinetic Monte Carlo (kMC) approach for modeling vacancy transport in response to arbitrary stress fields is used. Vacancies are treated as point particles and are coupled to the dislocation substructure representing a deformed material via an advection term defined by the local stress gradients. The stress fields and the dislocation substructure are evolved using a discrete dislocation dynamics (DDD) module. To extend the coupled model to the treatment of large systems, we have implemented it in the massively-parallel DDD code ParaDiS. To avoid numerical incompatibilities associated with merging deterministic (DDD) and stochastic (kMC) integration algorithms, we cast the entire elasto-plastic-diffusive problem within a single stochastic framework, taking advantage of a parallel kMC algorithm to evolve the system as a single event-driven process. The large-scale implementation enables the study of the evolution of a variety of dislocation-defect scenarios governed by non-conservative transport kinetics. After carrying out an exhaustive numerical and computational analysis of our parallel algorithm, we show results that emphasize situations where inhomogeneous vacancy dynamics are of relevance, and compare discrete kinetics to continuum solutions for several cases.

36 MATERIALS SCIENCE↗

Selective capture and recovery of uranium oxide colloids from aqueous soil suspensions using high gradient magnetic filtration

High Gradient Magnetic Filtration (HGMF) is a promising method for the selective capture and recovery of uranium oxide from surface soils. To date, however, magnetic filtration of uranium oxide has only been demonstrated at a proof-of-principle scale using relatively small filters (<5 cm 3 ) at low flowrates (<60 mL/min). Here, to explore the efficacy of magnetic filtration of uranium oxide at a larger scale, a newly designed HGMF apparatus that is more than an order of magnitude larger than our earlier filters (106 cm 3 ) was designed, fabricated, and tested at relatively high flowrates. Filtration experiments were performed using aqueous uranium oxide particle suspensions with Arizona Road Dust (ARD) as a soil simulant. At a flowrate of 125 mL/min, the apparatus’ uranium capture rate was exceptionally high (96 %), but selectivity was poor due to the high rate of capture for diamagnetic soil constituents (e.g., 77 % for silicon). All particles were captured at a lower rate when the flowrate was increased to 250 mL/min, but uranium selectivity was significantly increased due to the more substantial reduction in diamagnetic particle capture (i.e., capture rate of 77 % and 15 % for uranium and silicon, respectively). When backwashing the apparatus at the same flowrates used during filtration experiments, the rate of uranium recovery tended to be fairly low. Nevertheless, higher flowrates (1 L/min) and sonication were both shown to be highly effective methods of increasing uranium recovery. Magnetic field simulations were also performed to investigate potential optimizations to the design of the apparatus. These simulations showed that the intensity of the applied magnetic field could be increased by increasing the thickness of the steel magnetic housing. Additionally, stochastic trajectory simulations were performed to investigate the potential mechanisms of particle capture.

HGMF↗

An Online Plug-and-Play Algorithm for Regularized Image Reconstruction

Plug-and-play priors (PnP) is a powerful framework for regularizing imaging inverse problems by using advanced denoisers within an iterative algorithm. Recent experimental evidence suggests that PnP algorithms achieve state-of-the-art performance in a range of imaging applications. Here, we introduce a new online PnP algorithm based on the proximal gradient method (PGM). The proposed algorithm uses only a subset of measurements at every iteration, which makes it scalable to very large datasets. We present a new theoretical convergence analysis, for both batch and online variants of PnP-PGM, for denoisers that do not necessarily correspond to proximal operators. We also present simulations illustrating the applicability of the algorithm to image reconstruction in diffraction tomography. Finally, the results in this paper have the potential to expand the applicability of the PnP framework to very large datasets.

97 MATHEMATICS AND COMPUTING↗

Discrete stochastic model of point defect-dislocation interaction for simulating dislocation climb

Dislocation climb is an important high temperature process in metals plasticity, responsible for the phenomena such as creep, swelling, or hardening. Climb is defined by the ability of dislocations to leave their original glide plane by interacting with point defects. As such, dislocation climb is controlled by point defect diffusion/absorption/emission, all of which involve thermal activation. The existing thermodynamically consistent models for climb are generally formulated in a continuum framework, through the definition of effective defect fluxes and climb propensities in response to thermodynamic driving forces. However, the point-wise discrete nature of vacancies (and/or self-interstitials) confers a highly discrete nature to the climb dynamics, which is also strongly affected by elastic forces. The combination of discreteness, thermal activation, and elasticity makes this process too challenging for direct atomistic methods such as molecular dynamics. Here we develop a kinetic Monte Carlo model that captures vacancy generation and transport kinetics acting in conjuction with the evolving elastic fields provided by discrete dislocation dynamics simulations. The two models are coupled via the applied stresses and stress gradients generated by dislocation structures at vacancy locations. Our simulations reveal two surprising results. First that climb is dominated by vacancy emission even when the background vacancy concentration is much higher than the equilibrium one. And, second, that climb velocities might be much faster than otherwise believed when one uses the classical theories of climb. These effects are due to the locality of vacancy-dislocation processes, which are not captured in classical treatments that assume smooth vacancy fluxes and homogeneous concentrations. We apply the method to study elementary climb processes in body-centered cubic iron and furnish climb mobility functions to be used in parametric dislocation dynamics and/or crystal plasticity simulations. Here, we apply the technique to study non-conservative plastic bypass of spherical precipitates by edge dislocations and point out the differences between our discrete approach and existing continuum formulations.

36 MATERIALS SCIENCE↗

Nonlocal suppression of Biermann battery magnetic-field generation for arbitrary atomic numbers and magnetization

The Biermann battery term of magnetohydrodynamics (MHD) generates a magnetic field where electron density gradients and electron temperature gradients are perpendicular to one another. Kinetic simulations and experiments have shown that the rate of magnetic-field generation is lower than Biermann when the electron mean free path becomes comparable to or greater than the temperature gradient scale length, known as the nonlocal regime. We investigate the nonlocal suppression of the Biermann term using simplified Fokker–Planck simulations covering a wide range of parameters. We provide the first fit for nonlocal Biermann suppression that has physically accurate behavior for small and large values of a suitable nonlocality parameter, valid for an arbitrary atomic number, and that includes the effect of magnetization on nonlocality. Lastly, the fit is intended to provide an approximate method to account for reduced magnetic-field generation in MHD codes and theory.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Temperature Uncertainty Modeling with Proxy Structural Data as Geostatistical Constraints for Well Siting: An Example Applied to Granite Springs Valley, NV, USA

Utilizing existing temperature and structural information around Granite Springs Valley, Nevada, we build 3D stochastic temperature models with the aim of evaluating the 3D uncertainty of temperature and choosing between candidate exploration well locations . The data used to support the modeling are measured temperatures and structural proxies from 3D geologic modeling, the latter considered "secondary" data. Two stochastic geostatistical techniques are explored for incorporating the structural proxies: cosimulation and local varying mean. With both the cosimulation and local varying mean methods, many equally likely temperature models (i.e., realizations) are produced, from which temperature probability profiles are calculated at candidate well locations. To aid in choosing between the candidate locations, two quantities summarize the temperature probabilities: Vprior and entropy. Vprior quantifies the likelihood for economic temperatures at each candidate location, whereas entropy identifies where new information has the most potential to reduce uncertainty. In general, the cosimulation realizations have smoother spatial structure, and extrapolate high temperatures at candidate locations that are located along the direction of the longest spatial correlation, which are down dip from existing temperature logs. The smooth realizations result in tight temperature probability profiles that are easier to interpret, but they have unrealistic temperature reversals in some locations because the cosimulation technique does not enforce a conductive geothermal gradient as a baseline (i.e., linearly increasing temperature with depth). The local varying mean results produce realizations with more realistic geothermal gradients, with temperatures increasing downward since a depth-temperature relationship is included. However, because they have much noisier spatial nature compared to cosimulation, it is harder to interpret the temperature probability profiles. The different local varying mean results allow the geologist to determine which proxy (e.g., dilation versus distance to fault termination) should be used given the specific geothermal system. In general, Vprior from local varying mean results identify locations that are close to high values for the structural proxies: areas with highe r probabilities for higher temperatures. The entropy results identify where uncertainty is greatest and therefore new drilling information could be most useful. Though these techniques provide useful information, even when applied to areas of sparse data, our comp arison of these two techniques demonstrates the need for new geothermal geostatistics techniques that combine the advantages of these two methods and that are tailored to the spatial uncertainty issues inherent in geothermal exploration.

3D temperature modeling↗

Criticality analysis of nuclear binding energy neural networks

Machine learning methods, in particular deep learning methods such as artificial neural networks (ANNs) with many layers, have become widespread and useful tools in nuclear physics. However, these ANNs are typically treated as ‘black boxes’, with their architecture (width, depth, and weight/bias initialization) and the training algorithm and parameters chosen empirically by optimizing learning based on limited exploration. We test a non-empirical approach to understanding and optimizing nuclear physics ANNs by adapting a criticality analysis based on renormalization group flows in terms of the hyperparameters for weight/bias initialization, training rates, and the ratio of depth to width. This treatment utilizes the statistical properties of neural network initialization to find a generating functional for network outputs at any layer, allowing for a path integral formulation of the ANN outputs as a Euclidean statistical field theory. We use a prototypical example to test the applicability of this approach: a simple ANN for nuclear binding energies. We find that with training using a stochastic gradient descent optimizer, the predicted criticality behavior is realized, and optimal performance is found with critical tuning. However, the use of an adaptive learning algorithm leads to somewhat superior results without concern for tuning and thus obscures the analysis. Nevertheless, the criticality analysis offers a way to look within the black box of ANNs, which is a first step towards potential improvements in network performance beyond using adaptive optimizers.

artificial neural network↗

Super Resolving Unrolled Neural Networks for Remote Sensing

In remote sensing systems, the capabilities of the system are constrained by the complex interactions between size, weight, and power (SWAP) of potential designs. In electro-optical (EO) systems, examples of these critical parameters include the system’s sensitivity and resolution. Those parameters can be increased by ever larger optical apertures and focal planes but at the cost of more SWAP. Multi-image super resolution (MISR) techniques allow resolution to be enhanced via computation rather than more sophisticated optical hardware. These algorithms combine multiple images together into a single, higher resolution image, trading temporal resolution and computation for spatial resolution. Fielded MISR techniques, such as Drizzle, can require several hundred images to create a single super resolved image, implying reduced temporal resolution, increased data acquisition load, and limiting mission applications. Iterative techniques, such as model-based image reconstruction and compressive sensing, have been shown to create super resolved images using fewer images than Drizzle. They do this by posing an optimization problem that balances accuracy between a highly accurate physical model and an image model. In the case of super resolution, the physical model is defined by the relation between low resolution input images and the desired high resolution output image. The image model encodes some assumptions about the super resolved image. These assumptions are meant to suppress reconstruction artifacts that arise due to deterministic physical model error, stochastic measurement noise, and potential undersampling. In practice, the performance of iterative methods are limited by imaging models compatible with optimization. Deep learning-based methods can effectively learn image models of arbitrary complexity, but lack the theoretical explainability and robustness of iterative techniques. Consensus equilibrium (CE) generalizes the iterative techniques beyond optimization, enabling blackbox algorithms such as traditional and neural image denoisers to be used as the image model. CE-based approaches retain much of the explainability and robustness of iterative techniques while allowing the expressiveness of machine learning image models to be used. Additionally, by unrolling iterations of CE with an embedded image denoiser, the image denoiser can be further trained and specialized to the specific application with potentially higher quality reconstructions. Under this project, we demonstrated the feasibility of training an unrolled neural network based upon CE. While we didn’t train one, we showed that the CE process is differentiable and its gradient can be tractably computed. We also explored the usage of a variants of CE akin to generative neural works. Most importantly, we applied the CE framework to a number of problems including non-blind deconvolution, upsampling, single-image super resolution, MISR, event-based sensing, and saturated deconvolution. Our MISR prototype creates high quality reconstructions with an order of magnitude fewer images than previous approaches and, critically, produces these reconstructions fast enough for practical usage.

47 OTHER INSTRUMENTATION↗

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↗

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↗

A data science approach for analysis and reconstruction of spinodal-like composition fields in irradiated FeCrAl alloys

A statistical method for the analysis of continuously distributed data representative of composition fluctuations in irradiated FeCrAl alloys acquired using Energy Dispersive X-ray Spectroscopy (EDS) method is presented. Using probability distribution functions, direct and cross-covariances between the elemental compositions, the effects of alloy composition and irradiation dose were investigated on the spatial distribution and length scale of composition fluctuations at the nanoscale. We have observed that, for neutron-irradiated FeCrAl alloys, the distribution of Fe and Cr followed a left-skewed and right-skewed distribution, respectively for all (average) alloy compositions and irradiation doses. The analysis also revealed enhanced spatial gradients in the elemental compositions at higher irradiation dose. Direct and cross-covariance estimates of the experimental data were also utilized for reconstruction of composition data through fitting it to a parametric form of the covariance functions. Linear Model of Coregionalization was used to determine the parameters of the covariance functions. Subsequently, a spectral method was utilized for simulating a realization of the alloy compositions. Close correspondence was observed between the experimental and the reconstructed data which was analyzed using probability distribution functions and covariance functions. Composition space of the experimental and reconstructed data and dislocation velocities as a function of applied stress and line directions over the entire composition maps were also examined.

36 MATERIALS SCIENCE↗

Scale setting the Möbius domain wall fermion on gradient-flowed HISQ action using the omega baryon mass and the gradient-flow scales 𝑡 0 and 𝑤 0

We report on a subpercent scale determination using the omega baryon mass and gradient-flow methods. The calculations are performed on 22 ensembles of 𝑁 𝑓 =2 +1 +1 highly improved, rooted staggered sea-quark configurations generated by the MILC and CalLat Collaborations. The valence quark action used is Möbius domain wall fermions solved on these configurations after a gradient-flow smearing is applied with a flowtime of 𝑡 gf = 1 in lattice units. The ensembles span four lattice spacings in the range 0.06 ≲ 𝑎 ≲0.15 fm, six pion masses in the range 130 ≲ 𝑚 𝜋 ≲ 400 MeV and multiple lattice volumes. On each ensemble, the gradient-flow scales 𝑡 0 /𝑎 2 and 𝑤 0 /𝑎 and the omega baryon mass 𝑎⁢𝑚 Ω are computed. The dimensionless product of these quantities is then extrapolated to the continuum and infinite volume limits and interpolated to the physical light, strange and charm quark mass point in the isospin limit, resulting in the determination of $\sqrt{t}_0$ = 0.1422⁢(14) fm and 𝑤 0 = 0.1709⁢(11) fm with all sources of statistical and systematic uncertainty accounted for. The dominant uncertainty in both results is the stochastic uncertainty, though for $\sqrt{t}_0$ there are comparable continuum extrapolation uncertainties. For 𝑤 0 , there is a clear path for a few-per-mille uncertainty just through improved stochastic precision, as recently obtained by the Budapest-Marseille-Wuppertal Collaboration.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Simulation and Analysis on Reactor Pressure Vessel (RPV) subjected to Pressurized Thermal Shock (PTS) under SBLOCA scenario by using Cardinal to support the fracture mechanics analyses

The structural components that comprise nuclear reactors and their supporting structures are subjected to harsh operating environments that can challenge their integrity, especially after exposure for extended durations or under accident condition. As one of the most significant components of a Reactor, the Reactor Pressure Vessel (RPV) is exposed to an aggressive environment during the operation time (e.g. more than 40 years). Ageing degradation mechanisms (e.g. thermos-fatigue) could grow initial defects up to a critical size, increasing the susceptibility to failure in the RPV. The conventional methods are mostly based on simple crack and structure geometries. Very limited studies consider the real conditions of the RPV subjected to a thermal shock due to a Loss of Coolant Accident (LOCA). During a LOCA event, the most severe conditions take place when the emergency core cooling (ECC) water is injected inside the cold legs filled initially with hotter water and/or steam. The rapid cooling of the down-comer and the internal RPV surface followed probably by re-pressurization of the RPV causes large temperature gradients and variation of pressure which induces thermal-mechanical stresses. In order to develop the model for integrity assessment of a reactor pressure vessel (RPV) subjected to pressurized thermal shock (PTS), a multi-physics simulation, which includes the thermo-hydraulic, thermo-mechanical and fracture mechanics analyses is necessary. The multi-physics simulations are performed using Cardinal, a wrapping of the GPU-oriented spectral element Computational Fluid Dynamics (CFD) code NekRS and other multi-physics sub-modules within the MOOSE framework. Cardinal now fully supports MOOSE stochastic perturbations of NekRS models with varying boundary conditions, initial conditions, material properties, and any other quantity which is defined by a kernel (such as coefficients in a momentum source model). The implementation is designed in a flexible manner so that scalar values are sent from MOOSE into a user scratch space in NekRS, which can then be applied for any purpose within the NekRS case files (both on the host and device). When modeling PTS, several factors can impact the results significantly. In this report, the impacts of the geometry of the model, Reynolds number and buoyancy effect are investigated. Two geometry, i.e., a simplified model and a realistic RPV model, with both laminar and turbulent flow condition are adopted for the PTS simulation with and without buoyancy effect. The purpose of the investigation is to understand the impact of these factors on the prediction of temperature history of RPV. The accurate prediction on the temperature evolution, which will be exported to Grizzly code for further analyses on the progression of aging mechanisms and their effects on the integrity of RPV structures, is very crucial. Based on the understanding of these factors, a more sophisticated model is built to analysis the PTS under SBLOCA scenario. A literature survey is conducted to pick the SBLOCA scenario for the multi-physics simulation. The analysis helps to explain the form and the transformation of the cold plum when the ECC is activated under SBLOCA. This model can be can be applied to study the PTS effect for different RPV configurations. The results can help to assess structural component degradation for advanced reactors.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Ab initio molecular dynamics on quantum computers

Ab initio molecular dynamics (AIMD) is a valuable technique for studying molecules and materials at finite temperatures where the nuclei evolve on potential energy surfaces obtained from accurate electronic structure calculations. In this work, we present an approach to running AIMD simulations on noisy intermediate-scale quantum (NISQ)-era quantum computers. The electronic energies are calculated on a quantum computer using the variational quantum eigensolver (VQE) method. Algorithms for computation of analytical gradients entirely on a quantum computer require quantum fault-tolerant hardware, which is beyond NISQ-era. Therefore, we compute the energy gradients numerically using finite differences, the Hellmann-Feynman theorem, and a correlated sampling technique. This method only requires additional classical calculations of electron integrals for each degree of freedom without any additional computations on a quantum computer beyond the initial VQE run. As a proof of concept, AIMD simulations are demonstrated for the H-2 molecule on IBM quantum devices. In addition, we demonstrate the validity of the method for larger molecules using full configuration interaction wave functions. As quantum hardware and noise mitigation techniques continue to improve, the method can be utilized for studying larger molecular systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Differentiable stochastic halo occupation distribution

ABSTRACT In this work, we demonstrate how differentiable stochastic sampling techniques developed in the context of deep reinforcement learning can be used to perform efficient parameter inference over stochastic, simulation-based, forward models. As a particular example, we focus on the problem of estimating parameters of halo occupation distribution (HOD) models that are used to connect galaxies with their dark matter haloes. Using a combination of continuous relaxation and gradient re-parametrization techniques, we can obtain well-defined gradients with respect to HOD parameters through discrete galaxy catalogue realizations. Having access to these gradients allows us to leverage efficient sampling schemes, such as Hamiltonian Monte Carlo, and greatly speed up parameter inference. We demonstrate our technique on a mock galaxy catalogue generated from the Bolshoi simulation using a standard HOD model and find near-identical posteriors as standard Markov chain Monte Carlo techniques with an increase of ∼8× in convergence efficiency. Our differentiable HOD model also has broad applications in full forward model approaches to cosmic structure and cosmological analysis.

79 ASTRONOMY AND ASTROPHYSICS↗

A data-driven sensor placement approach for detecting voltage violations in distribution systems

Stochastic fluctuations in power injections from distributed energy resources (DERs) combined with load variability can cause constraint violations (e.g., exceeded voltage limits) in electric distribution systems. To monitor grid operations, sensors are placed to measure important quantities such as the voltage magnitudes. Here, in this paper, we consider a sensor placement problem which seeks to identify locations for installing sensors that can capture all possible violations of voltage magnitude limits. We formulate a bilevel optimization problem that minimizes the number of sensors and avoids false sensor alarms in the upper level while ensuring detection of any voltage violations in the lower level. This problem is challenging due to the nonlinearity of the power flow equations and the presence of binary variables. Accordingly, we employ recently developed conservative linear approximations of the power flow equations that overestimate or underestimate the voltage magnitudes. By replacing the nonlinear power flow equations with conservative linear approximations, we can ensure that the resulting sensor locations and thresholds are sufficient to identify any constraint violations. Additionally, we apply various problem reformulations to significantly improve computational tractability while simultaneously ensuring an appropriate placement of sensors. Lastly, we improve the quality of the results via an approximate gradient descent method that adjusts the sensor thresholds. We demonstrate the effectiveness of our proposed method for several test cases, including a system with multiple switching configurations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Uncertainty Quantification using Deep Ensembles for Decision Making in Cyber-Physical-Human Systems

In this paper and its companion, Differential Equation Approximation Using Gradient-Boosted Quantile Regression, Robison et al., we examine an approach to quantifying model uncertainty with the aim of increasing the trustworthiness of computational models in human-machine interactions. In Differential Equation Approximation Using Gradient-Boosted Quantile Regression, we focus on gradient-boosted decision trees, while in this one, we give more details about deep ensembles. Uncertainty quantification is crucial for building trustworthy autonomous decision-making agents in human-machine teams. There are two types of uncertainties: aleatoric and epistemic. The former is related to the inherent stochasticity (noise) of the process, whereas the latter is associated with the lack of knowledge or representation capability of models, such as neural networks. By lack of knowledge, we mean the model’s inability to accurately predict outputs for all possible inputs. The aleatory uncertainty can be estimated fairly easily with, for example, filters, whereas epistemic uncertainty is challenging to compute. This paper uses deep ensembles to quantify both aleatory and epistemic uncertainty. It can act as an uncertainty-aware surrogate transition model for decision-making frameworks. "Uncertainty-aware" means that the surrogate transition model should make predictions along with confidence in those predictions. In the context of decision-making, the transition models are ordinary differential equations (ODEs). Since ODEs can be simulated to make one-step or multi-step predictions, a good surrogate model for them should perform reasonably well in both modes. In a multi-step approach, the trajectory sampling method TS∞ was used to propagate uncertainty over multiple steps. The cartpole dynamical system was selected to demonstrate the ability of deep ensembles as good surrogate transition models for decision-making frameworks. The deep ensembles modeled the dynamics of cartpole ODEs and made uncertainty-aware predictions in single-step and multi-step transition modes.

CPH systems↗