v-PuNNs: van der Put Neural Networks for Transparent Ultrametric Representation Learning
Not on the map. Why?
Abstract (arXiv)
Conventional deep learning models embed data in Euclidean space ℝd, a poor fit for strictly hierarchical objects such as taxa, word senses, or file systems. We introduce van der Put Neural Networks (v-PuNNs), the first architecture whose neurons are characteristic functions of p-adic balls in mathbbZp. Under our Transparent Ultrametric Representation Learning (TURL) principle every weight is itself a p-adic number, giving exact subtree semantics. A new Finite Hierarchical Approximation Theorem shows that a depth-K v-PuNN with sumj=0K-1p,j neurons universally represents any K-level tree. Because gradients vanish in this discrete space, we propose Valuation-Adaptive Perturbation Optimization (VAPO), with a fast deterministic variant (HiPaN-DS) and a moment-based one (HiPaN / Adam-VAPO). On three canonical benchmarks our CPU-only implementation sets new state-of-the-art: WordNet nouns (52,427 leaves) 99.96% leaf accuracy in 16 min; GO molecular-function 96.9% leaf / 100% root in 50 s; NCBI Mammalia Spearman ρ = -0.96 with true taxonomic distance. The learned metric is perfectly ultrametric (zero triangle violations), and its fractal and information-theoretic properties are analyzed. Beyond classification we derive structural invariants for quantum systems (HiPaQ) and controllable generative codes for tabular data (Tab-HiPaN). v-PuNNs therefore bridge number theory and deep learning, offering exact, interpretable, and efficient models for hierarchical data.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 11 of its 40 references that are in the map. First posted on arXiv 1 Aug 2025.
Builds on
11 of 40 references.
References · 11
- 2017On Calibration of Modern Neural Networkscited by 4,960
- 2019On the Convergence of Adam and Beyondcited by 841
- 2017Poincar'e Embeddings for Learning Hierarchical Representationscited by 684
- 2015Improved Semantic Representations From Tree-Structured Long Short-Term Memory Networkscited by 306
- 2018Learning Continuous Hierarchies in the Lorentz Model of Hyperbolic Geometrycited by 265
- 2018Representation Tradeoffs for Hyperbolic Embeddingscited by 206
- 2021Hierarchical Transformers Are More Efficient Language Modelscited by 102
- 2016Efficient softmax approximation for GPUscited by 67
- 2024Graph Transformers: A Surveycited by 32
- 2024View-Consistent Hierarchical 3D Segmentation Using Ultrametric Feature Fieldscited by 8
- 2024Hierarchical Neural Networks, p-Adic PDEs, and Applications to Image Processingcited by 3
Built on by
Citing papers per year: 2026: 5.
5 papers.
- 2026p-adic Character Neural Networkcited by 2
- 2026p-adic Manifold Learning and Benchmark Tasks from Impartial Gamescited by 0
- 2026p-adic Bi-Filtrations for Topological Machine Learning on Genomic Sequencescited by 0
- 2026On Hamming-Lipschitz Type Stability of the Subdominant (Minmax) Ultrametric: Theory and Simple Proofscited by 0
- 2026Continuous Optimization for p-adic Modelscited by 0
- 2026Continuous Optimization for p-adic Models21 Sep 2026
- 2026p-adic Bi-Filtrations for Topological Machine Learning on Genomic Sequences4 Jun 2026
- 2026p-adic Manifold Learning and Benchmark Tasks from Impartial Games6 May 2026
- 2026On Hamming-Lipschitz Type Stability of the Subdominant (Minmax) Ultrametric: Theory and Simple Proofs27 Apr 2026
- 2026p-adic Character Neural Network31 Mar 2026