Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchMachine learning

analiza aiqbench

EinSort introduces an adaptive tensorization method that leverages simple index ordering to uncover low-rank structures in large foundation models, effectively addressing the challenge of unstructured weight distributions. By applying this approach to weight and KV-cache compression, the method achieves improved reconstruction quality over existing baselines, offering a practical pathway to reduce memory and computational costs. This technique represents a significant step forward in optimizing tensor network topologies for efficient LLM deployment without relying on complex manual design.
Sursă care acoperăarXiv
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

EinSort: Sorting is All We Need for Tensorizing LLM

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2606.08565v1 Announce Type: new Abstract: Tensor networks provide efficient representations for compressing large neural networks. By carefully designing shapes and topologies, they can significantly reduce memory and computational costs. However, identifying implicit low-rank structures in large foundation models remains challenging due to their enormous scale and un-structured weight distributions. We propose an adaptive tensorization method that discovers inherent low-rank structure in a target tensor by index ordering. Experiments on weight and KV-cache compression demonstrate improved reconstruction quality compared to baselines.

Abstract:Tensor networks provide efficient representations for compressing large neural networks. By carefully designing shapes and topologies, they can significantly reduce memory and computational costs. However, identifying implicit low-rank structures in large foundation models remains challenging due to their enormous scale and un-structured weight distributions. We propose an adaptive tensorization method that discovers inherent low-rank structure in a target tensor by index ordering. Experiments on weight and KV-cache compression demonstrate improved reconstruction quality compared to baselines.

Machine Learning (cs.LG); Artificial Intelligence (cs.AI)

arXiv:2606.08565 [cs.LG]

(or arXiv:2606.08565v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2606.08565 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 172 cuvinte

Subiecte conexe