aiqbench analysis
This paper introduces Partition of Unity Neural Networks (PUNNs), a novel architecture that replaces standard softmax normalization with continuous functions derived from the mathematical concept of partitions of unity. By explicitly modeling class regions through recursive input-dependent gates, PUNNs offer improved interpretability and parameter efficiency while maintaining universal approximation capabilities for multiclass classification tasks. The approach demonstrates that incorporating geometric information into gate design can achieve comparable accuracy to conventional models with significantly fewer trainable parameters.
Partition of Unity Neural Networks for Interpretable Classification with Explicit Class Regions
arXiv:2602.00511v3 Announce Type: replace Abstract: We introduce \emph{Partition of Unity Neural Networks} (PUNNs), a neural-network architecture for multiclass classification based on the classical mathematical notion of a partition of unity. The starting point is the observation that the characteristic functions of ideal class regions form a partition of unity. PUNNs replace these discontinuous indicators by learned continuous functions \[ h_1,\ldots,h_C:\mathcal X\to[0,1] \] whose sum is identically one and whose values are interpreted directly as class probabilities. The partition functions are generated through a recursive family of input-dependent gates. This construction guarantees nonnegative class probabilities summing to one without a separate normalization layer such as softmax, while providing an explicit ordered factorization of each probability in terms of the gate values. The resulting gate trace gives an interpretable representation of how individual class probabilities are formed. The framework also allows multiple partition functions to represent a single class and admits both neural-network and geometry-informed realizations of the gates. We prove that PUNNs are dense in the space of continuous probability maps from compact subsets of $\mathbb R^d$ into the probability simplex. Thus, the recursive partition-of-unity structure retains universal approximation of continuous probabilistic classifiers, including maps whose components may vanish. Numerical experiments on synthetic datasets, MNIST, and CIFAR-100 illustrate the learned partitions, the effect of class ordering, and the use of multiple partition components per class. We also develop shape-informed gates that incorporate geometric information directly; when the chosen geometry is well matched to the class regions, these models achieve comparable accuracy with substantially fewer trainable parameters.
Abstract:We introduce \emph{Partition of Unity Neural Networks} (PUNNs), a neural-network architecture for multiclass classification based on the classical mathematical notion of a partition of unity. The starting point is the observation that the characteristic functions of ideal class regions form a partition of unity. PUNNs replace these discontinuous indicators by learned continuous functions \[ h_1,\ldots,h_C:\mathcal X\to[0,1] \] whose sum is identically one and whose values are interpreted directly as class probabilities. The partition functions are generated through a recursive family of input-dependent gates. This construction guarantees nonnegative class probabilities summing to one without a separate normalization layer such as softmax, while providing an explicit ordered factorization of each probability in terms of the gate values. The resulting gate trace gives an interpretable representation of how individual class probabilities are formed. The framework also allows multiple partition functions to represent a single class and admits both neural-network and geometry-informed realizations of the gates. We prove that PUNNs are dense in the space of continuous probability maps from compact subsets of $\mathbb R^d$ into the probability simplex. Thus, the recursive partition-of-unity structure retains universal approximation of continuous probabilistic classifiers, including maps whose components may vanish. Numerical experiments on synthetic datasets, MNIST, and CIFAR-100 illustrate the learned partitions, the effect of class ordering, and the use of multiple partition components per class. We also develop shape-informed gates that incorporate geometric information directly; when the chosen geometry is well matched to the class regions, these models achieve comparable accuracy with substantially fewer trainable parameters.
Machine Learning (cs.LG); Optimization and Control (math.OC)
arXiv:2602.00511 [cs.LG]
(or arXiv:2602.00511v3 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2602.00511 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 346 words
Related coverage
Localized Operator Learning with Adaptive Partition-of-Unity Mixture-of-Expert Networks
arXiv · Oct 6, 2026

Game Engines Explained: How They Work, Why They Cost So Much, and Where Theyre Going Next
wccftech.com · Sep 30, 2026
Specific Algorithmic Interpretability of Neural Networks: A Case Study on Textures
arXiv · Oct 7, 2026
Interpretable EEG biomarkers with bag-of-waves: Spatial and temporal waveform dictionaries for low-data regimes
arXiv · Jul 27, 2026