aspireai.
PUBLIC EDITION

Reweighting domain loss instead of data ratios lifted all five benchmarks for a 1.5B model, including 17 points on GSM8K, without spending more tokens

AspireAI community · arXiv
Successive pretraining stages often trade earlier knowledge for later reasoning, and the usual lever is the data-mixture ratio. This work shows a second, independent control: how strongly each domain contributes to the loss, with data exposure held fixed. In controlled knowledge-mathematics experiments, loss reweighting produced a single checkpoint that beat the best knowledge and reasoning scores reached at any point along either stage trajectory. The method, LARE, adjusts domain weights automatically from running loss statistics using a normalized inverse-square-root rule derived from gradient-noise analysis, so it changes neither the sampled mixture nor the number of runs needed to search for weights. Across knowledge, mathematics and code, LARE improved all five evaluated benchmarks for a 1.5B model trained on 240B tokens, averaging 7.84 points over a matched direct mixture with 17.06 points on GSM8K and 9.00 on MATH. The evidence comes from a 1.5B-parameter model on five benchmarks, so the scale claim is not established.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
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.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.