aiqbench analysis
This research quantifies functional degeneracy in trained models by measuring the behavioral recovery rank, offering a geometric benchmark for determining how much compression is possible without performance loss. The findings indicate that structural and magnitude pruning preserve significant degrees of freedom even after task saturation, revealing that functional redundancy is distributed across parameter directions rather than isolated to specific weights or neurons.
Functional Degeneracy in Neural Networks: Measurement and Pruning
arXiv:2608.30741v1 Announce Type: new Abstract: A central question in modern machine learning is how much a trained model can be compressed without changing its behavior, to reduce the memory, compute and energy required to deploy it. To study this, we quantify functional degeneracy through the behavioral recovery rank, defined as the number of leading behavioral-Hessian eigendirections required to recover a trained model's performance. Using the behavioral recovery rank as a geometric benchmark for compression, we find that structural and magnitude pruning retain more degrees of freedom, even after the task is saturated. This gap suggests that functional redundancy is distributed across parameter directions and is not exposed by individual weights or neurons.
Abstract:A central question in modern machine learning is how much a trained model can be compressed without changing its behavior, to reduce the memory, compute and energy required to deploy it. To study this, we quantify functional degeneracy through the behavioral recovery rank, defined as the number of leading behavioral-Hessian eigendirections required to recover a trained model's performance. Using the behavioral recovery rank as a geometric benchmark for compression, we find that structural and magnitude pruning retain more degrees of freedom, even after the task is saturated. This gap suggests that functional redundancy is distributed across parameter directions and is not exposed by individual weights or neurons.
Machine Learning (cs.LG)
arXiv:2608.30741 [cs.LG]
(or arXiv:2608.30741v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2608.30741 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
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 · 201 words
Related coverage

Molybdenum disulfide transistors reshape spiking neural networks
Quantum Zeitgeist · Sep 14, 2026
Traversing the solution space of neural networks with Hessian Null Space Continuation
arXiv · Sep 30, 2026

How Does Changing the Elo of a Chess Transformer Affect its Computations?
LessWrong · Sep 29, 2026
IPPRO: Importance-based Pruning with PRojective Offset for Magnitude-indifferent Structural Pruning
arXiv · Aug 5, 2026