DyRA: Dynamic Residual Approximation for Efficient Matrix Multiplication in DNNs
cs.LG, cs.AI
Submitted: 2026-10-02
Updated: 2026-10-02
Comments: NeurIPS 2026. Code: https://github.com/daewon88/DyRA
Code: https://github.com/daewon88/DyRA
License: http://creativecommons.org/licenses/by/4.0/
The gist: Large-scale foundation models achieve strong performance across diverse tasks, but their size makes inference costly, largely due to dense matrix multiplications.
Abstract
Large-scale foundation models achieve strong performance across diverse tasks, but their size makes inference costly, largely due to dense matrix multiplications. Prior work reduces this cost by replacing dense weight matrices with efficient structured forms such as low-rank factorizations. However, these methods approximate weights rather than the output activations that determine inference accuracy. Consequently, small weight-space errors can be amplified by input activations, producing large output errors. In this work, we propose DyRA, an input-adaptive method that improves structured matrix multiplication approximation by correcting residual output errors during inference. We show that matrix multiplication can be approximated more effectively by directly optimizing low-rank factors of the output. DyRA builds on this insight by dynamically approximating and correcting the output error introduced by structured weight approximations. This combines efficient structured computation with input-dependent correction, yielding a more faithful approximation of full matrix multiplication under the same computational budget. Across vision, speech, and language models, DyRA consistently improves the accuracy-efficiency trade-off over structured weight approximations alone. Notably, DyRA achieves a 1.5 times end-to-end GPU speedup for DINOv3 while reducing accuracy degradation by more than 3 times relative to weight-only baselines.
Sources
- Memory-Efficient Acceleration of Block Low-Rank Foundation Models on Resource Constrained GPUs
- An Overview of Low-Rank Structures in the Training and Adaptation of Large Models
- Evaluating Large Language Models Trained on Code
- Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge
- Training Verifiers to Solve Math Word Problems
- Alternating Strategies Are Good For Low-Rank Matrix Reconstruction
- Decoupled Weight Decay Regularization
- ImageNet-21K Pretraining for the Masses
- DINOv3
- LLaMA: Open and Efficient Foundation Language Models
- ASVD: Activation-aware Singular Value Decomposition for Compressing 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