Neural Spectral Capacity: Measuring and Designing Architectures from Network Specification Alone
Abstract
Modern Transformer design and compression both reduce to allocating capacity under a budget. The standard scalars for these decisions, #Params and #FLOPs, capture size and compute but not architectural structure: two architectures with identical parameter budgets but different depth-width, head, or FFN allocations receive identical scores yet behave differently. We propose Neural Spectral Capacity (NSC), a closed-form scalar grounded in the singular-value spectrum of each weight matrix. Under standard random initialization, the Marchenko-Pastur law renders NSC computable from the architectural specification alone, with no model instantiation, data, or gradients. Its layer-wise additive structure admits NSC-DP, an exact dynamic-programming solver returning the architecture globally maximizing NSC under resource constraints in seconds on a CPU -- a guarantee that black-box search over existing training-free proxies cannot provide. Empirically, NSC outperforms #Params, #FLOPs, and representative training-free proxies in ranking across seven Transformer and CNN families (on FlexiBERT, τ= 0.505 on pairs differing in #Params by less than 10%, where #Params collapses to 0.082); NSC-DP discovers a Transformer-XL architecture on WikiText-103 that beats the human-designed baseline in 2 seconds; and prunes LLaMA-7B to the best 5.7B model across eight commonsense reasoning tasks without any calibration data, about 5900x faster than the strongest training-free proxy baseline.
Community
TL;DR: NSC scores a Transformer architecture from its specification alone — no model
instantiation, no data, no gradients — and because the score is additive across layers,
maximizing it under a budget is an exact dynamic program rather than a black-box search.
Under standard random initialization, the Marchenko–Pastur law turns each weight matrix's
singular-value spectrum into a closed-form function of its shape and initialization variance.
Summing over the network gives NSC; a bounded-knapsack DP (NSC-DP) then returns the architecture
that globally maximizes it under a parameter or FLOPs budget.
- Ranking: τ = 0.695 on FlexiBERT (500 BERT architectures), vs. 0.485 for #Params and 0.635 for
W-PCA. On pairs whose #Params differ by <10%, NSC keeps τ = 0.505 where #Params collapses to 0.082. - Search: a Transformer-XL architecture on WikiText-103 that beats the human-designed baseline
(23.087 vs. 23.279 PPL), found in 2 seconds on one CPU core. - Pruning: LLaMA-7B → 5.7B, best across eight commonsense tasks without any calibration data,
~5,900× faster than the strongest training-free proxy baseline.
Accepted at NeurIPS 2026. Code: https://github.com/Optima-CityU/neural-spectral-capacity
This is an automated message from the Librarian Bot. I found the following papers similar to this paper.
The following papers were recommended by the Semantic Scholar API
- LILA: Calibration-Free Structured Pruning of Large Language Models via Latent Spectral Geometry (2026)
- KV-COBRA: KV Cache Compression via Co-Optimized Bit-Rank Allocation (2026)
- Frozen Cores Need Task Signal: Fisher-Whitened Cross-Covariance for Low-Resource LLM Adaptation (2026)
- MoARa: Module-Aware Rank Allocation and Structure-Preserving Decomposition for Low-Rank LLM Pre-training (2026)
- Dense Structural Compression of Transformers via Gauge-Correct Channel Removal (2026)
- Beyond Scalar Sensitivity: Activation-Aware Mixed-Precision LLM Quantization with Cross-Layer Refinement (2026)
- LowRank-SSM: Hardware-Software Co-Design for Rank-Reduced Mamba Acceleration on FPGA (2026)
Please give a thumbs up to this comment if you found it helpful!
If you want recommendations for any Paper on Hugging Face checkout this Space
You can directly ask Librarian Bot for paper recommendations by tagging it in a comment: @librarian-bot recommend
Models citing this paper 0
No model linking this paper
Datasets citing this paper 0
No dataset linking this paper
Spaces citing this paper 0
No Space linking this paper