The Universal Weight Subspace Hypothesis

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Kaushik, Prakhar, Chaudhari, Shravan, Vaidya, Ankit, Chellappa, Rama, Yuille, Alan
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909946666287104
author Kaushik, Prakhar
Chaudhari, Shravan
Vaidya, Ankit
Chellappa, Rama
Yuille, Alan
author_facet Kaushik, Prakhar
Chaudhari, Shravan
Vaidya, Ankit
Chellappa, Rama
Yuille, Alan
contents We show that deep neural networks trained across diverse tasks exhibit remarkably similar low-dimensional parametric subspaces. We provide the first large-scale empirical evidence that demonstrates that neural networks systematically converge to shared spectral subspaces regardless of initialization, task, or domain. Through mode-wise spectral analysis of over 1100 models - including 500 Mistral-7B LoRAs, 500 Vision Transformers, and 50 LLaMA-8B models - we identify universal subspaces capturing majority variance in just a few principal directions. By applying spectral decomposition techniques to the weight matrices of various architectures trained on a wide range of tasks and datasets, we identify sparse, joint subspaces that are consistently exploited, within shared architectures across diverse tasks and datasets. Our findings offer new insights into the intrinsic organization of information within deep networks and raise important questions about the possibility of discovering these universal subspaces without the need for extensive data and computational resources. Furthermore, this inherent structure has significant implications for model reusability, multi-task learning, model merging, and the development of training and inference-efficient algorithms, potentially reducing the carbon footprint of large-scale neural models.
format Preprint
id arxiv_https___arxiv_org_abs_2512_05117
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle The Universal Weight Subspace Hypothesis
Kaushik, Prakhar
Chaudhari, Shravan
Vaidya, Ankit
Chellappa, Rama
Yuille, Alan
Machine Learning
Artificial Intelligence
Computer Vision and Pattern Recognition
We show that deep neural networks trained across diverse tasks exhibit remarkably similar low-dimensional parametric subspaces. We provide the first large-scale empirical evidence that demonstrates that neural networks systematically converge to shared spectral subspaces regardless of initialization, task, or domain. Through mode-wise spectral analysis of over 1100 models - including 500 Mistral-7B LoRAs, 500 Vision Transformers, and 50 LLaMA-8B models - we identify universal subspaces capturing majority variance in just a few principal directions. By applying spectral decomposition techniques to the weight matrices of various architectures trained on a wide range of tasks and datasets, we identify sparse, joint subspaces that are consistently exploited, within shared architectures across diverse tasks and datasets. Our findings offer new insights into the intrinsic organization of information within deep networks and raise important questions about the possibility of discovering these universal subspaces without the need for extensive data and computational resources. Furthermore, this inherent structure has significant implications for model reusability, multi-task learning, model merging, and the development of training and inference-efficient algorithms, potentially reducing the carbon footprint of large-scale neural models.
title The Universal Weight Subspace Hypothesis
topic Machine Learning
Artificial Intelligence
Computer Vision and Pattern Recognition
url https://arxiv.org/abs/2512.05117