On The Limitations Of Representing Functions On Sets

# On the Limitations of Representing Functions on Sets

**arXiv ID:** 1901.09006
**Authors:** Edward Wagstaff, Fabian B. Fuchs, Martin Engelcke, Ingmar Posner, Michael Osborne
**Published:** 2019-01-25T18:11:52Z
**Abstract:**
Recent work on the representation of functions on sets has considered the use of summation in a latent space to enforce permutation invariance. In particular, it has been conjectured that the dimension of this latent space may remain fixed as the cardinality of the sets under consideration increases. However, we demonstrate that the analysis leading to this conjecture requires mappings which are highly discontinuous and argue that this is only of limited practical use. Motivated by this observation, we prove that an implementation of this model via continuous mappings (as provided by e.g. neural networks or Gaussian processes) actually imposes a constraint on the dimensionality of the latent space. Practical universal function representation for set inputs can only be achieved with a latent dimension at least the size of the maximum number of input elements.

## Skill Description

This skill is generated from the arXiv paper: On the Limitations of Representing Functions on Sets (1901.09006).

## How to Use

[To be filled in by the user or by future automation]

## References

- [arXiv:1901.09006](http://arxiv.org/abs/1901.09006v2)