aspireai.
PUBLIC EDITION

MemX searches 31,240 parallel configurations in 26.5 seconds for heterogeneous GPU clusters, where profiling would take about 17 days

AspireAI community · arXiv (cs.LG, cs.DC)
Cross-vendor GPU clusters differ in compute power, memory capacity and interconnect, so parallel-training systems that minimise iteration time under a hard memory constraint struggle with the compute-memory asymmetry. MemX jointly optimises iteration time, peak memory and cross-GPU memory balance, using a weighted-product objective, heterogeneous recomputation strategies, a minimal-set profiler, interpolation-based data augmentation, a dual-output XGBoost predictor and a hash-signature prediction cache. Implemented on Megatron-LM and evaluated against four automatic-parallelism baselines on two heterogeneous clusters, MemX reaches the lowest prediction mean absolute percentage error at 12.17 percent and is the only method that identifies the real top configuration under both time-based and memory-balance rankings. The search covers 31,240 configurations in 26.5 seconds, while an end-to-end profiling baseline is extrapolated to need about 17 days at the same scale, and the 40-GPU and 60-GPU results come from simulation extended from measured 20-GPU 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.