arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.15413cs.LG
收藏

G-RepsNet:面向任意矩阵群的快速且通用的等变网络构造方法

G-RepsNet: A Fast and General Construction of Equivariant Networks for Arbitrary Matrix Groups

University of Illinois at Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);Mitsubishi Electric Research Laboratories(三菱电机研究实验室)

Sourya Basu, Suhas Lohit, Matthew Brand

AI总结:

本文提出G-RepsNet,一种利用张量多项式和低成本张量运算为任意矩阵群构造轻量级等变网络的方法,在图像分类、N体预测和偏微分方程求解等任务上达到或超过现有先进等变模型,同时保持高效。

摘要:

群等变性是一种强归纳偏置,在广泛的深度学习任务中非常有用。然而,为一般群和一般域构造高效的等变网络十分困难。Finzi等人(2021)的近期工作直接求解任意矩阵群的等变约束,从而得到等变MLP(EMLP)。但该方法扩展性不佳,而扩展性在深度学习中至关重要。本文提出群表示网络(G-RepsNet),这是一种面向任意矩阵群的轻量级等变网络,其特征使用张量多项式表示。我们设计的核心直觉是:在神经网络的隐藏层中使用张量表示,并结合简单且低成本张量运算,可以得到具有表达能力的通用等变网络。我们发现,在若干具有群对称性的任务上,例如以标量、向量和二阶张量作为数据类型的O(5)、O(1,3)和O(3)任务,G-RepsNet与EMLP具有竞争力。在图像分类任务上,我们发现使用二阶表示的G-RepsNet具有竞争力,并且常常优于复杂的最先进等变模型,例如GCNN(Cohen & Welling, 2016a)和E(2)-CNN(Weiler & Cesa, 2019)。为进一步说明我们方法的通用性,我们展示G-RepsNet在N体预测和求解偏微分方程上分别与G-FNO(Helwig et al., 2023)和EGNN(Satorras et al., 2021)具有竞争力,同时保持高效。

英文摘要:

Group equivariance is a strong inductive bias useful in a wide range of deep learning tasks. However, constructing efficient equivariant networks for general groups and domains is difficult. Recent work by Finzi et al. (2021) directly solves the equivariance constraint for arbitrary matrix groups to obtain equivariant MLPs (EMLPs). But this method does not scale well and scaling is crucial in deep learning. Here, we introduce Group Representation Networks (G-RepsNets), a lightweight equivariant network for arbitrary matrix groups with features represented using tensor polynomials. The key intuition for our design is that using tensor representations in the hidden layers of a neural network along with simple inexpensive tensor operations can lead to expressive universal equivariant networks. We find G-RepsNet to be competitive to EMLP on several tasks with group symmetries such as O(5), O(1, 3), and O(3) with scalars, vectors, and second-order tensors as data types. On image classification tasks, we find that G-RepsNet using second-order representations is competitive and often even outperforms sophisticated state-of-the-art equivariant models such as GCNNs (Cohen & Welling, 2016a) and E(2)-CNNs (Weiler & Cesa, 2019). To further illustrate the generality of our approach, we show that G-RepsNet is competitive to G-FNO (Helwig et al., 2023) and EGNN (Satorras et al., 2021) on N-body predictions and solving PDEs, respectively, while being efficient.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑