Skeletal Prototypes on Iterative Nerve Expansions
Abstract
Prototype reduction replaces a training set with a smaller representation, and the established methods return a finite set of points. We propose Skeletal Prototypes on Iterative Nerve Expansions (SPINE). The model for each class is an embedded 1-complex rather than a point set. Its initial edge set is a class-conditional Mapper graph, so the data decide which localized clusters are joined. Later phases fit the vertices under a classification objective, and an observation is assigned to the class whose complex is nearest. The segments therefore enter the decision rule and not only the fitting. We evaluate SPINE on seventeen benchmark datasets under stratified 10-fold cross validation, against seven other prototype reduction methods at a matched budget. SPINE attains the highest mean accuracy and the best average rank. It is significantly better than five of the seven competitors under Wilcoxon signed-rank tests with Holm correction. A budget sweep shows that the decision rule using the entire graph segments contribute most when prototypes are scarce, while the method as a whole competes best at moderate budgets. Construction cost places SPINE with the discriminative methods, and it is faster than generalized learning vector quantization on fourteen of the seventeen datasets.
Related
- Character expansions and affine Jacobi-Trudi identities
- Transcendence of dendric beta-expansions with pure discrete spectrum
- On differentiability in weakly o-minimal expansions of fields
- Ramanujan-Type Series of Signature 2: Analytical Evaluation via Degree-2 Transformations and Associated Harmonic Expansions
- Representations of shifted quantum affine algebras and cluster algebras II: Non simply-laced types and cluster expansions
BibTeX
@misc{eckert2026skeletal,
title = {{Skeletal Prototypes on Iterative Nerve Expansions}},
author = {Jordan Eckert and Henry Schenck},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.16170},
eprint = {2609.16170},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.16170},
note = {CC0},
}
RIS
TY - UNPB
TI - Skeletal Prototypes on Iterative Nerve Expansions
AU - Jordan Eckert
AU - Henry Schenck
PY - 2026
DA - 2026/09/14
PB - arXiv
DO - 10.48550/arxiv.2609.16170
UR - https://arxiv.org/abs/2609.16170
AB - Prototype reduction replaces a training set with a smaller representation, and the established methods return a finite set of points. We propose Skeletal Prototypes on Iterative Nerve Expansions (SPINE). The model for each class is an embedded 1-complex rather than a point set. Its initial edge set is a class-conditional Mapper graph, so the data decide which localized clusters are joined. Later phases fit the vertices under a classification objective, and an observation is assigned to the class whose complex is nearest. The segments therefore enter the decision rule and not only the fitting. We evaluate SPINE on seventeen benchmark datasets under stratified 10-fold cross validation, against seven other prototype reduction methods at a matched budget. SPINE attains the highest mean accuracy and the best average rank. It is significantly better than five of the seven competitors under Wilcoxon signed-rank tests with Holm correction. A budget sweep shows that the decision rule using the entire graph segments contribute most when prototypes are scarce, while the method as a whole competes best at moderate budgets. Construction cost places SPINE with the discriminative methods, and it is faster than generalized learning vector quantization on fourteen of the seventeen datasets.
ER -