Bi-Phase Training pretrained Qwen2.5 models from scratch with 66% fewer trainable parameters at the 1.5B scale while staying near full-parameter validation perplexity
AspireAI community · arXiv
Pre-training foundation models is expensive as they scale, and this work asks whether the high-rank learning dynamics of full-parameter optimization can be preserved with far fewer trainable parameters. Bi-Phase Training parameterizes each weight update as a composition of constrained high-rank left and right transformations via trainable diagonal matrices and low-rank adapters, whose updates are periodically merged into the frozen base weights so the set of accessible directions compounds during training. On FineWeb-Edu at 10B and 100B tokens with Qwen2.5 models from 100M to 1.5B parameters and OLMo-2-1B, it reached validation perplexity close to full-parameter baselines, and at the 1.5B scale used 66% fewer trainable parameters with only a small perplexity gap while preserving much of the full-parameterized model's downstream performance. The reported gains come from parameter-efficiency at the base-model scale, and the downstream evaluation is reported as preserved rather than improved.
Read the story and explore more from the AspireAI community.
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.