Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “tensor factorization”

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 37 records · Page 2

Super-resolution and signal separation in contact Kelvin probe force microscopy of electrochemically active ferroelectric materials

In this work, imaging mechanisms in contact Kelvin probe force microscopy (cKPFM) are explored via information theory-based methods. Gaussian processes are used to achieve super-resolution in the cKPFM signal, effectively extrapolating across the spatial and parameter space. Tensor factorization is applied to reduce the multidimensional signal to the tensor convolution of the scalar functions that show a clear trending behavior with the imaging parameters. These methods establish a workflow for the analysis of the multidimensional datasets that can then be related to the relevant physical mechanisms. We also provide an interactive Google Colab notebook that goes through all the analyses discussed in the paper.

36 MATERIALS SCIENCE↗

Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale

The numerical simulation of quantum circuits is an indispensable tool for development, verification, and validation of hybrid quantum-classical algorithms intended for near-term quantum co-processors. The emergence of exascale high-performance computing (HPC) platforms presents new opportunities for pushing the boundaries of quantum circuit simulation. Here, we present a modernized version of the Tensor Network Quantum Virtual Machine (TNQVM) that serves as the quantum circuit simulation backend in the eXtreme-scale ACCelerator (XACC) framework. The new version is based on the scalable tensor network processing library ExaTN (Exascale Tensor Networks). It provides multiple configurable quantum circuit simulators that perform either an exact quantum circuit simulation via the full tensor network contraction or an approximate simulation via a suitably chosen tensor factorization scheme. Upon necessity, stochastic noise modeling from real quantum processors is incorporated into the simulations by modeling quantum channels with Kraus tensors. By combining the portable XACC quantum programming frontend and the scalable ExaTN numerical processing backend, we introduce an end-to-end virtual quantum development environment that can scale from laptops to future exascale platforms. We report initial benchmarks of our framework, which include a demonstration of the distributed execution, incorporation of quantum decoherence models, and simulation of the random quantum circuits used for the certification of quantum supremacy on Google’s Sycamore superconducting architecture.

Nguyen, Thien↗

A Latent-Variable Formulation of the Poisson Canonical Polyadic Tensor Model: Maximum Likelihood Estimation and Fisher Information

We establish parameter inference for the Poisson canonical polyadic (PCP) tensor model through a latent-variable formulation. Our approach exploits the observation that any random PCP tensor can be derived by marginalizing an unobservable random tensor of one dimension larger. The loglikelihood of this larger dimensional tensor, referred to as the “complete” loglikelihood, is comprised of multiple rank one PCP loglikelihoods. Using this methodology, we first derive maximum likelihood estimators for the PCP model and demonstrate that several existing algorithms for fitting non-negative matrix and tensor factorizations are Expectation-Maximization algorithms. Next, we derive the observed and expected Fisher information matrices for the PCP model. The Fisher information provides us crucial insights into the well-posedness of the tensor model, such as the role that tensor rank plays in identifiability and indeterminacy. For the special case of rank one PCP models, we demonstrate that these results are greatly simplified.

97 MATHEMATICS AND COMPUTING↗

Accelerating high-order mesh optimization using finite element partial assembly on GPUs

In this paper we present a new GPU-oriented mesh optimization method based on high order finite elements. Our approach relies on node movement with fixed topology, through the Target-Matrix Optimization Paradigm (TMOP) and uses a global nonlinear solve over the whole computational mesh, i.e., all mesh nodes are moved together. A key property of the method is that the mesh optimization process is recast in terms of finite element operations, which allows us to utilize recent advances in the field of GPU-accelerated high order finite element algorithms. For example, we reduce data motion by using tensor factorization and matrix-free methods, which have superior performance characteristics compared to traditional full finite element matrix assembly and offer advantages for GPU based HPC hardware. Furthermore, we describe the major mathematical components of the method along with their efficient GPU-oriented implementation. In addition, we propose an easily reproducible mesh optimization test that can serve as a performance benchmark for the mesh optimization community.

97 MATHEMATICS AND COMPUTING↗

Robust Tensor Hypercontraction of the Particle–Particle Ladder Term in Equation-of-Motion Coupled Cluster Theory

One method of representing a high-rank tensor as a (hyper-)product of lower-rank tensors is the tensor hypercontraction (THC) method of Hohenstein et al. This strategy has been found to be useful for reducing the polynomial scaling of coupled-cluster methods by representation of a four-dimensional tensor of electron-repulsion integrals in terms of five two-dimensional matrices. Pierce et al. have already shown that the application of a robust form of THC to the particle–particle ladder (PPL) term reduces the cost of this term in couple-cluster singles and doubles (CCSD) from O(N 6 ) to O(N 5 ) with negligible errors in energy with respect to the density-fitted variant. In this work, we have implemented the least-squares variant of THC (LS-THC) which does not require a nonlinear tensor factorization, including the robust form (R-LS-THC), for the calculation of the excitation and electron attachment energies using equation-of-motion coupled cluster methods EOMEE-CCSD and EOMEA-CCSD, respectively. We have benchmarked the effect of the R-LS-THC-PPL approximation on excitation energies using the comprehensive QUEST database and the accuracy of electron attachment energies using the NAB22 database. Here, we find that errors on the order of 1 meV are achievable with a reduction in total calculation time of approximately 5x.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Symmetry-projected cluster mean-field theory applied to spin systems

We introduce S z spin-projection based on cluster mean-field theory and apply it to the ground state of strongly correlated spin systems. In cluster mean-fields, the ground state wavefunction is written as a factorized tensor product of optimized cluster states. In previous work, we have focused on unrestricted cluster mean-field, where each cluster is S z symmetry adapted. We here remove this restriction by introducing a generalized cluster mean-field (GcMF) theory, where each cluster is allowed to access all S z sectors, breaking S z symmetry. In addition, a projection scheme is used to restore global S z , which gives rise to the S z spin-projected generalized cluster mean-field (S z GcMF). Both of these extensions contribute to accounting for inter-cluster correlations. We benchmark these methods on the 1D, quasi-2D, and 2D J 1 – J 2 and XXZ Heisenberg models. Furthermore, our results indicate that the new methods (GcMF and S z GcMF) provide a qualitative and semi-quantitative description of the Heisenberg lattices in the regimes considered, suggesting them as useful references for further inter-cluster correlations, which are discussed in this work.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Geometry-aware training of factorized layers in tensor Tucker format

Reducing parameter redundancies in neural network architectures is crucial for achieving feasible computational and memory requirements during train and inference of large networks. Given its easy implementation and flexibility, one promising approach is layer factorization, which reshapes weight tensors into a matrix format and parameterizes it as the product of two rank-r matrices. However, this family of approaches often requires an initial full-model warm-up phase, prior knowledge of a feasible rank, and it is sensitive to parameter initialization.In this work, we introduce a novel approach to train the factors of a Tucker decomposition of the weight tensors. Our training proposal proves to be optimal in locally approximating the original unfactorized dynamics and stable for the initialization. Furthermore, the rank of each mode is dynamically updated during training.We provide a theoretical analysis of the algorithm, showing convergence, approximation and local descent guarantees. The method's performance is further illustrated through a variety of experiments, showing remarkable training compression rates and comparable or even better performance than the full baseline and alternative layer factorization strategies.

Zangrando, Emanuele [Gran Sasso Science Institute ↗

Generalized Canonical Polyadic Tensor Decomposition

Tensor decomposition is a fundamental unsupervised machine learning method in data science, with applications including network analysis and sensor data processing. This work develops a generalized canonical polyadic (GCP) low-rank tensor decomposition that allows other loss functions besides squared error. For instance, we can use logistic loss or Kullback--Leibler divergence, enabling tensor decomposition for binary or count data. We present a variety of statistically motivated loss functions for various scenarios. We provide a generalized framework for computing gradients and handling missing data that enables the use of standard optimization methods for fitting the model. Furthermore, we demonstrate the flexibility of the GCP decomposition on several real-world examples including interactions in a social network, neural activity in a mouse, and monthly rainfall measurements in India.

97 MATHEMATICS AND COMPUTING↗

Theoretical and Phenomenological Studies of the Nucleon Structure in High Energy Reactions

The understanding of the internal structure of the proton and other strongly interacting particles is at the forefront of modern nuclear physics research. Generalized Parton Distribution Functions (GPDs) are a powerful tool to advance the understanding of hadron structure. In addition to the information about the one- dimensional collinear momentum distributions of partons (quarks, anti-quarks, and gluons) known from studies of high energy deep-inelastic reactions, GPDs also carry information on the distribution of partons in the transverse plane, and allow us in this way to access the three-dimensional structure of the nucleon. GPDs can be studied in hard-exclusive reactions and contain also information on the energy-momentum tensor form factors which will allow us to gain insights on quantities like pressure or angular momentum distribution inside the nucleon. The goal of this thesis is to deepen our understanding of the three-dimensional structure of the nucleon. We investigate energy-momentum tensor form factors and densities, and all leading-twist GPDs in the bag model. This quark model provides a consistent theoretical framework to investigate many general concepts that have recently attracted interest, and allows one to study insightful limits like the large-Nc limit, heavy-quark limit or the non-relativistic limit. Another important aspect of this thesis is the discussion of the monopole and quadrupole contributions to the angular momentum density. Finally, the description of pseudoscalar meson production in exclusive processes in terms of GPDs is discussed in the Goloskokov-Kroll model and implemented in the PARTONS framework, a software development project which will provide direct support for experiments at the Jefferson National Lab and the future Electron-Ion Collider.

Tezgin, Kemal↗

Rank-reduced coupled-cluster. III. Tensor hypercontraction of the doubles amplitudes

In this work, we develop a quartic-scaling implementation of coupled-cluster singles and doubles (CCSD) based on low-rank tensor hypercontraction (THC) factorizations of both the electron repulsion integrals (ERIs) and the doubles amplitudes. This extends our rank-reduced (RR) coupled-cluster method to incorporate higher-order tensor factorizations. The THC factorization of the doubles amplitudes accounts for most of the gain in computational efficiency as it is sufficient, in conjunction with a Cholesky decomposition of the ERIs, to reduce the computational complexity of most contributions to the CCSD amplitude equations. Further THC factorization of the ERIs reduces the complexity of certain terms arising from nested commutators between the doubles excitation operator and the two-electron operator. We implement this new algorithm using graphical processing units and demonstrate that it enables CCSD calculations for molecules with 250 atoms and 2500 basis functions using a single computer node. Furthermore, we show that the new method computes correlation energies with comparable accuracy to the underlying RR-CCSD method.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum mereology: Factorizing Hilbert space into subsystems with quasiclassical dynamics

We study the question of how to decompose Hilbert space into a preferred tensor-product factorization without any preexisting structure other than a Hamiltonian operator, in particular the case of a bipartite decomposition into “system” and “environment.” Such a decomposition can be defined by looking for subsystems that exhibit quasiclassical behavior. The correct decomposition is one in which pointer states of the system are relatively robust against environmental monitoring (their entanglement with the environment does not continually and dramatically increase) and remain localized around approximately classical trajectories. We present an in-principle algorithm for finding such a decomposition by minimizing a combination of entanglement growth and internal spreading of the system. Both of these properties are related to locality in different ways. Furthermore, this formalism is relevant to questions in the foundations of quantum mechanics and the emergence of spacetime from quantum entanglement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Gravitational form factors of glueballs in Yang-Mills theory

This work presents preliminary results of the first determination of the energy-momentum tensor form factors of the scalar glueball, referred to as gravitational form factors (GFFs). The calculation has been carried out in lattice Yang-Mills theory at a single lattice spacing. Using variationally optimized operators, the matrix elements are extracted from ratios of three-point functions to two-point functions. The glueball GFFs and their kinematic dependence are compared to those of other hadrons from previous calculations.

Abbott, Ryan [Massachusetts Institute of Technolog↗

Gravitational form factors of glueballs in Yang-Mills theory

This work presents preliminary results of the first determination of the energy-momentum tensor form factors of the scalar glueball, referred to as gravitational form factors (GFFs). The calculation has been carried out in lattice Yang-Mills theory at a single lattice spacing. Using variationally optimized operators, the matrix elements are extracted from ratios of three-point functions to two-point functions. The glueball GFFs and their kinematic dependence are compared to those of other hadrons from previous calculations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Form factors for semileptonic B-decays with HISQ light quarks and clover b-quarks in Fermilab interpretation

We compute the vector, scalar, and tensor form factors for the $B\to \pi$, $B\to K$, and $B_s\to K$ amplitudes, which are needed to describe semileptonic $B$-meson decay rates for both the charged and neutral current cases. We use the highly improved staggered quark (HISQ) action for the sea and light valence quarks. The bottom quark is described by the clover action in the Fermilab interpretation. Simulations are carried out on $N_f = 2+1+1$ MILC HISQ ensembles at approximate lattice spacings from $0.15$ fm down to $0.057$ fm. We present blinded preliminary results for the form factors.

Jeong, Hwancheol↗

$Ξ$ 𝑏 → $Ξ$ form factors from lattice QCD and standard-model predictions for $Ξ$ 𝑏 → $Ξ$⁢𝜇 + ⁢𝜇 − and $Ξ$ 𝑏 → $Ξ$⁢𝛾 decays

We present the first lattice QCD determination of the $Ξ$ 𝑏 → $Ξ$ vector, axial-vector, and tensor form factors, which are relevant for the theory of rare decays including $Ξ$ 𝑏 → $Ξ$⁢ℓ + ⁢ℓ − and $Ξ$ 𝑏 → $Ξ$⁢𝛾. The calculation is performed with 2+1 flavors of domain-wall fermions at three different lattice spacings and pion masses in the range from approximately 430 to 230 MeV. The bottom quark is implemented using an anisotropic clover action. Three-point functions with a wide range of source-sink separations and model averaging are used to extract the ground-state contributions. We fit the dependence of the form factors on the momentum transfer, the pion mass, and the lattice spacing using modified 𝑧 expansions that account for subthreshold branch cuts, and apply dispersive bounds and asymptotic behavior constraints to achieve controlled uncertainties in the full semileptonic kinematic region. Using our form factor results, we present standard model predictions for the $Ξ$$^{−}_{𝑏}$ → $Ξ$ − ⁢𝛾 and $Ξ$$^{−}_{𝑏}$ → $Ξ$ − ⁢𝜇 + ⁢𝜇 − branching fractions and two angular observables.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Tensor Text-Mining Methods for Malware Identification and Detection, Malware Dynamics Characterization, and Hosts Ranking

Malware is one of the most persistent and costly cyber threats endangering reputation, confidentiality, integrity, and availability for organizations and national security. Consequently, many of the incident detection and prevention systems, and incident responders have begun to utilize machine learning as a helper in the fight against malware and other cyber threats. However, cyber defenders rely on interpretability and generalizability, yet the popular machine learning methods are black-box and often use traditional supervised solutions that do not generalize to novel malware. Therefore, there is a need to improve the existing solutions. At the same time, the majority of the prior research ignored essential evaluation criteria when reporting the results of their methods, which disables the safe reproducibility of the methods in a production environment. Tensor decomposition, on the other hand, enables interpretable unsupervised analysis of the large-scale data for the discovery of hidden patterns. Our findings, performed on real-world and large-scale experiments, show that tensor factorization-based methods yield performance results that surpasses or competes with existing supervised solutions with the added benefit of interpretability and generalizability. With the ability to analyze complex and large-scale data using tensors, we report results that reflect real-world production environments. We propose to develop new game- changing tools for malware identification and characterization that can trace malware evolution, rank the infected or malicious hosts, and streamline the work of incident response teams, malware analysts, and incident detection and prevention systems.

97 MATHEMATICS AND COMPUTING↗

Energy-momentum tensor in Φ 4 theory at one loop

The energy-momentum tensor form factors are studied in Φ 4 theory to one-loop order with particular focus on the 𝐷-term, a particle property which has attracted a lot of attention in the recent literature. It is shown that the free Klein-Gordon theory value of the 𝐷-term 𝐷 free =−1 is reduced to 𝐷 one-loop =− $\frac{1}{3}$ even if the Φ 4 interaction is infinitesimally small. A companion work in Φ 3 theory confirms this result which may indicate that it is independent of the type of interaction as long as the scalar theory is renormalizable. Dispersion relations are studied. Various definitions of mean square radii including the mechanical radius are investigated. The findings contribute to a better understanding of the energy momentum tensor properties of particles and their interpretation.

form factors↗