Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Tensor network 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 163 records · Page 9

Upscaling permeability for three-dimensional fractured porous rocks with the multiple boundary method

Upscaling permeability of grid blocks is crucial for groundwater models. A novel upscaling method for three-dimensional fractured porous rocks is presented. The objective of the study was to compare this method with the commonly used Oda upscaling method and the volume averaging method. First, the multiple boundary method and its computational framework were defined for three-dimensional stochastic fracture networks. Then, the different upscaling methods were compared for a set of rotated fractures, for tortuous fractures, and for two discrete fracture networks. The results computed by the multiple boundary method are comparable with those of the other two methods and fit best the analytical solution for a set of rotated fractures. The errors in flow rate of the equivalent fracture model decrease when using the multiple boundary method. Furthermore, the errors of the equivalent fracture models increase from well-connected fracture networks to poorly connected ones. Finally, the diagonal components of the equivalent permeability tensors tend to follow a normal or log-normal distribution for the well-connected fracture network model with infinite fracture size. By contrast, they exhibit a power-law distribution for the poorly connected fracture network with multiple scale fractures. The study demonstrates the accuracy and the flexibility of the multiple boundary upscaling concept. This makes it attractive for being incorporated into any existing flow-based upscaling procedures, which helps in reducing the uncertainty of groundwater models.

58 GEOSCIENCES↗

Mixeds-sourcery: Building many-body states using bubbles of nothing

We recently introduced the idea of s-sourcery [B. Swingle and J. McGreevy, Phys. Rev. B 93, 045127 (2016)], a general formalism for building many-body quantum ground states using renormalization-group-inspired quantum circuits. In this work, we define a generalized notion of s-sourcery that applies to mixed states and study its properties and applicability. For our examples we focus on thermal states of local Hamiltonians. We prove a number of theorems establishing the prevalence of mixed s-source fixed points, giving results for free fermion models, conformal field theories, holographic models, and topological phases. Thermal double states (also called thermofield double states) and the machinery of approximate conditional independence are used heavily in the constructions. For a large class of models we provide an information theoretic argument for the existence of a local Hamiltonian whose ground state is the thermal double state, and in some cases we construct such a Hamiltonian.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

E(3)-equivariant graph neural networks for data-efficient and accurate interatomic potentials

Abstract This work presents Neural Equivariant Interatomic Potentials (NequIP), an E(3)-equivariant neural network approach for learning interatomic potentials from ab-initio calculations for molecular dynamics simulations. While most contemporary symmetry-aware models use invariant convolutions and only act on scalars, NequIP employs E(3)-equivariant convolutions for interactions of geometric tensors, resulting in a more information-rich and faithful representation of atomic environments. The method achieves state-of-the-art accuracy on a challenging and diverse set of molecules and materials while exhibiting remarkable data efficiency. NequIP outperforms existing models with up to three orders of magnitude fewer training data, challenging the widely held belief that deep neural networks require massive training sets. The high data efficiency of the method allows for the construction of accurate potentials using high-order quantum chemical level of theory as reference and enables high-fidelity molecular dynamics simulations over long time scales.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DeepCMB: Lensing reconstruction of the cosmic microwave background with deep neural networks

Next-generation cosmic microwave background (CMB) experiments will have lower noise and therefore increased sensitivity, enabling improved constraints on fundamental physics parameters such as the sum of neutrino masses and the tensor-to-scalar ratio r. Achieving competitive constraints on these parameters requires high signal-to-noise extraction of the projected gravitational potential from the CMB maps. Standard methods for reconstructing the lensing potential employ the quadratic estimator (QE). However, the QE performs suboptimally at the low noise levels expected in upcoming experiments. Other methods, like maximum likelihood estimators (MLE), are under active development. In this work, we demonstrate reconstruction of the CMB lensing potential with deep convolutional neural networks (CNN) - ie, a ResUNet. The network is trained and tested on simulated data, and otherwise has no physical parametrization related to the physical processes of the CMB and gravitational lensing. We show that, over a wide range of angular scales, ResUNets recover the input gravitational potential with a higher signal-to-noise ratio than the QE method, reaching levels comparable to analytic approximations of MLE methods. We demonstrate that the network outputs quantifiably different lensing maps when given input CMB maps generated with different cosmologies. We also show we can use the reconstructed lensing map for cosmological parameter estimation. This application of CNN provides a few innovations at the intersection of cosmology and machine learning. First, while training and regressing on images, we predict a continuous-variable field rather than discrete classes. Second, we are able to establish uncertainty measures for the network output that are analogous to standard methods. We expect this approach to excel in capturing hard-to-model non-Gaussian astrophysical foreground and noise contributions.

79 ASTRONOMY AND ASTROPHYSICS↗

DeepCMB: Lensing Reconstruction of the CMB with Deep Neural Networks

Next-generation cosmic microwave background (CMB) experiments will have lower noise and therefore increased sensitivity, enabling improved constraints on fundamental physics parameters such as the sum of neutrino masses and the tensor-to-scalar ratio r. Achieving competitive constraints on these parameters requires high signal-to-noise extraction of the projected gravitational potential from the CMB maps. Standard methods for reconstructing the lensing potential employ the quadratic estimator (QE). However, the QE performs suboptimally at the low noise levels expected in upcoming experiments. Other methods, like maximum likelihood estimators (MLE), are under active development. In this work, we demonstrate reconstruction of the CMB lensing potential with deep convolutional neural networks (CNN) - ie, a ResUNet. The network is trained and tested on simulated data, and otherwise has no physical parametrization related to the physical processes of the CMB and gravitati onal lensing. We show that, over a wide range of angular scales, ResUNets recover the input gravitational potential with a higher signal-to-noise ratio than the QE method, reaching levels comparable to analytic approximations of MLE methods. We demonstrate that the network outputs quantifiably different lensing maps when given input CMB maps generated with different cosmologies. We also show we can use the reconstructed lensing map for cosmological parameter estimation. This application of CNN provides a few innovations at the intersection of cosmology and machine learning. First, while training and regressing on images, we predict a continuous-variable field rather than discrete classes. Second, we are able to establish uncertainty measures for the network output that are analogous to standard methods. We expect this approach to excel in capturing hard-to-model non-Gaussian astrophysical foreground and noise contributions.

79 ASTRONOMY AND ASTROPHYSICS↗

Poblano v 1.0

Poblano is a Matlab toolbox of large-scale algorithms for nonlinear optimization. The algorithms in Poblano require only first-order derivative information (e.g., gradients for scalar-valued objective functions), and therefore can scale to very large problems [6].Poblano is a set of general purpose methods for solving unconstrained nonlinear optimization methods. It has been applied to standard test problems covering a range of application areas. The driving application for Poblano development has been tensor decompositions in data analysis applications (bibliometric analysis, social network analysis, chemometrics, etc.) [1].

Dunlavy, Daniel↗

Poblano v 1.0

Poblano is a Matlab toolbox of large-scale algorithms for nonlinear optimization. The algorithms in Poblano require only first-order derivative information (e.g., gradients for scalar-valued objective functions), and therefore can scale to very large problems [6].Poblano is a set of general purpose methods for solving unconstrained nonlinear optimization methods. It has been applied to standard test problems covering a range of application areas. The driving application for Poblano development has been tensor decompositions in data analysis applications (bibliometric analysis, social network analysis, chemometrics, etc.) [1].

Dunlavy, Daniel↗

A General Spatiotemporal Imputation Framework for Missing Sensor Data

Many applications from precision agriculture, environmental monitoring and transportation networks rely on data collected across space and time over a large geographic area. Missing data poses a significant challenge for any data-driven inference and control tasks. Data imputation or the estimation of missing data can help fill these gaps by utilizing inherent spatial relationships and temporal patterns. A variety of spatiotemporal imputation models have been developed to address missing data in spatiotemporal datasets. However, these classical methods rely on the assumption that the underlying data follows a smooth trend and fail to provide accurate estimates when there is a large number of missing points in the data. Even though there are machine learning driven tensor completion approaches such as convolutional neural network based tensor completion (CoSTCo) that capture the non-linear relationships in the dataset, the transductive nature makes the algorithm less scalable. Thus, existing approaches for estimating the missing information do not effectively capture all dimensions of the spatiotemporal data structure, resulting in erroneous predictions and poor performance. The main contributions of this paper are: (1) We propose a novel inductive framework (G-LSTM) for missing data imputation that integrates a graph neural network with LSTMs to effectively capture both spatial and temporal dependencies. (2) Experimental results on a traffic dataset demonstrate that the proposed GNN integrated with an LSTM framework achieves improved imputation and maintains steady performance even when there are extreme missing conditions in comparison with the state-of-the-art imputation framework (i.e, CoSTCo). (3) The simulation results on a traffic network show up to 69% reduction in mean absolute error and 61% reduction in root mean square error when compared to CoSTCo.

Tharzeen, Aabila↗

Tensor Toolbox for MATLAB v. 3.0

Tensors (also known as multidimensional arrays or N-way arrays) are used in a variety of applications ranging from chemometrics to network analysis. The Tensor Toolbox provides classes for manipulating dense, sparse, and structured tensors using MATLAB's object-oriented features. It also provides algorithms for tensor decomposition and factorization, algorithms for computing tensor eigenvalues, and methods for visualization of results.

Kolda, Tamara↗

DNTTD (Distributed Non-Negative Tensor Train Decomposition)

The era of exascale computing opens new venues for innovations and discoveries in many scientific, engineering, and commercial fields. However, with the exa flops also come the extra-large high-dimensional data generated by high performance computing. High-dimensional data is presented as multidimensional arrays, aka tensors. The presence of latent (not directly observable) structures in the tensor allows a unique representation and compression of the data by classical tensor factorization techniques. However, the classical tensor methods are not always stable or they can be exponential in their memory requirements, which makes them not suitable for high-dimensional tensors. Tensor train (TT) is a state-of-the-art tensor network introduced for factorization of high-dimensional tensors. TT transforms the initial high-dimensional tensor in a network of three-dimensional tensors that requires only a linear storage. Many real-world data, such as, density, temperature, population, probability, etc., are non-negative and for an easy interpretation, the algorithms preserving non-negativity are preferred. Here, we introduce a distributed non-negative tensor-train and demonstrate its scalability and the compression on synthetic and real world big datasets.

Bhattarai, Manish↗

COVID-19 dynamics across the US: A deep learning study of human mobility and social behavior

This paper presents a deep learning framework for epidemiology system identification from noisy and sparse observations with quantified uncertainty. The proposed approach employs an ensemble of deep neural networks to infer the time-dependent reproduction number of an infectious disease by formulating a tensor-based multi-step loss function that allows us to efficiently calibrate the model on multiple observed trajectories. The method is applied to a mobility and social behavior-based SEIR model of COVID-19 spread. The model is trained on Google and Unacast mobility data spanning a period of 66 days, and is able to yield accurate future forecasts of COVID-19 spread in 203 US counties within a time-window of 15 days. Interestingly, a sensitivity analysis that assesses the importance of different mobility and social behavior parameters reveals that attendance of close places, including workplaces, residential, and retail and recreational locations, has the largest impact on the effective reproduction number. Furthermore, the model enables us to rapidly probe and quantify the effects of government interventions, such as lock-down and re-opening strategies. Taken together, the proposed framework provides a robust workflow for data-driven epidemiology model discovery under uncertainty and produces probabilistic forecasts for the evolution of a pandemic that can judiciously provide information for policy and decision making. All codes and data accompanying this manuscript are available at https://github.com/PredictiveIntelligenceLab/DeepCOVID19.

60 APPLIED LIFE SCIENCES↗

Determination of the mutual orientation between proton CSA tensors mediated through band-selective 1 H– 1 H recoupling under fast MAS

We report the mutual orientation of nuclear spin interaction tensors provides critical information on the conformation and arrangement of molecules in chemicals, materials, and biological systems at an atomic level. Proton is a ubiquitous and important element in a variety of substances, and its NMR is highly sensitive due to their virtually 100% natural abundance and large gyromagnetic ratio. Nevertheless, the measurement of mutual orientation between the 1 H CSA tensors has remained largely untouched in the past due to strong 1 H– 1 H homonuclear interactions in a dense network of protons. In this study, we have developed a proton-detected 3D 1 H CSA/ 1 H CSA/ 1 H CS correlation method that utilizes three techniques to manage homonuclear interactions, namely fast magic-angle spinning, windowless C-symmetry-based CSA recoupling (windowless-ROCSA), and a band-selective 1 H– 1 H polarization transfer. The asymmetric 1 H CSA/ 1 H CSA correlated powder patterns produced by the C-symmetry-based methods are highly sensitive to the sign and asymmetry parameter of the 1 H CSA, and the Euler angle β as compared to the symmetric pattern obtained by the existing γ-encoded R-symmetry-based CSA/CSA correlation methods and allows a larger spectral area for data fitting. These features are beneficial for determining the mutual orientation between the nuclear spin interaction tensors with improved accuracy.

1H CSA↗

Feature Selection and Inferential Procedures for Video Data [Slides]

With the rise of electronic and high-dimensional data, new and innovative feature detection and statistical methods are required to perform accurate and meaningful statistical analysis of these datasets that provide unique statistical challenges. In the area of feature detection, much of the recent feature detection research in the computer vision community has focused on deep learning methods, which require large amounts of labeled training data. However, in many application areas, training data is very limited and often difficult to obtain. We develop methods for fast, unsupervised, precise feature detection for video data based on optical flows, edge detection, and clustering methods. We also use pretrained neural networks and interpretable linear models to extract features using very limited training data. In the area of statistics, while high-dimensional data analysis has been a main focus of recent statistical methodological research, much focus has been on populations of high-dimensional vectors, rather than populations of high-dimensional tensors, which are three-dimensional arrays that can be used to model dependent images, such as images taken of the same person or ripped video frames. Our feature detection method is a non-model-based method that fusses information from dense optical flow, raw image pixels, and frame differences to generate detections. Our hypothesis testing methods are based on the assumption that dependent images are concatenated into a tensor that follows a tensor normal distribution, and from this assumption, we derive likelihood-ratio, score, and regression-based tests for one- and multiple-sample testing problems. Our methods will be illustrated on simulated and real datasets. We conclude this report with comments on the relationship between feature detection and hypothesis testing methods.

97 MATHEMATICS AND COMPUTING↗

BES-HEP Connections: Common Problems in Condensed Matter and High Energy Physics, Round Table Discussion

On February 2, 2015 the Offices of High Energy Physics (HEP) and Basic Energy Sciences (BES) convened a Round Table discussion among a group of physicists on ‘Common Problems in Condensed Matter and High Energy Physics’. This was motivated by the realization that both fields deal with quantum many body problems, share many of the same challenges, use quantum field theoretical approaches and have productively interacted in the past. The meeting brought together physicists with intersecting interests to explore recent developments and identify possible areas of collaboration.... Several topics were identified as offering great opportunity for discovery and advancement in both condensed matter physics and particle physics research. These included topological phases of matter, the use of entanglement as a tool to study nontrivial quantum systems in condensed matter and gravity, the gauge-gravity duality, non-Fermi liquids, the interplay of transport and anomalies, and strongly interacting disordered systems. Many of the condensed matter problems are realizable in laboratory experiments, where new methods beyond the usual quasi-particle approximation are needed to explain the observed exotic and anomalous results. Tools and techniques such as lattice gauge theories, numerical simulations of many-body systems, and tensor networks are seen as valuable to both communities and will likely benefit from collaborative development.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Locally purified maximally mixed states at scale: Entanglement pruning and symmetries

Locally Purified Density Operators (LPDOs) are state-of-the-art tensor network ansatze candidates that efficiently represent mixed quantum states at scale. However, given their non-uniqueness, their representational complexity is generally sub-optimal in practical computations. Here, in this work we perform a comprehensive numerical and analytical analysis and resolve this issue in the experimentally relevant limit where noise depolarizes the density operator into a maximally mixed state. To resolve the sub-optimality issue, we analyze two numerical tools, one analytic method, and detail the relations between them. The numerical tools used are fidelity-preserving truncations and isometric gauge transformations leveraging Riemannian optimizations over entropic objective functions. In addition, by invoking the injectivity and symmetry constraints of the maximally mixed LPDO, we also present analytical closed-form expressions for the disentangler and discuss their relation to numerical optimizers. Further, away from the maximally mixed state, our simulations highlight how the truncation threshold smoothly interpolate, as a function of depolarization, between established matrix product results and our new results. Our work shows how, by minimizing the resources required to represent key states of practical interest in experiment, the efficiency of tensor network algorithms can be substantially increased. This paves the path for uncovering tensor network’s fundamental scalability limits and latent potential in representing the wide locus of mixed quantum states that are accessible on near-term quantum devices.

Gangapuram, Amit Jamadagni [Oak Ridge National Lab↗

Multimodal fission from self-consistent calculations

When multiple fission modes coexist in a given nucleus, distinct fragment yield distributions appear. Multimodal fission has been observed in a number of fissioning nuclei spanning the nuclear chart, and this phenomenon is expected to affect the nuclear abundances synthesized during the rapid neutron-capture process (𝑟-process). In this study, we generalize the previously proposed hybrid model for fission-fragment yield distributions to predict competing fission modes and estimate the resulting yield distributions. Here, our framework allows for a comprehensive large-scale calculation of fission-fragment yields suited for 𝑟-process nuclear network studies. Nuclear density functional theory is employed to obtain the potential energy and collective inertia tensor on a multidimensional collective space defined by mass multipole moments. Fission pathways and their relative probabilities are determined using the nudged elastic band method. Based on this information, mass and charge fission yields are predicted using the recently developed hybrid model. Fission properties of fermium isotopes are calculated in the axial quadrupole-octupole collective space for three energy density functionals (EDFs). Disagreement between the EDFs appears when multiple fission modes are present. Within our framework, the UNEDF⁢1 HFB EDF agrees best with experimental data. Calculations in the axial quadrupole-octupole-hexadecapole collective space improve the agreement with the experiment for SkM*. We also discuss the sensitivity of fission predictions on the choice of EDF for several superheavy nuclei. Fission-fragment yield predictions for nuclei with multiple fission modes are sensitive to the underlying EDF. For large-scale calculations in which a minimal number of collective coordinates is considered, UNEDF⁢1 HFB provides the best description of experimental data, though the sensitivity motivates robust quantification of the uncertainties of the theoretical model.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Compressing Hamiltonians with ab initio downfolding for simulating strongly-correlated materials on quantum computers

The accurate first-principles description of strongly correlated materials is an important and challenging problem in condensed matter physics. Ab initio downfolding has emerged as a way of deriving compressed many-body Hamiltonians that maintain the essential physics of strongly correlated materials. The solution of these material-specific models is still exponentially difficult to generate on classical computers, but quantum algorithms allow for a significant speed-up in obtaining the ground states of these compressed Hamiltonians. Here, we demonstrate that using quantum algorithms to obtain the properties of downfolded Hamiltonians can indeed yield high-fidelity solutions. By combining ab initio downfolding and variational quantum eigensolvers, we correctly predict the antiferromagnetic state of one-dimensional cuprate Ca 2 Cu O 3 , the excitonic ground state of monolayer W Te 2 , and the charge-ordered state of correlated metal Sr VO 3 . Numerical simulations using a classical tensor network implementation of variational quantum eigensolvers allow us to simulate large models with up to 54 qubits and encompassing up to four bands in the correlated subspace, which is indicative of the complexity that our framework can address. Through these methods we demonstrate the potential of classical preoptimization and downfolding techniques for enabling efficient materials simulation using quantum algorithms.

Alvertis, Antonios M. [NASA, Ames; LBNL, Berkeley]↗

Link prediction on evolving graphs using matrix and tensor factorizations.

The data in many disciplines such as social networks, web analysis, etc. is link-based, and the link structure can be exploited for many different data mining tasks. In this paper, we consider the problem of temporal link prediction: Given link data for time periods 1 through T, can we predict the links in time period T + 1? Specifically, we look at bipartite graphs changing over time and consider matrix- and tensor-based methods for predicting links. We present a weight-based method for collapsing multi-year data into a single matrix. We show how the well-known Katz method for link prediction can be extended to bipartite graphs and, moreover, approximated in a scalable way using a truncated singular value decomposition. Using a CANDECOMP/PARAFAC tensor decomposition of the data, we illustrate the usefulness of exploiting the natural three-dimensional structure of temporal link data. Through several numerical experiments, we demonstrate that both matrix- and tensor-based techniques are effective for temporal link prediction despite the inherent difficulty of the problem.

99 GENERAL AND MISCELLANEOUS↗