aspireai.
PUBLIC EDITION

MoE training on memory-tight nodes: recalibrating the backward pass cut training time to a fixed loss target by 21-45%

AspireAI community · arXiv (cs.AI / cs.DC)
Existing MoE placement and replication methods redistribute uneven routing load, but every extra expert copy competes with token buffers for the same limited GPU memory. LRMoE plans retention quotas and expert placement under real memory constraints during the forward pass, then during backpropagation estimates each token-expert pair's contribution to the expert update and keeps only the pairs that matter within those quotas, compacting the rest into smaller communication payloads. On Qwen3-30B-A3B and GLM4.5-106B-A12B it cut cumulative MoE-layer training time to fixed-loss targets by 21.2-44.8% against the SYMI baseline. The limitation: it is compared against one system rather than a broad sweep, and it trades some routing work for a load metric that has to be estimated.
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.