Universal approximations of permutation invariant/equivariant functions by deep neural networks
Akiyoshi Sannai, Yuuki Takai, Matthieu Cordonnier

TL;DR
This paper develops a theoretical framework showing that deep neural networks can universally approximate permutation invariant and equivariant functions with fewer parameters by incorporating group actions into their layers.
Contribution
It introduces a method to construct neural network approximators for G-invariant/equivariant functions that are more parameter-efficient using representation theory.
Findings
Neural networks can universally approximate G-invariant/equivariant functions.
The proposed models have exponentially fewer parameters than traditional approaches.
Representation theory underpins the construction of these efficient neural network approximators.
Abstract
In this paper, we develop a theory about the relationship between -invariant/equivariant functions and deep neural networks for finite group . Especially, for a given -invariant/equivariant function, we construct its universal approximator by deep neural network whose layers equip -actions and each affine transformations are -equivariant/invariant. Due to representation theory, we can show that this approximator has exponentially fewer free parameters than usual models.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Topic Modeling · Advanced Graph Neural Networks
