Research map / Architectures and efficiency / RNNs and normalization
Tensor Decomposition Networks for Accelerating Machine Learning Force Field Computations
Yuchao Lin, Cong Fu, Zachary Krueger, Haiyang Yu, Maho Nakata, Jianwen Xie, Emine Kucukbenli, Xiaofeng Qian, Shuiwang Ji
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Proposes tensor decomposition networks (TDNs) that replace Clebsch-Gordan tensor products in SO(3)-equivariant MLIPs with low-rank tensor decompositions to accelerate force field computation.
Problem
SO(3)-equivariant machine learning interatomic potentials rely on Clebsch-Gordan tensor products, which are computationally expensive.
Approach
Approximately equivariant networks whose CG tensor products are replaced by low-rank tensor decompositions, trading exact equivariance for speed.
Closest papers by meaning
- High-Rank Irreducible Cartesian Tensor Decomposition and Bases of Equivariant Spaces (JMLR 2025 · similarity 0.90)
- SE(3) Equivariant Graph Neural Networks with Complete Local Frames (ICML 2022 · similarity 0.89)
- The Price of Freedom: Exploring Expressivity and Runtime Tradeoffs in Equivariant Tensor Products (ICML 2025 · similarity 0.87)
- Compact SO(3) Equivariant Atomistic Foundation Models via Structural Pruning (NeurIPS 2026 · similarity 0.87)
- Efficient and Scalable Density Functional Theory Hamiltonian Prediction through Adaptive Sparsity (ICML 2025 · similarity 0.87)
- A Tale of Two Symmetries: Exploring the Loss Landscape of Equivariant Models (NeurIPS 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
