cs.LGApr 1, 2026

Optimal Brain Decomposition for Accurate LLM Low-Rank Approximation

Authors: Yuhang Li, Donghyun Lee, Ruokai Yin, Priyadarshini Panda

Organizations: Yale University · University of Sounthern California

Abstract

Low-rank decomposition has emerged as an important problem in Large Language Model (LLM) fine-tuning and inference. Through Singular Value Decomposition (SVD), the weight matrix can be factorized into low-rank spaces optimally. Previously, a common practice was to decompose the weight in the activation-whitened space, and then achieve satisfying results. In this work, we propose Optimal Brain Decomposition LLM (OBD-LLM), which studies the decomposition problem in the model space by utilizing second-order Hessian information. Through a rigorous Kronecker-factorization of the Hessian, we show that the decomposition needs to consider both input and output information of the layer, and achieves much better decomposition results compared to input only method. Our loss-aware decomposition method involves a bi-directional whitening on the weight matrix. As a result, OBD-LLM is a closed-form solution for the optimal decomposition of weights in the language model. Remarkably, we achieve ~20-40% better results than previous state-of-the-art decomposition methods, the SVD-LLM.

Figures & tables

Explore similar work

CardsList
  1. UniRank: Unified Rank Allocation for Low-Rank LLM Compression

    Jun 20, 2026Chao Han, Yongjie Du, Junjie Tan +1LLM CompressionLow-Rank Matrix Decomposition

  2. Importance-Guided Basis Selection for Low-Rank Decomposition of Large Language Models

    May 2, 2026Daniel Agyei Asante, Ernie Chang, Yang LiLLM PruningLLM Compression

  3. Swift-SVD: Theoretical Optimality Meets Practical Efficiency in Low-Rank LLM Compression

    Apr 2, 2026Ruoling Qi, Yirui Liu, Xuaner Wu +6LLM CompressionLow-Rank Compression