On Learning Sets of Symmetric Elements

By Haggai Maron, Or Litany, Gal Chechik, Ethan Fetaya. 2020

152 citations recorded by the source corpus.

Learning from unordered sets is a fundamental learning setup, recently attracting increasing attention. Research in this area has focused on the case where elements of the set are represented by feature vectors, and far less emphasis has been given to the common case where set elements themselves adhere to their own symmetries. That case is relevant to numerous applications, from deblurring image bursts to multi-view 3D shape recognition and reconstruction. In this paper, we present a principled approach to learning sets of general symmetric elements. We first characterize the space of linear layers that are equivariant both to element reordering and to the inherent symmetries of elements, like translation in the case of images. We further show that networks that are composed of these layers, called Deep Sets for Symmetric Elements layers (DSS), are universal approximators of both invariant and equivariant functions. DSS layers are also straightforward to implement. Finally, we show that they improve over existing set-learning architectures in a series of experiments with images, graphs, and point-clouds.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Stephan Günnemann
  2. Yi Ma
  3. Jiatao Gu
  4. Johannes Klicpera
  5. Leonidas J. Guibas
  6. Or Litany
  7. John Wright
  8. Chong You

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Ming-Hsuan Yang
  3. Dacheng Tao
  4. Jitendra Malik
  5. Xiaogang Wang
  6. Trevor Darrell
  7. Chen Change Loy
  8. Andrew Zisserman

Citations in the corpus