Neural Spectral Capacity: Measuring and Designing Architectures from Network Specification Alone
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 34 of its 47 references that are in the map. First posted on arXiv 19 Sep 2026.
Builds on
34 of 47 references.
References · 34
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
- 2019Transformer-XL: Attentive Language Models Beyond a Fixed-Length Contextcited by 1,850
- 2024Mixtral of Expertscited by 1,823
- 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,346
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2018Regularized Evolution for Image Classifier Architecture Searchcited by 909
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
- 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 787
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 479
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 415
22 more
- 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 413
- 2020Neural Architecture Search without Trainingcited by 244
- 2017High-dimensional dynamics of generalization error in neural networkscited by 241
- 2018Implicit Self-Regularization in Deep Neural Networks: Evidence from Random Matrix Theory and Implications for Learningcited by 215
- 2021Zero-Cost Proxies for Lightweight NAScited by 199
- 2021AutoFormer: Searching Transformers for Visual Recognitioncited by 188
- 2021Neural Architecture Search on ImageNet in Four GPU Hours: A Theoretically Inspired Perspectivecited by 169
- 2017Resurrecting the sigmoid in deep learning through dynamical isometry: theory and practicecited by 132
- 2020NATS-Bench: Benchmarking NAS Algorithms for Architecture Topology and Sizecited by 98
- 2019Network Pruning via Transformable Architecture Searchcited by 80
- 2020Spectra of the Conjugate Kernel and Neural Tangent Kernel for linear-width neural networkscited by 77
- 2023ZiCo: Zero-shot NAS via Inverse Coefficient of Variation on Gradientscited by 58
- 2022Training-free Transformer Architecture Searchcited by 33
- 2024AZ-NAS: Assembling Zero-Cost Proxies for Network Architecture Searchcited by 28
- 2022LiteTransformerSearch: Training-free Neural Architecture Search for Efficient Language Modelscited by 14
- 2022FlexiBERT: Are Current Transformer Architectures too Homogeneous and Rigid?cited by 12
- 2023Training-free Neural Architecture Search for RNNs and Transformerscited by 9
- 2023Enhancing Accuracy in Deep Learning Using Random Matrix Theorycited by 5
- 2025RBFleX-NAS: Training-Free Neural Architecture Search Using Radial Basis Function Kernel and Hyperparameter Detectioncited by 4
- 2020On the Maximum Mutual Information Capacity of Neural Architecturescited by 2
- 2025ZeroLM: Data-Free Transformer Architecture Search for Language Modelscited by 2
- 2025W-PCA Based Gradient-Free Proxy for Efficient Search of Lightweight Language Modelscited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026The Von-Neumann State-Space Transformer for neural decoding
- 2025Transformer^-1: Input-Adaptive Computation for Resource-Constrained Deployment
- 2023Brainformers: Trading Simplicity for Efficiency
- 2026Mixture of Chapters: Scaling Learnt Memory in Transformers
- 2026Finite-Time Analysis of Gradient Descent for Shallow Transformers
- 2026Sparsity Moves Computation: How FFN Architecture Reshapes Attention in Small Transformers
- 2024Resource-Efficient Transformer Architecture: Optimizing Memory and Execution Time for Real-Time Applications
- 2026The Recurrent Transformer: Greater Effective Depth and Efficient Decoding