FSPool: Learning Set Representations with Featurewise Sort Pooling
Yan Zhang, Jonathon Hare, Adam Pr\"ugel-Bennett

TL;DR
FSPool introduces a sorting-based pooling method for set representations that improves auto-encoder reconstructions and enhances accuracy and convergence in set encoding tasks.
Contribution
The paper proposes FSPool, a novel permutation-equivariant pooling method based on feature sorting, addressing the responsibility problem in set prediction models.
Findings
FSPool yields better reconstructions on toy and MNIST datasets.
Replacing pooling with FSPool improves accuracy and convergence speed.
Auto-encoders with FSPool outperform traditional methods.
Abstract
Traditional set prediction models can struggle with simple datasets due to an issue we call the responsibility problem. We introduce a pooling method for sets of feature vectors based on sorting features across elements of the set. This can be used to construct a permutation-equivariant auto-encoder that avoids this responsibility problem. On a toy dataset of polygons and a set version of MNIST, we show that such an auto-encoder produces considerably better reconstructions and representations. Replacing the pooling function in existing set encoders with FSPool improves accuracy and convergence speed on a variety of datasets.
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Machine Learning and Data Classification · Machine Learning and Algorithms
MethodsSPEED: Separable Pyramidal Pooling EncodEr-Decoder for Real-Time Monocular Depth Estimation on Low-Resource Settings
