paper-with-me

홈 › Papers

Efficient Pre-Training of LLMs through Truncated SVD Layers

2026-05-27 · Kaivan Kamali, Kajetan Schweighofer, Hormoz Shahrzad, Olivier Francon, Babak Hodjat, Risto Miikkulainen arxiv

The massive scaling of Large Language Models (LLMs) has made pretraining increasingly cost-prohibitive. While low-rank representation and orthonormal weight matrices could in principle reduce parameter counts and computational overhead, most existing methods rely on static rank selection and do not enforce weight orthonormality due to high computational cost. This paper introduces TSVD, a framework that maintains low rank and strict orthonormality throughout the training process. It utilizes a spectral energy-based heuristic for adaptive rank selection, and a caching mechanisms to maintain orthonormality. Theoretical analysis justifies the advantage of the approach in pretraining dynamics and experiments across various model scales demonstrate that it is effective empirically. TSVD matches or exceeds the performance of full-parameter baselines while significantly reducing compute requirements. The approach thus offers a well-founded, practical, and scalable path toward efficient high-performance LLM pretraining.

📄 PDF Abstract BibTeX arXiv:2605.28573

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Chopout: A Simple Way to Train Variable Sized Neural Networks at Once

2018-10-16 · Tatsuya Shirakawa

Large deep neural networks require huge memory to run and their running speed is sometimes too slow for real applications. Therefore network size reduction with keeping accuracy is crucial for practical applications. We…

Tensor network compressibility of convolutional models

2024-03-21 · Sukhbinder Singh, Saeed S. Jahromi, Roman Orus

Convolutional neural networks (CNNs) are one of the most widely used neural network architectures, showcasing state-of-the-art performance in computer vision tasks. Although larger CNNs generally exhibit higher accuracy,…

image-classificationImage Classification

Unbiasing Truncated Backpropagation Through Time

2017-05-23 · ICLR 2018 1 · Corentin Tallec, Yann Ollivier

Truncated Backpropagation Through Time (truncated BPTT) is a widespread method for learning recurrent computational graphs. Truncated BPTT keeps the computational benefits of Backpropagation Through Time (BPTT) while rel…

Language Modelling

A1: A Fully Transparent Open-Source, Adaptive and Efficient Truncated Vision-Language-Action Model

2026-04-07 · Kaidong Zhang, Jian Zhang, Rongtao Xu, Yu Sun 외 arxiv

Vision-Language-Action (VLA) models have emerged as a powerful paradigm for open-world robot manipulation, but their practical deployment is often constrained by cost: billion-scale VLM backbones and iterative diffusion/…

Robot Manipulation

Zero-Shot Spam Email Classification Using Pre-trained Large Language Models

2024-05-24 · Sergio Rojas-Galeano

This paper investigates the application of pre-trained large language models (LLMs) for spam email classification using zero-shot prompting. We evaluate the performance of both open-source (Flan-T5) and proprietary LLMs …

Classification