Equivariance via Minimal Frame Averaging for More Symmetries and Efficiency

Yu-Ching Lin, Jacob Helwig, Shurui Gui, Shuiwang Ji
2/12/2026

No official code found. Best implementation: divelab/MFA (20 stars, MIT, last commit 2025-01-18).

Abstract

We consider achieving equivariance in machine learning systems via frame averaging. Current frame averaging methods involve a costly sum over large frames or rely on sampling-based approaches that only yield approximate equivariance. Here, we propose Minimal Frame Averaging (MFA), a mathematical framework for constructing provably minimal frames that are exactly equivariant. The general foundations of MFA also allow us to extend frame averaging to more groups than previously considered, including the Lorentz group for describing symmetries in space-time, and the unitary group for complex-valued domains. Results demonstrate the efficiency and effectiveness of encoding symmetries via MFA across a diverse range of tasks, including $n$-body simulation, top tagging in collider physics, and relaxed energy prediction. Our code is available at https://github.com/divelab/MFA.

View on arXivView PDF

Code Implementations(1)

divelab/MFACommunity64%
MIT

Official code repository of paper Equivariance via Minimal Frame Averaging for More Symmetries and Efficiency.

202Python, Jupyter NotebookMay 25, 20241 years agoMIT

Similar Papers

Cite this paper

@article{lin2026equivariance,
  title  = {Equivariance via Minimal Frame Averaging for More Symmetries and Efficiency},
  author = {Yu-Ching Lin and Jacob Helwig and Shurui Gui and Shuiwang Ji},
  year   = {2026},
  eprint = {2406.07598},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2406.07598},
  journal = {ICML 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2406.07598.svg)](https://codeofpaper.com/paper/2406.07598)

Discussion