arXiv (All)
open access
DyRA: Dynamic Residual Approximation for Efficient Matrix Multiplication in DNNs
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,
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- LOCALITY DRIVEN OPTIMIZATION FOR RESOURCE-EFFICIENT MACHINE LEARNING INFERENCE#631204
- PrismStencil: Transforming Stencil Computations into Matrix Multiplications#1343893
- CORTEX: Learning to Share and Specialize in Dense Language Models#1128719
- Supervised Deep Multimodal Matrix Factorization for Interpretable Brain Network Analysis#1105049
- Diamond: Harnessing GPU resources for scientific deep learning#358992
Record · ID 1187560
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive