Integral Formulas for Vector Spherical Tensor Products

• URL: http://arxiv.org/abs/2603.08630v1
• Date: Mon, 09 Mar 2026 17:09:28 GMT
• Title: Integral Formulas for Vector Spherical Tensor Products
• Abstract summary: We derive integral formulas that simplify the Vector Spherical Product, which generalizes the Gaunt tensor product to antisymmetric couplings.<n>We discuss how the Gaunt and the Vector Spherical Products allow to control the expressivity-runtime tradeoff associated with the usual Clebsch-Gordan Products.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We derive integral formulas that simplify the Vector Spherical Tensor Product recently introduced by Xie et al., which generalizes the Gaunt tensor product to antisymmetric couplings. In particular, we obtain explicit closed-form expressions for the antisymmetric analogues of the Gaunt coefficients. This enables us to simulate the Clebsch-Gordan tensor product using a single Vector Spherical Tensor Product, yielding a $9\times$ reduction in the required tensor product evaluations. Our results enable efficient and practical implementations of the Vector Spherical Tensor Product, paving the way for applications of this generalization of Gaunt tensor products in $\mathrm{SO}(3)$-equivariant neural networks. Moreover, we discuss how the Gaunt and the Vector Spherical Tensor Products allow to control the expressivity-runtime tradeoff associated with the usual Clebsch-Gordan Tensor Products. Finally, we investigate low rank decompositions of the normalizations of the considered tensor products in view of their use in equivariant neural networks.

Related papers

• Low-Rank Tensor Completion Based on Fractional Regularization with Ky Fan p-k Norm [63.91066367247722]
  This paper addresses low-rank tensor completion (LRTC)<n>It proposes a novel non surrogate, namely the ratio of the tub tensor norm to the tensor Ky Fan p-k norm (TNK)
  arXiv  Detail & Related papers  (2026-06-17T13:12:07Z)
• Asymptotically Fast Clebsch-Gordan Tensor Products with Vector Spherical Harmonics [1.3575254859416315]
  We provide the first complete algorithm which truly provides benefits Clebsch-Gordan tensor products.<n>For full CGTP, our algorithm brings complexity from the naive $O(L4log2 L)$ to $O(L4log2 L)$, close to the lower bound of $O(L4)$.
  arXiv  Detail & Related papers  (2026-02-25T00:41:35Z)
• TensorLens: End-to-End Transformer Analysis via High-Order Attention Tensors [53.891337639229285]
  We introduce attentionLens, a novel formulation that captures the entire transformer as a single, input-dependent linear operator expressed through a high-order attention-interaction connection.<n>Our experiments demonstrate that the attention tensor can serve as a powerful foundation for developing tools aimed at interpretability and model understanding.
  arXiv  Detail & Related papers  (2026-01-25T19:21:25Z)
• Tensor cumulants for statistical inference on invariant distributions [49.80012009682584]
  We show that PCA becomes computationally hard at a critical value of the signal's magnitude. We define a new set of objects, which provide an explicit, near-orthogonal basis for invariants of a given degree. It also lets us analyze a new problem of distinguishing between different ensembles.
  arXiv  Detail & Related papers  (2024-04-29T14:33:24Z)
• Enabling Efficient Equivariant Operations in the Fourier Basis via Gaunt Tensor Products [14.984349569810275]
  We propose a systematic approach to accelerate the complexity of the tensor products of irreps. We introduce the Gaunt Product, which serves as a new method to construct efficient equivariant operations. Our experiments on the Open Catalyst Project and 3BPA datasets demonstrate both the increased efficiency and improved performance.
  arXiv  Detail & Related papers  (2024-01-18T18:57:10Z)
• Tensor Factorization via Transformed Tensor-Tensor Product for Image Alignment [3.0969191504482243]
  We study the problem of a batch of linearly correlated image alignment, where the observed images are deformed by some unknown domain transformations. By stacking these images as the frontal slices of a third-order tensor, we propose to explore the low-rankness of the underlying tensor.
  arXiv  Detail & Related papers  (2022-12-12T05:52:26Z)
• Decomposable Sparse Tensor on Tensor Regression [1.370633147306388]
  We consider the sparse low rank tensor on tensor regression where predictors $mathcalX$ and responses $mathcalY$ are both high-dimensional tensors. We propose a fast solution based on stagewise search composed by contraction part and generation part which are optimized alternatively.
  arXiv  Detail & Related papers  (2022-12-09T18:16:41Z)
• Unified Fourier-based Kernel and Nonlinearity Design for Equivariant Networks on Homogeneous Spaces [52.424621227687894]
  We introduce a unified framework for group equivariant networks on homogeneous spaces. We take advantage of the sparsity of Fourier coefficients of the lifted feature fields. We show that other methods treating features as the Fourier coefficients in the stabilizer subgroup are special cases of our activation.
  arXiv  Detail & Related papers  (2022-06-16T17:59:01Z)
• Unsupervised Disentanglement with Tensor Product Representations on the Torus [78.6315881294899]
  Current methods for learning representations with auto-encoders almost exclusively employ vectors as the latent representations. In this work, we propose to employ a tensor product structure for this purpose. In contrast to the conventional variations methods, which are targeted toward normally distributed features, the latent space in our representation is distributed uniformly over a set of unit circles.
  arXiv  Detail & Related papers  (2022-02-13T04:23:12Z)
• When Random Tensors meet Random Matrices [50.568841545067144]
  This paper studies asymmetric order-$d$ spiked tensor models with Gaussian noise. We show that the analysis of the considered model boils down to the analysis of an equivalent spiked symmetric textitblock-wise random matrix.
  arXiv  Detail & Related papers  (2021-12-23T04:05:01Z)
• Pseudo-Euclidean Attract-Repel Embeddings for Undirected Graphs [73.0261182389643]
  Dot product embeddings take a graph and construct vectors for nodes such that dot products between two vectors give the strength of the edge. We remove the transitivity assumption by embedding nodes into a pseudo-Euclidean space. Pseudo-Euclidean embeddings can compress networks efficiently, allow for multiple notions of nearest neighbors each with their own interpretation, and can be slotted' into existing models.
  arXiv  Detail & Related papers  (2021-06-17T17:23:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.