I was recently curious about the alignment mechanism in those Vision-Language Models (VLMs). We know some VLMs are not inherently multi-modal by design: they glue a pretrained vision encoder to a text-only LLM, usually through a linear projection layer.1 Then joint training is introduced, probably through some multi-modal task. The practice, which also matches our intuition, works pretty well. And I’ve heard that such Frankenstein models can infer unseen characters from a pretrained vision encoder.2 However, I was still puzzled by why such joint training does not disrupt the learned representations and instead aligns different modalities pretty well. This alignment mechanism is related to much broader questions, such as why fine-tuning (in many cases) does not break the learned general knowledge, even with full fine-tuning rather than LoRA. But here let’s focus on the simple two-model alignment problem. Let’s say one is a vision model $f_v​$, and the other is a language model $f_l​$:

$$ z_v​=f_v​(x), z_l​=f_l​(y), $$

where $z_v \in \mathbb{R}^{d_v}​$ and $z_l \mathbb{R}^{d_l}$ may live in different spaces and have different dimensionalities ($d_v \neq d_l$).

Teleological intuition

One way to make sense of why alignment works is to suppose that both spaces share an approximately invertible transform:

$$ z_l​ \approx A z_v​, $$

in which $A$ might be a linear or nonlinear transform. What really matters is that the topology/global structure is very similar (see the Platonic representation hypothesis3; there are also examples from neuroscience showing similar stuff4). Examples include $||cat, dog||> ||cat, sink||$ or more complicated yet fundamental relationships like the triangle inequality. Then, a cheaper solution, from the perspective of an optimizer, is not to mess up one space (or both) completely, but to just twist them a little bit so that they can communicate. More practically, you don’t even need both to be globally transformable; a shared subspace is usually enough. And then, suppose both $f_v​$ and $f_l$ are heavily overparameterized and well-trained (they have already reached basins). Gradients should usually flow to their bottleneck bridge layer rather than to the models themselves in directions that may destroy their structure. But this does not answer the question of how SGD will prioritize solutions involving such small deformations over disruptive ones.

Mechanistic understanding

Let $\theta_0$ be the initial parameter set of both $f_v​$ and $f_l​$ and $\Delta \theta = \theta - \theta_0$ be the parameter update. Suppose we use MSE as the alignment loss: $L = {1\over 2}||r(\theta_0)||^2$. If we expand around the initial parameters, we have:5

$$ r(\theta_0 + \Delta \theta) \approx r_0 + J \Delta \theta. $$

With this approximation, a single step in gradient descent can be written as

$$ \frac{d\Delta \theta}{dt} = -J^\top (r_0 + J \Delta \theta). $$

Intuitively, with a “larger” $J$, we will have faster convergence to zero alignment loss. In a high-dimensional setting, this means that if we take the SVD of $J$ and let $\sigma_i$ be its $i$-th singular value, $v_i$ its singular vector, and $u_i$ its error direction, then those large $\sigma_i$s will dominate the gradient descent process:6

$$ u_i^\top r(t) = u_i^\top r(0) \cdot e^{-\sigma_i^2 t}, $$

and the corresponding parameter shift will be very small. Now, why is the sensitivity oriented towards the bridge part but not the models themselves? After sufficient pretraining, it has been shown that sometimes this is the case (effective fine-tuning requires a small intrinsic dimension7), and that’s a way to interpret why LoRA works.

At this point, I’m starting to get a rough sense of how alignment may work. And I guess those works on model merging (task arithemtics8, like those sakana papers9) may also benefit from the same principle, and future such work may also take this to improve them.


  1. Haotian Liu, Chunyuan Li, Qingyang Wu, and Yong Jae Lee, “Visual Instruction Tuning”, NeurIPS 2023. LLaVA connects a pretrained vision encoder to an LLM through a linear projection. For a different connector architecture using frozen backbones, see Junnan Li, Dongxu Li, Silvio Savarese, and Steven Hoi, “BLIP-2: Bootstrapping Language-Image Pre-training with Frozen Image Encoders and Large Language Models”, ICML 2023. ↩︎

  2. Harry Partridge, “GLM 5.2 with vision”, Baseten, last updated July 29, 2026. The report describes training only a two-layer vision projector and identifying Stephen Hawking in an example image 26% of the time, although his name was absent from their SFT and RL datasets. ↩︎

  3. Minyoung Huh, Brian Cheung, Tongzhou Wang, and Phillip Isola, “Position: The Platonic Representation Hypothesis”, ICML 2024. The paper presents evidence of increasing representational alignment across models and modalities and proposes a shared statistical representation of reality as a hypothesis, though this has been challenged recently. ↩︎

  4. For related theory from Ganguli and colleagues, see Andrew M. Saxe, James L. McClelland, and Surya Ganguli, “A mathematical theory of semantic development in deep neural networks”, PNAS 2019. ↩︎

  5. Jaehoon Lee et al., “Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descent”, NeurIPS 2019. ↩︎

  6. Arthur Jacot, Franck Gabriel, and Clément Hongler, “Neural Tangent Kernel: Convergence and Generalization in Neural Networks”, NeurIPS 2018. ↩︎

  7. Armen Aghajanyan, Sonal Gupta, and Luke Zettlemoyer, “Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuning”, ACL-IJCNLP 2021. The paper finds that several downstream tasks admit effective fine-tuning in low-dimensional parameter subspaces. ↩︎

  8. Gabriel Ilharco et al., “Editing Models with Task Arithmetic”, ICLR 2023. For the connection to weight disentanglement and the neural tangent kernel, see Guillermo Ortiz-Jimenez, Alessandro Favero, and Pascal Frossard, “Task Arithmetic in the Tangent Space: Improved Editing of Pre-Trained Models”, NeurIPS 2023. ↩︎

  9. Takuya Akiba, Makoto Shing, Yujin Tang, Qi Sun, and David Ha, “Evolutionary optimization of model merging recipes”, Nature Machine Intelligence 7, 195–204 (2025). See also Sakana AI’s project overview↩︎