How many bits does a network need before its accuracy collapses, and how does this grow with depth? We study the precision floor, the perturbation level or bit-width at which accuracy falls halfway to chance, in MLPs, CNNs, Vision Transformers and nine pretrained language models, under post-training quantization (PTQ)...
The Sign-Symmetric Hassanat Distance (SHasD), a single branch-free formula D(a,b)=|a−b|/(1+max(|a|,|b|)) that is invariant under the reflection x↦−x, coincides exactly with HasD on non-negative data, and removes the conditional shift entirely.
Mohammad Saad Alaydaa, Gaseb N. Alotibi, Ahmad S. Tarawneh et al.· Symmetry· 0 citations
The theoretical results provide a principled non-cross-validated alternative to the classical n rule, and cross-validation remains the strongest k-selection strategy when computationally feasible.
Ahmad Hassanat, A. A. Alkasasbeh, Esra’a Alkafaween et al.· Mathematics· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.