Monotone and Separable Set Functions: Characterizations and Neural Models
Not on the map. Why?
Abstract (arXiv)
Motivated by applications for set containment problems, we consider the following fundamental problem: can we design set-to-vector functions so that the natural partial order on sets is preserved, namely Ssubseteq T if and only if F(S)≤ F(T) . We call functions satisfying this property Monotone and Separating (MAS) set functions. % We establish lower and upper bounds for the vector dimension necessary to obtain MAS functions, as a function of the cardinality of the multisets and the underlying ground set. In the important case of an infinite ground set, we show that MAS functions do not exist, but provide a model called our which provably enjoys a relaxed MAS property we name "weakly MAS" and is stable in the sense of Holder continuity. We also show that MAS functions can be used to construct universal models that are monotone by construction and can approximate all monotone set functions. Experimentally, we consider a variety of set containment tasks. The experiments show the benefit of using our our model, in comparison with standard set models which do not incorporate set containment as an inductive bias. Our code is available in https://github.com/structlearning/MASNET.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 20 of its 47 references that are in the map. First posted on arXiv 24 Oct 2025.
Builds on
20 of 47 references.
References · 20
- 2016PointNet: Deep Learning on Point Sets for 3D Classification and Segmentationcited by 5,223
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2017Deep Setscited by 1,394
- 2017The Expressive Power of Neural Networks: A View from the Widthcited by 318
- 2018Analyzing Inverse Problems with Invertible Neural Networkscited by 239
- 2019Unconstrained Monotonic Neural Networkscited by 91
- 2019On the Limitations of Representing Functions on Setscited by 89
- 2017Deep Lattice Networks and Partial Monotonic Functionscited by 62
- 2023Neural Injective Functions for Multisets, Measures and Graphs via a Finite Witness Theoremcited by 33
- 2022Permutation Invariant Representations with Applications to Graph Deep Learningcited by 20
- 2022Neural Set Function Extensions: Learning with Discrete Functions in High Dimensionscited by 14
- 2022DESSERT: An Efficient Algorithm for Vector Set Search with Vector Set Queriescited by 10
8 more
- 2024FSW-GNN: A Bi-Lipschitz WL-Equivalent Graph Neural Networkcited by 8
- 2025Fourier Sliced-Wasserstein Embedding for Multisets and Measurescited by 8
- 2021Mini-Batch Consistent Slot Set Encoder for Scalable Set Encodingcited by 6
- 2022Neural Estimation of Submodular Functions with Applications to Differentiable Subset Selectioncited by 6
- 2023Polynomial Width is Sufficient for Set Representation with High-dimensional Featurescited by 6
- 2024On the H"older Stability of Multiset and Graph Neural Networkscited by 6
- 2022Scalable Set Encoding with Universal Mini-Batch Consistency and Unbiased Full Set Gradient Approximationcited by 4
- 2025Monotonic Learning in the PAC Framework: A New Perspectivecited by 1
Built on by
Not cited yet.