pith. sign in

arxiv: 1812.03928 · v3 · pith:ATCYYAFInew · submitted 2018-12-10 · 💻 cs.LG · cs.CV· stat.ML

Learning Representations of Sets through Optimized Permutations

classification 💻 cs.LG cs.CVstat.ML
keywords learnrepresentationssetsimagemosaicspermutation-invariantpermutationsability
0
0 comments X
read the original abstract

Representations of sets are challenging to learn because operations on sets should be permutation-invariant. To this end, we propose a Permutation-Optimisation module that learns how to permute a set end-to-end. The permuted set can be further processed to learn a permutation-invariant representation of that set, avoiding a bottleneck in traditional set models. We demonstrate our model's ability to learn permutations and set representations with either explicit or implicit supervision on four datasets, on which we achieve state-of-the-art results: number sorting, image mosaics, classification from image mosaics, and visual question answering.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Adaptive Canonicalization with Application to Invariant Anisotropic Geometric Networks

    cs.LG 2025-09 unverdicted novelty 6.0

    Adaptive canonicalization selects input canonical forms by maximizing network predictive confidence to yield continuous symmetry-preserving models with universal approximation for equivariant geometric networks.