$\mathcal{O}(\log N)$ Latent Dimension Suffices for Universal Approximation of Permutation-invariant Function
Learning permutation-invariant functions over sets of $N$ elements is fundamental to many deep learning applications. While sum-decomposable architectures like DeepSets theoretically offer universal approximation capabilities for such functions, existing constructive bounds suggest that the latent d…