Submitted:
30 September 2026
Posted:
02 October 2026
You are already at the latest version
Abstract
Traditional deep learning architectures relying on standard affine layers partition the representation space into unbounded polyhedral regions, which inherently introduce systemic structural vulnerabilities when learning complex, non-convex data manifolds. To resolve these limitations, we introduce an alternative "bounded-by-design" geometric framework that completely moves beyond traditional affine transformations. By replacing hyperplanes entirely with variable-radius ball coverings, we reformulate layer mechanics around the fundamental metric of a feature point's proximity to localized multi-spherical anchor centers. Crucially, by mapping this distance metric directly onto localized, parallel inner products, the formulation fully preserves standard batch-level GPU parallelization performance without higher-order computational overhead. Mathematical and visual validation demonstrates that our bounded formulation effectively encapsulates complex topological boundaries, eliminates representational redundancy in empty background spaces, and structurally stabilizes error propagation at the mathematical root.
Keywords:
ball neural networks
; ball covering
; spherical coverings
; geometric deep learning
; vector reduction
; hardware compliance
; metric stability
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.