High-Dimensional Search, Low-Dimensional Solution: Decoupling Optimization from Representation

arXiv (Cornell University)

Abstract

State-of-the-art models rely on massive widths despite exhibiting low Intrinsic Dimension (ID). We posit that this redundancy serves the non-convex optimization search rather than the final representation. We validate this hypothesis by decoupling the solution geometry via data-independent random projections, demonstrating that ResNet, ViT, and BERT representations can be compressed by up to 16x with negligible performance degradation of around 1%. Notably, these oblivious projections achieve parity with PCA and learned baselines, confirming the solution manifold is intrinsically robust. These findings establish the foundation for Subspace-Native Distillation: a paradigm where student models target this intrinsic manifold directly, bypassing the high-dimensional optimization bottleneck to realize the vision of "Train Big, Deploy Small"

Authors 2

1. Yusuf Kalyoncuoglu Aachen Department of Computer Science

   RWTH Aachen University

   Affiliation as printed

   Department of Computer Science RWTH Aachen University

2. Ratmir Miftachov