Resource-Efficient Pruning for Transformer via Low-Rank Importance Estimation
cs.LG, cs.AI, cs.ET
Submitted: 2026-08-25
Updated: 2026-08-25
Comments: 15 pages, 9 figures
Journal ref: IEEE Transactions on Emerging Topics in Computational Intelligence, 2026
DOI: 10.1109/TETCI.2026.3727362
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Fine-tune BERT for Extractive Summarization
- A Survey on Transformer Compression
- Compresso: Structured Pruning with Collaborative Prompting Learns Compact Large Language Models
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks