In this paper, we study the problem of designing objective functions for machine learning problems defined on finite sets. In contrast to traditional objective functions defined for machine learning problems operating on finite dimensional vectors, the new objective functions we propose are operating on finite sets and are invariant to permutations. Such problems are widespread, ranging from estimation of population statistics , via anomaly detection in piezometer data of embankment dams (Jung et al., 2015) , to cosmology (Ntampaka et al., 2016; Ravanbakhsh et al., 2016a) . Our main theorem characterizes the permutation invariant objective functions and provides a family of functions to which any permutation invariant objective function must belong. This family of functions has a special structure which enables us to design a deep network architecture that can operate on sets and which can be deployed on a variety of scenarios including both unsupervised and supervised learning tasks. We demonstrate the applicability of our method on population statistic estimation, point cloud classification, set expansion, and image tagging.
Zaheer et al. REF has proven that the function that can be represented the following form is permutation-invariant:
Deep Sets
ArXiv
ArXiv
Mathematics Computer Science