aspireai.
PUBLIC EDITION

Data-constrained scaling recipes were getting worse as compute grew, until hyperparameters and ensembling were fit separately

AspireAI community · arXiv
Existing recipes for training under a data-constrained regime hold key hyperparameters such as weight decay fixed as scale changes, and ignore ensembling entirely - with the surprising consequence that the prescribed loss can increase as the compute budget grows. The authors fit power laws for how hyperparameters should transfer with scale and separate scaling laws for how to allocate compute across model size, epochs and ensemble members. On 100M tokens from FineWeb their recipe cuts validation loss by over 0.15 nats versus prior recipes (a 14% drop in perplexity) and produces monotonic improvement as compute increases, with prescriptions fitted on small runs and validated at up to 12x larger compute budgets. The limitation is scale: the fitted laws cover the 50M to 214M parameter range, and the headline numbers come from a single 100M-token corpus rather than frontier-scale data.
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.