Any-dimensional invariant universality
Shengtai Yao, Eitan Levin, Mateo D Diaz
Abstract
Several machine learning models are defined for inputs of any size, such as graphs with different numbers of nodes and point clouds containing varying numbers of points. The universality properties of such any-dimensional models remain poorly understood, as universality is traditionally studied for models accepting inputs of a fixed size, defined on a compact subset of their domain. In sharp contrast, any-dimensional models can be viewed as sequences of functions defined on growing-sized inputs, and it is not clear in which sense they can be universal. We develop a systematic approach to establish any-dimensional universality, by identifying any-dimensional functions with a unique function taking inputs in a suitable infinite-dimensional limit space containing inputs of all finite sizes as well as their limits. Using the symmetries of these inputs and relations between inputs of different sizes, we show that this limit space admits a natural topology with rich families of compact sets on which any-dimensional universality can be established. We illustrate our approach by showing that several existing architectures fail to be universal, and we propose simple modifications that restore universality.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on11
- Fourier Neural Operator for Parametric Partial Differential EquationsZongyi Li, Nikola Borislavov Kovachki, Kamyar Azizzadenesheli, Burigede Liu et al.ICLR 2021 · 3,911 citations
- A Practical Method for Constructing Equivariant Multilayer Perceptrons for Arbitrary Matrix GroupsMarc Finzi, Max Welling, Andrew Gordon WilsonICML 2021 · 226 citations
- Graphon Neural Networks and the Transferability of Graph Neural NetworksLuana Ruiz, Luiz F. O. Chamon, Alejandro RibeiroNeurIPS 2020 · 188 citations
- Scalars are universal: Equivariant machine learning, structured like classical physicsSoledad Villar, David W. Hogg, Kate Storey-Fisher, Weichi Yao et al.NeurIPS 2021 · 185 citations
- Convergence and Stability of Graph Convolutional Networks on Large Random GraphsNicolas Keriven, Alberto Bietti, Samuel VaiterNeurIPS 2020 · 111 citations
Related papers
- On Transferring Transferability: Towards a Theory for Size GeneralizationEitan Levin, Yuxin Ma, Mateo Díaz, Soledad VillarNeurIPS 2025 · 10 citations
- On the Representation Power of Set Pooling NetworksChristian Bueno, Alan HyltonNeurIPS 2021 · 13 citations
- A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal ApproximationOfek Amran, Tom Gilat, Ron LevieICML 2026
- Random Sparse Lifts: Construction, Analysis and Convergence of finite sparse networksDavid A. R. Robin, Kevin Scaman, Marc LelargeICLR 2024
- A Functional Perspective on Learning Symmetric Functions with Neural NetworksAaron Zweig, Joan BrunaICML 2021 · 23 citations
