Pith. sign in

REVIEW 1 cited by

Revealing the Utilized Rank of Subspaces of Learning in Neural Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.04797 v1 pith:W2JCHKWF submitted 2024-07-05 cs.CV cs.LG

classification cs.CVcs.LG
keywords rankweightsavailablespacelayerlearnednetworkneural
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this work, we study how well the learned weights of a neural network utilize the space available to them. This notion is related to capacity, but additionally incorporates the interaction of the network architecture with the dataset. Most learned weights appear to be full rank, and are therefore not amenable to low rank decomposition. This deceptively implies that the weights are utilizing the entire space available to them. We propose a simple data-driven transformation that projects the weights onto the subspace where the data and the weight interact. This preserves the functional mapping of the layer and reveals its low rank structure. In our findings, we conclude that most models utilize a fraction of the available space. For instance, for ViTB-16 and ViTL-16 trained on ImageNet, the mean layer utilization is 35% and 20% respectively. Our transformation results in reducing the parameters to 50% and 25% respectively, while resulting in less than 0.2% accuracy drop after fine-tuning. We also show that self-supervised pre-training drives this utilization up to 70%, justifying its suitability for downstream tasks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On Information Geometry and Iterative Optimization in Model Compression: Operator Factorization

    cs.LG 2025-07 conditional novelty 5.0 of 10

    Compression methods can be seen as information projections, and iterative soft rank reduction, not the projection choice, dominates performance after fine-tuning, with a convergence proof for iterative singular value ...

Pith tools