Advancements on multi-fidelity random Fourier neural networks: application to hurricane modeling for offshore wind energy
Explore the source record for details and available documents.
Davis, Owen Nicholas [Sandia National Laboratories↗
SEARCH · Engineering Papers
Results for “random networks”
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.
Synaptic Sampling Networks with True Random Number Generation
Explore the source record for details and available documents.
Smith, John Darby [Sandia National Laboratories (S↗
Random interactions in higher order neural networks
Recurrent networks of polynomial threshold elements with random symmetric interactions are studied. Precise asymptotic estimates are derived for the expected number of fixed points as a function of the margin of stability. In particular, it is shown that there is a critical range of margins of stability (depending on the degree of polynomial interaction) such that the expected number of fixed points with margins below the critical range grows exponentially with the number of nodes in the network, while the expected number of fixed points with margins above the critical range decreases exponentially with the number of nodes in the network. The random energy model is also briefly examined and links with higher order neural networks and higher order spin glass models made explicit.
Baldi, Pierre↗
In situ Parallel Training of Analog Neural Network Using Electrochemical Random-Access Memory
In-memory computing based on non-volatile resistive memory can significantly improve the energy efficiency of artificial neural networks. However, accurate in situ training has been challenging due to the nonlinear and stochastic switching of the resistive memory elements. One promising analog memory is the electrochemical random-access memory (ECRAM), also known as the redox transistor. Its low write currents and linear switching properties across hundreds of analog states enable accurate and massively parallel updates of a full crossbar array, which yield rapid and energy-efficient training. While simulations predict that ECRAM based neural networks achieve high training accuracy at significantly higher energy efficiency than digital implementations, these predictions have not been experimentally achieved. In this work, we train a 3 × 3 array of ECRAM devices that learns to discriminate several elementary logic gates (AND, OR, NAND). We record the evolution of the network’s synaptic weights during parallel in situ (on-line) training, with outer product updates. Due to linear and reproducible device switching characteristics, our crossbar simulations not only accurately simulate the epochs to convergence, but also quantitatively capture the evolution of weights in individual devices. The implementation of the first in situ parallel training together with strong agreement with simulation results provides a significant advance toward developing ECRAM into larger crossbar arrays for artificial neural network accelerators, which could enable orders of magnitude improvements in energy efficiency of deep neural networks.
97 MATHEMATICS AND COMPUTING↗
Global River Topology (GRIT): A Bifurcating River Hydrography
Existing global river networks underpin a wide range of hydrological applications but do not represent channels with divergent river flows (bifurcations, multi‐threaded channels, canals), as these features defy the convergent flow assumption that elevation‐derived networks (e.g., HydroSHEDS, MERIT Hydro) are based on. Yet, bifurcations are important features of the global river drainage system, especially on large floodplains and river deltas, and are also often found in densely populated regions. Here we developed the first raster and vector‐based Global RIver Topology that not only represents the tributaries of the global drainage network but also the distributaries, including multi‐threaded rivers, canals and deltas. We achieve this by merging a 30 m Landsat‐based river mask with elevation‐generated streams to ensure a homogeneous drainage density outside of the river mask for rivers narrower than approximately 30 m. Crucially, we employ the new 30 m digital terrain model, FABDEM, based on TanDEM‐X, which shows greater accuracy over the traditionally used SRTM derivatives. After vectorization and pruning, directionality is assigned by a series of elevation, flow angle and continuity approaches. The new global network and its attributes are validated using gauging stations, comparison with existing networks, and randomized manual checks. The new network represents 19.6 million km of streams and rivers with drainage areas greater than 50 km 2 and includes 67,495 bifurcations. With the advent of hyper‐resolution modeling and artificial intelligence, GRIT is expected to greatly improve the accuracy of many river‐based applications such as flood forecasting, water availability and quality simulations, or riverine habitat mapping.
54 ENVIRONMENTAL SCIENCES↗
Diffusion Codes: Self-Correction from Small(er)-Set Expansion with Tunable Non-locality
Optimal constructions of classical LDPC codes can be obtained by choosing the Tanner graph uniformly at random among biregular graphs. We introduce a class of codes that we call ``diffusion codes'', defined by placing each edge connecting bits and checks on some graph, and acting on that graph with a random SWAP network. By tuning the depth of the SWAP network, we can tune a tradeoff between the amount of randomness -- and hence the optimality of code parameters -- and locality with respect to the underlying graph. For diffusion codes defined on the cycle graph, if the SWAP network has depth $\sim Tn$ with $T> n^{2β}$ for arbitrary $β>0$, then we prove that almost surely the Tanner graph is a lossless ``smaller set'' vertex expander for small sets up size $δ\sim \sqrt T \sim n^β$, with bounded bit and check degree. At the same time, the geometric size of the largest stabilizer is bounded by $\sqrt T$ in graph distance. We argue, based on physical intuition, that this result should hold more generally on arbitrary graphs. By taking hypergraph products of these classical codes we obtain quantum LDPC codes defined on the torus with smaller-set boundary and co-boundary expansion and the same expansion/locality tradeoffs as for the classical codes. These codes are self-correcting and admit single-shot decoding, while having the geometric size of the stabilizer growing as an arbitrarily small power law. Our proof technique establishes mixing of a random SWAP network on small subsystems at times scaling with only the subsystem size, which may be of independent interest.
Combinatorics (math.CO)↗
Random vs. Combinatorial Methods for Discrete Event Simulation of a Grid Computer Network
This study compared random and t-way combinatorial inputs of a network simulator, to determine if these two approaches produce significantly different deadlock detection for varying network configurations. Modeling deadlock detection is important for analyzing configuration changes that could inadvertently degrade network operations, or to determine modifications that could be made by attackers to deliberately induce deadlock. Discrete event simulation of a network may be conducted using random generation, of inputs. In this study, we compare random with combinatorial generation of inputs. Combinatorial (or t-way) testing requires every combination of any t parameter values to be covered by at least one test. Combinatorial methods can be highly effective because empirical data suggest that nearly all failures involve the interaction of a small number of parameters (1 to 6). Thus, for example, if all deadlocks involve at most 5-way interactions between n parameters, then exhaustive testing of all n-way interactions adds no additional information that would not be obtained by testing all 5-way interactions. While the maximum degree of interaction between parameters involved in the deadlocks clearly cannot be known in advance, covering all t-way interactions may be more efficient than using random generation of inputs. In this study we tested this hypothesis for t = 2, 3, and 4 for deadlock detection in a network simulation. Achieving the same degree of coverage provided by 4-way tests would have required approximately 3.2 times as many random tests; thus combinatorial methods were more efficient for detecting deadlocks involving a higher degree of interactions. The paper reviews explanations for these results and implications for modeling and simulation.
Kuhn, D. Richard↗
Holographic tensor networks with bulk gauge symmetries
Abstract Tensor networks are useful toy models for understanding the structure of entanglement in holographic states and reconstruction of bulk operators within the entanglement wedge. They are, however, constrained to only prepare so-called “fixed-area states” with flat entanglement spectra, limiting their utility in understanding general features of holographic entanglement. Here, we overcome this limitation by constructing a variant of random tensor networks that enjoys bulk gauge symmetries. Our model includes a gauge theory on a general graph, whose gauge-invariant states are fed into a random tensor network. We show that the model satisfies the quantum-corrected Ryu-Takayanagi formula with a nontrivial area operator living in the center of a gauge-invariant algebra. We also demonstrate nontrivial,n-dependent contributions to the Rényi entropy and Rényi mutual information from this area operator, a feature shared by general holographic states.
Physics↗
Effective entropy of quantum fields coupled with gravity
Entanglement entropy, or von Neumann entropy, quantifies the amount of uncertainty of a quantum state. For quantum fields in curved space, entanglement entropy of the quantum field theory degrees of freedom is well-defined for a fixed background geometry. In this paper, we propose a generalization of the quantum field theory entanglement entropy by including dynamical gravity. The generalized quantity named effective entropy, and its Renyi entropy generalizations, are defined by analytic continuation of a replica calculation. The replicated theory is defined as a gravitational path integral with multiple copies of the original boundary conditions, with a co-dimension-2 brane at the boundary of region we are studying. We discuss different approaches to define the region in a gauge invariant way, and show that the effective entropy satisfies the quantum extremal surface formula. When the quantum fields carry a significant amount of entanglement, the quantum extremal surface can have a topology transition, after which an entanglement island region appears. Our result generalizes the Hubeny-Rangamani-Takayanagi formula of holographic entropy (with quantum corrections) to general geometries without asymptotic AdS boundary, and provides a more solid framework for addressing problems such as the Page curve of evaporating black holes in asymptotic flat spacetime. We apply the formula to two example systems, a closed two-dimensional universe and a four-dimensional maximally extended Schwarzchild black hole. We discuss the analog of the effective entropy in random tensor network models, which provides more concrete understanding of quantum information properties in general dynamical geometries. We show that, in absence of a large boundary like in AdS space case, it is essential to introduce ancilla that couples to the original system, in order for correctly characterizing quantum states and correlation functions in the random tensor network. Using the superdensity operator formalism, we study the system with ancilla and show how quantum information in the entanglement island can be reconstructed in a state-dependent and observer-dependent map. We study the closed universe (without spatial boundary) case and discuss how it is related to open universe.
79 ASTRONOMY AND ASTROPHYSICS↗
Superconducting neural networks with disordered Josephson junction array synaptic networks and leaky integrate-and-fire loop neurons
Fully coupled randomly disordered recurrent superconducting networks with additional open-ended channels for inputs and outputs are considered the basis to introduce a new architecture to neuromorphic computing in this work. Various building blocks of such a network are designed around disordered array synaptic networks using superconducting devices and circuits as an example, while emphasizing that a similar architectural approach may be compatible with several other materials and devices. A multiply coupled (interconnected) disordered array of superconducting loops containing Josephson junctions [equivalent to superconducting quantum interference devices (SQUIDs)] forms the aforementioned collective synaptic network that forms a fully recurrent network together with compatible neuron-like elements and feedback loops, enabling unsupervised learning. This approach aims to take advantage of superior power efficiency, propagation speed, and synchronizability of a small world or a random network over an ordered/regular network. Additionally, it offers a significant factor of increase in scalability. Here, a compatible leaky integrate-and-fire neuron made of superconducting loops with Josephson junctions is presented, along with circuit components for feedback loops as needed to complete the recurrent network. Several of these individual disordered array neural networks can further be coupled together in a similarly disordered way to form a hierarchical architecture of recurrent neural networks that is often suggested as similar to a biological brain.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Genetic Algorithm for Optimization of Neural Networks for Bayesian Inference of Model Uncertainty
The objective of this work was to develop a genetic optimization algorithm that can design a neural network capable of producing uncertainty estimates along with predictions. This algorithm is necessary because the inclusion of uncertainty modeling in a neural network greatly complicates the network’s design space, making the development of a converging model extremely difficult and time consuming. The genetic algorithm presented in this work uses a number of value ranges for various configurable neural network parameters to create a randomly generated population of network architectures. The initially generated population is then evolved over the course of several generations, with the best performing models breeding to produce novel network configurations. Mutations are randomly applied to the network designs to facilitate the development of adaptations beneficial to the task being performed. An experiment was conducted to validate the proposed algorithm, in which the genetic optimizer was tasked with producing a neural network capable of predicting the sound pressure level (SPL) resulting from jet-surface interaction (JSI) noise. The data used for this task was generated at the NASA Glenn Research Center in the Aero-Acoustic Propulsion Laboratory. Starting with an initial population size of 35 randomly generated networks, and evolved over the course of 10 generations, the genetic algorithm produced a design able to predict SPL as a result of JSI noise within 0.272 dB, on average.
Genetic algorithm↗
Frost prediction using machine learning and deep neural network models
This study describes accurate, computationally efficient models that can be implemented for practical use in predicting frost events for point-scale agricultural applications. Frost damage in agriculture is a costly burden to farmers and global food security alike. Timely prediction of frost events is important to reduce the cost of agricultural frost damage and traditional numerical weather forecasts are often inaccurate at the field-scale in complex terrain. In this paper, we developed machine learning (ML) algorithms for the prediction of such frost events near Alcalde, NM at the point-scale. ML algorithms investigated include deep neural network, convolution neural networks, and random forest models at lead-times of 6–48 h. Our results show promising accuracy (6-h prediction RMSE = 1.53–1.72°C) for use in frost and minimum temperature prediction applications. Seasonal differences in model predictions resulted in a slight negative bias during Spring and Summer months and a positive bias in Fall and Winter months. Additionally, we tested the model transferability by continuing training and testing using data from sensors at a nearby farm. We calculated the feature importance of the random forest models and were able to determine which parameters provided the models with the most useful information for predictions. We determined that soil temperature is a key parameter in longer term predictions (>24 h), while other temperature related parameters provide the majority of information for shorter term predictions. The model error compared favorable to previous ML based frost studies and outperformed the physically based High Resolution Rapid Refresh forecasting system making our ML-models attractive for deployment toward real-time monitoring of frost events and damage at commercial farming operations.
97 MATHEMATICS AND COMPUTING↗
Sign Problem in Tensor-Network Contraction
We investigate how the computational difficulty of contracting tensor networks depends on the sign structure of the tensor entries. Using results from computational complexity, we observe that the approximate contraction of tensor networks with only positive entries has lower computational complexity as compared to tensor networks with general real or complex entries. This raises the question of how this transition in computational complexity manifests itself in the hardness of different tensor-network-contraction schemes. We pursue this question by studying random tensor networks with varying bias toward positive entries. First, we consider contraction via Monte Carlo sampling and find that the transition from hard to easy occurs when the tensor entries become predominantly positive; this can be understood as a tensor-network manifestation of the well-known negative-sign problem in quantum Monte Carlo. Second, we analyze the commonly used contraction based on boundary tensor networks. The performance of this scheme is governed by the number of correlations in contiguous parts of the tensor network (which by analogy can be thought of as entanglement). Remarkably, we find that the transition from hard to easy—i.e., from a volume-law to a boundary-law scaling of entanglement—already occurs for a slight bias of the tensor entries toward a positive mean, scaling inversely with the bond dimension D , and thus the problem becomes easy the earlier the larger D occurs. This is in contrast both to expectations and to the behavior found in Monte Carlo contraction, where the hardness at fixed bias increases with the bond dimension. To provide insight into this early breakdown of computational hardness and the accompanying entanglement transition, we construct an effective classical statistical-mechanical model that predicts a transition at a bias of the tensor entries of 1 / D , confirming our observations. We conclude by investigating the computational difficulty of computing expectation values of tensor-network wave functions (projected entangled-pair states, PEPSs) and find that in this setting, the complexity of entanglement-based contraction always remains low. We explain this by providing a local transformation that maps PEPS expectation values to a positive-valued tensor network. This not only provides insight into the origin of the observed boundary-law entanglement scaling but also suggests new approaches toward PEPS contraction based on positive decompositions. Published by the American Physical Society 2025
Chen, Jielun (ORCID:0000000178411545)↗
Local structure graph models with higher-order dependence
Local structure graph models (LSGMs) describe random graphs and networks as a Markov random field (MRF)—each graph edge has a specified conditional distribution dependent on explicit neighbourhoods of other graph edges. Centered parameterizations of LSGMs allow for direct control and interpretation of parameters for large- and small-scale structures (e.g., marginal means vs. dependence). Here, we extend this parameterization to account for triples of dependent edges and illustrate the importance of centered parameterizations for incorporating covariates and interpreting parameters. Using a MRF framework, common exponential random graph models are also shown to induce conditional distributions without centered parameterizations and thereby have undesirable features. This work attempts to advance graph models through conditional model specifications with modern parameterizations, covariates and higher-order dependencies.
97 MATHEMATICS AND COMPUTING↗
Holographic measurement and bulk teleportation
Holography has taught us that spacetime is emergent and its properties depend on the entanglement structure of the dual theory. In this paper, we describe how changes in the entanglement due to a local projective measurement (LPM) on a subregion A of the boundary theory modify the bulk dual spacetime. We find that LPMs destroy portions of the bulk geometry, yielding post-measurement bulk spacetimes dual to the complementary unmeasured region A c that are cut off by end-of-the-world branes. Using a bulk calculation in AdS 3 and tensor network models of holography (in particular, the HaPPY code and random tensor networks), we show that the portions of the bulk geometry that are preserved after the measurement depend on the size of A and the state we project onto. The post-measurement bulk dual to A c includes regions that were originally part of the entanglement wedge of A prior to measurement. This suggests that LPMs performed on a boundary subregion A teleport part of the bulk information originally encoded in A into the complementary region A c . In semiclassical holography an arbitrary amount of bulk information can be teleported in this way, while in tensor network models the teleported information is upper-bounded by the amount of entanglement shared between A and A c due to finite-N effects. When A is the union of two disjoint subregions, the measurement triggers an entangled/disentangled phase transition between the remaining two unmeasured subregions, corresponding to a connected/disconnected phase transition in the bulk description. Our results shed new light on the effects of measurement on the entanglement structure of holographic theories and give insight on how bulk information can be manipulated from the boundary theory. They could also represent a first step towards a holographic description of measurement-induced phase transitions.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
Landsat 8 monitoring of multi-depth suspended sediment concentrations in Lake Erie’s Maumee River using machine learning
Satellite remote sensing has been widely used to map suspended sediment concentration (SSC) in waterbodies. However, due to the complexity of sediment-water interactions, it has been difficult to derive linear and non-linear regression equations to reliably predict SSC, especially when trying to estimate depth of integrated sediment. Herein, this study uses Landsat 8 OLI (Operational Land Imager) sensor to map SSC within the Maumee River in Ohio, USA, at multiple depth intervals (15, 61, 91, and 182 cm). Simple linear least squares regression (LLSR), and three common machine learning models: random forest (RF), support vector regression (SVR), and model averaged neural network (MANN) were used to estimate SSC at the depth intervals. All machine learning models significantly outperformed LLSR while RF performed the best. In both RF and MANN, R2 (coefficient of determination) increases with depth with a maximum R2 of 0.89 and 0.83, respectively, at a depth of 0–182 cm. The results show that machine learning models can implement nonlinear relationships that produce better predictions than traditional linear regression methods in estimating depth integrated SSC, especially when samples are limited.
47 OTHER INSTRUMENTATION↗