In many real-world settings, we are interested in learning invariant and
equivariant functions over nested or multiresolution structures, such as a set
of sequences, a graph of graphs, or a multiresolution image. While equivariant
linear maps and by extension multilayer perceptrons (MLPs) for many of the
individual basic structures are known, a formalism for dealing with a hierarchy
of symmetry transformations is lacking. Observing that the transformation group
for a nested structure corresponds to the ``wreath product'' of the symmetry
groups of the building blocks, we show how to obtain the equivariant map for
hierarchical data-structures using an intuitive combination of the equivariant
maps for the individual blocks. To demonstrate the effectiveness of this type
of model, we use a hierarchy of translation and permutation symmetries for
learning on point cloud data, and report state-of-the-art on semantic3d
and s3dis, two of the largest real-world benchmarks for 3D semantic
segmentation.
Description
[2006.03627] Equivariant Maps for Hierarchical Structures
%0 Journal Article
%1 wang2020equivariant
%A Wang, Renhao
%A Albooyeh, Marjan
%A Ravanbakhsh, Siamak
%D 2020
%K deep-learning equivariance
%T Equivariant Maps for Hierarchical Structures
%U http://arxiv.org/abs/2006.03627
%X In many real-world settings, we are interested in learning invariant and
equivariant functions over nested or multiresolution structures, such as a set
of sequences, a graph of graphs, or a multiresolution image. While equivariant
linear maps and by extension multilayer perceptrons (MLPs) for many of the
individual basic structures are known, a formalism for dealing with a hierarchy
of symmetry transformations is lacking. Observing that the transformation group
for a nested structure corresponds to the ``wreath product'' of the symmetry
groups of the building blocks, we show how to obtain the equivariant map for
hierarchical data-structures using an intuitive combination of the equivariant
maps for the individual blocks. To demonstrate the effectiveness of this type
of model, we use a hierarchy of translation and permutation symmetries for
learning on point cloud data, and report state-of-the-art on semantic3d
and s3dis, two of the largest real-world benchmarks for 3D semantic
segmentation.
@article{wang2020equivariant,
abstract = {In many real-world settings, we are interested in learning invariant and
equivariant functions over nested or multiresolution structures, such as a set
of sequences, a graph of graphs, or a multiresolution image. While equivariant
linear maps and by extension multilayer perceptrons (MLPs) for many of the
individual basic structures are known, a formalism for dealing with a hierarchy
of symmetry transformations is lacking. Observing that the transformation group
for a nested structure corresponds to the ``wreath product'' of the symmetry
groups of the building blocks, we show how to obtain the equivariant map for
hierarchical data-structures using an intuitive combination of the equivariant
maps for the individual blocks. To demonstrate the effectiveness of this type
of model, we use a hierarchy of translation and permutation symmetries for
learning on point cloud data, and report state-of-the-art on \kw{semantic3d}
and \kw{s3dis}, two of the largest real-world benchmarks for 3D semantic
segmentation.},
added-at = {2020-06-18T20:07:19.000+0200},
author = {Wang, Renhao and Albooyeh, Marjan and Ravanbakhsh, Siamak},
biburl = {https://www.bibsonomy.org/bibtex/2cd6cae2e3afaad108940c26737b220c6/kirk86},
description = {[2006.03627] Equivariant Maps for Hierarchical Structures},
interhash = {8974317fbe38049fa0f850dea642822e},
intrahash = {cd6cae2e3afaad108940c26737b220c6},
keywords = {deep-learning equivariance},
note = {cite arxiv:2006.03627},
timestamp = {2020-06-18T20:07:19.000+0200},
title = {Equivariant Maps for Hierarchical Structures},
url = {http://arxiv.org/abs/2006.03627},
year = 2020
}