skip to main content

Explore Research Products in the NSF-PAR

Title: Automatic transformation of irreducible representations for efficient contraction of tensors with cyclic group symmetry

Tensor contractions are ubiquitous in computational chemistry andphysics, where tensors generally represent states or operators andcontractions express the algebra of these quantities. In this context,the states and operators often preserve physical conservation laws,which are manifested as group symmetries in the tensors. These groupsymmetries imply that each tensor has block sparsity and can be storedin a reduced form. For nontrivial contractions, the memory footprint andcost are lowered, respectively, by a linear and a quadratic factor inthe number of symmetry sectors. State-of-the-art tensor contractionsoftware libraries exploit this opportunity by iterating over blocks orusing general block-sparse tensor representations. Both approachesentail overhead in performance and code complexity. With intuition aidedby tensor diagrams, we present a technique, irreducible representationalignment, which enables efficient handling of Abelian group symmetriesvia only dense tensors, by using contraction-specific reduced forms.This technique yields a general algorithm for arbitrary group symmetriccontractions, which we implement in Python and apply to a variety ofrepresentative contractions from quantum chemistry and tensor networkmethods. As a consequence of relying on only dense tensor contractions,we can easily make use of efficient batched matrix multiplication viaIntel’s MKL and distributed tensor contraction via the Cyclops library,achieving good efficiency and parallel scalability on up to 4096 KnightsLanding cores of a supercomputer.

  more » « less
Award ID(s):
1931258
NSF-PAR ID:
10477296
Author(s) / Creator(s):
; ; ;
Publisher / Repository:
SciPost Physics Codebases
Date Published:
Journal Name:
SciPost Physics Codebases
ISSN:
2949-804X
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ; ; ; ; ( , 2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW))
    null (Ed.)
    Many domains of scientific simulation (chemistry, condensed matter physics, data science) increasingly eschew dense tensors for block-sparse tensors, sometimes with additional structure (recursive hierarchy, rank sparsity, etc.). Distributed-memory parallel computation with block-sparse tensorial data is paramount to minimize the time-to-solution (e.g., to study dynamical problems or for real-time analysis) and to accommodate problems of realistic size that are too large to fit into the host/device memory of a single node equipped with accelerators. Unfortunately, computation with such irregular data structures is a poor match to the dominant imperative, bulk-synchronous parallel programming model. In this paper, we focus on the critical element of block-sparse tensor algebra, namely binary tensor contraction, and report on an efficient and scalable implementation using the task-focused PaRSEC runtime. High performance of the block-sparse tensor contraction on the Summit supercomputer is demonstrated for synthetic data as well as for real data involved in electronic structure simulations of unprecedented size. 
    more » « less
  2. ; ( , Journal of High Energy Physics)
    A bstract In holographic CFTs satisfying eigenstate thermalization, there is a regime where the operator product expansion can be approximated by a random tensor network. The geometry of the tensor network corresponds to a spatial slice in the holographic dual, with the tensors discretizing the radial direction. In spherically symmetric states in any dimension and more general states in 2d CFT, this leads to a holographic error-correcting code, defined in terms of OPE data, that can be systematically corrected beyond the random tensor approximation. The code is shown to be isometric for light operators outside the horizon, and non-isometric inside, as expected from general arguments about bulk reconstruction. The transition at the horizon occurs due to a subtle breakdown of the Virasoro identity block approximation in states with a complex interior. 
    more » « less
  3. ; ; ; ( , ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP))
    This work focuses on canonical polyadic decomposition (CPD) for large-scale tensors. Many prior works rely on data sparsity to develop scalable CPD algorithms, which are not suitable for handling dense tensor, while dense tensors often arise in applications such as image and video processing. As an alternative, stochastic algorithms utilize data sampling to reduce per-iteration complexity and thus are very scalable, even when handling dense tensors. However, existing stochastic CPD algorithms are facing some challenges. For example, some algorithms are based on randomly sampled tensor entries, and thus each iteration can only updates a small portion of the latent factors. This may result in slow improvement of the estimation accuracy of the latent factors. In addition, the convergence properties of many stochastic CPD algorithms are unclear, perhaps because CPD poses a hard nonconvex problem and is challenging for analysis under stochastic settings. In this work, we propose a stochastic optimization strategy that can effectively circumvent the above challenges. The proposed algorithm updates a whole latent factor at each iteration using sampled fibers of a tensor, which can quickly increase the estimation accuracy. The algorithm is flexible-many commonly used regularizers and constraints can be easily incorporated in the computational framework. The algorithm is also backed by a rigorous convergence theory. Simulations on large-scale dense tensors are employed to showcase the effectiveness of the algorithm. 
    more » « less
  4. ; ; ; ; ( , arXivorg)
    We consider the prediction of general tensor properties of crystalline materials, including dielectric, piezoelectric, and elastic tensors. A key challenge here is how to make the predictions satisfy the unique tensor equivariance to O(3) group and invariance to crystal space groups. To this end, we propose a General Materials Tensor Network (GMTNet), which is carefully designed to satisfy the required symmetries. To evaluate our method, we curate a dataset and establish evaluation metrics that are tailored to the intricacies of crystal tensor predictions. Experimental results show that our GMTNet not only achieves promising performance on crystal tensors of various orders but also generates predictions fully consistent with the intrinsic crystal symmetries. Our code is publicly available as part of the AIRS library (https://github.com/divelab/AIRS). 
    more » « less
  5. ; ( , Journal of High Energy Physics)
    A bstract We study 2-point correlation functions for scalar operators in position space through holography including bulk cubic couplings as well as higher curvature couplings to the square of the Weyl tensor. We focus on scalar operators with large conformal dimensions. This allows us to use the geodesic approximation for propagators. In addition to the leading order contribution, captured by geodesics anchored at the insertion points of the operators on the boundary and probing the bulk geometry thoroughly studied in the literature, the first correction is given by a Witten diagram involving both the bulk cubic coupling and the higher curvature couplings. As a result, this correction is proportional to the VEV of a neutral operator O k and thus probes the interior of the black hole exactly as in the case studied by Grinberg and Maldacena [13]. The form of the correction matches the general expectations in CFT and allows to identify the contributions of T n O k (being T n the general contraction of n energy-momentum tensors) to the 2-point function. This correction is actually the leading term for off-diagonal correlators (i.e. correlators for operators of different conformal dimension), which can then be computed holographically in this way. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email