cs.LGAug 25, 2026

Equivariant Covariance Tensors: Guaranteed SPD Uncertainty for Tensor-Valued Geometric Learning

Authors: Ruihan Liu, Yu Ji, Jianbo Yu, Shifu Yan, Qingchao Jiang

Organizations: College of Intelligent Robotics and Advanced Manufacturing, Fudan University, Shanghai 200433, China · School of Microelectronics, Fudan University, Shanghai 200433, China · ByteDance, Beijing, China · School of Information Science and Engineering, East China University of Science and Technology, Shanghai 200237, China

Abstract

Tensor-valued prediction is fundamental to geometric deep learning, yet uncertainty quantification (UQ) for such outputs remains an open challenge. While E(3)-equivariant neural networks excel at point estimates, they lack rigorous confidence measures. We focus on symmetric rank-2 tensor prediction, where the target has six Kelvin--Mandel coordinates and full uncertainty is represented by a 6×66\times6 covariance matrix. We introduce a framework for E(3)-equivariant UQ, modeling the full predictive distribution where both mean and covariance preserve rotational symmetry. Our approach decomposes the covariance into irreducible representations Sym2(ρc)≅2×(l=0)⊕2×(l=2)⊕1×(l=4)\mathrm{Sym}^2(ρ_c) \cong 2\times(l=0) \oplus 2\times(l=2) \oplus 1\times(l=4). By mapping from the flat Lie algebra sym(6)\mathfrak{sym}(6) to the curved SPD manifold via matrix exponentiation, we strictly ensure positive-definite covariances while maintaining exact equivariance. Furthermore, we formulate a Log-Euclidean Equivariant Scoring Objective (LE-ESO)---a robust surrogate loss based on the Multivariate Laplace distribution---providing robustness to heavy-tailed errors and stable optimization. Validation on ModelNet40 inertia tensors and Materials Project dielectric tensors demonstrates that our method achieves competitive performance and provides physically consistent, symmetry-preserving uncertainty estimates with useful risk and OOD sensitivity.

Figures & tables

Appendix figures & tables7 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

May 26, 2025

Representation Learning for Equivariant Inference with Guarantees

In many real-world applications of regression, conditional probability estimation, and uncertainty quantification, exploiting symmetries rooted in physics or geometry can dramatically improve generalization and sample efficiency. While geometric deep learning has made empirical advances by incorporating symmetry and geometry priors, less attention has been given to statistical learning guarantees. In this paper, we introduce an equivariant representation learning framework that simultaneously addresses regression, conditional probability estimation, and uncertainty quantification while providing first-of-its-kind non-asymptotic statistical learning guarantees. Grounded in operator and group representation theory, our framework approximates the spectral decomposition of the conditional expectation operator, building representations that are both equivariant and disentangled along independent symmetry quotient groups. Empirical evaluations on synthetic datasets and real-world robotics applications confirm the potential of our approach, matching or outperforming existing equivariant baselines in regression while providing well-calibrated uncertainty estimates.
Jun 4, 2026

Equivariant Neural Belief Propagation

Probabilistic inference over spatially embedded variables requires beliefs that respect SE(3)SE(3) symmetry, yet existing equivariant networks produce only scalars and vectors -- not the rank-2 precision tensors needed for anisotropic uncertainty, and single-component messages collapse multi-modal energy landscapes to physically meaningless averages. We introduce Equivariant Neural Belief Propagation (ENBP), a factor-graph framework whose messages are equivariant Gaussian mixture models with sufficient statistics that transform exactly under SE(3)SE(3). Rank-2 precision matrices are synthesised via equivariant outer products, ingested through differentiable spectral decomposition, and kept tractable by a greedy KL-based mixture reduction that provably commutes with SE(3)SE(3). On GEOM-QM9 and GEOM-Drugs, ENBP achieves 98.9% conformational coverage at 0.090 A˚\mathring{A} error with sub-second latency -- over 100×100\times faster than diffusion baselines at higher accuracy. On multi-body robotic inference, vanilla loopy BP diverges at 15+ agents while ENBP converges with near-zero collision rates and machine-precision equivariance error (∼10−7{\sim}10^{-7} vs.\ 10−110^{-1} for augmented baselines).
May 19, 2026

Exact Symmetry as Algebra: Group-Structured Tensors that Enforce Physical Selection Rules

Symmetry determines which physical responses of molecules and crystals are allowed and underlies many models used throughout the physical sciences. Yet several widely used machine-learned models learn symmetry only approximately from data, raising the question of whether approximate symmetry is sufficient for scientific prediction. Using the Orb-v3 force field, we show that it is often not: the relaxed space group of a crystal depends on the orientation of the input for 47%47\% of a 150150-crystal subsample, and relaxation lowers the space group for half of all 399399 crystals studied. To characterize, quantify, and correct such failures, we introduce a tensor algebra, ⋆G\star_G, defined by convolution over a finite symmetry group and applicable to tensors with noncommuting entries. We prove that the symmetry group determines the algebra's block-diagonal transform and use this structure to analyze model errors on symmetric targets. The resulting projections decompose the average squared error into orthogonal components arising from selection-rule violations, inconsistencies across symmetry-related inputs, and residual error. The removable components reveal how much error arises from broken symmetry, provide reference-free lower bounds on prediction error, and can be eliminated without sacrificing accuracy. For operators, projection followed by blockwise truncation yields the optimal symmetric low-rank approximation. Applying these projections to force predictions reduces both rates of space-group change to at most 2%2\%. Exact selection rules, reference-free error bounds, and symmetry-preserving corrections are therefore available for any trained model without retraining.