用对称结构矩阵构建参数更少的近似等变神经网络
Symmetry-Based Structured Matrices for Efficient Approximately Equivariant Networks
- 基于群矩阵设计可高效计算的对称结构参数矩阵
- 在多种任务上实现与先进方法相当性能,参数量少1-2个数量级
- 适合追求轻量化且需保持对称性约束的模型设计者
近年来,设计具有松弛等变性的神经网络(NN)受到广泛关注,这类网络在精确等变性和完全灵活性之间取得平衡,从而获得一致的性能提升。另一方向中,低位移秩(LDR)结构参数矩阵因其支持快速函数与梯度计算,被用于构建紧凑型神经网络,但主要应用于经典卷积神经网络(CNNs)。本文提出一种基于对称性结构矩阵的框架,构建参数更少的近似等变神经网络。该方法通过群矩阵(GMs)统一前述方向,GMs是有限群正规表示的早期形式。GMs允许设计类似LDR的结构矩阵,可将CNN中的基本操作从循环群推广至任意有限群。我们证明了GMs能将经典LDR理论推广至一般离散群,为近似等变性提供自然的形式化框架。在多个带有松弛对称性的任务上测试表明,基于GM的架构在性能上可媲美现有近似等变网络及基于结构矩阵的方法,通常仅需1至2个数量级更少的参数。
原文摘要 · Abstract (English)
There has been much recent interest in designing neural networks (NNs) with relaxed equivariance, which interpolate between exact equivariance and full flexibility for consistent performance gains. In a separate line of work, structured parameter matrices with low displacement rank (LDR) -- which permit fast function and gradient evaluation -- have been used to create compact NNs, though primarily benefiting classical convolutional neural networks (CNNs). In this work, we propose a framework based on symmetry-based structured matrices to build approximately equivariant NNs with fewer parameters. Our approach unifies the aforementioned areas using Group Matrices (GMs), a forgotten precursor to the modern notion of regular representations of finite groups. GMs allow the design of structured matrices similar to LDR matrices, which can generalize all the elementary operations of a CNN from cyclic groups to arbitrary finite groups. We show GMs can also generalize classical LDR theory to general discrete groups, enabling a natural formalism for approximate equivariance. We test GM-based architectures on various tasks with relaxed symmetry and find that our framework performs competitively with approximately equivariant NNs and other structured matrix-based methods, often with one to two orders of magnitude fewer parameters.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。