A Rigorous, Tractable Measure of Model Complexity
This paper introduces a rigorous and computationally efficient measure of model complexity based on input gradient similarities that unifies various existing metrics and provides new insights into the double descent phenomenon across diverse model architectures.