Transformers v5.22 adds Mistral Large 4 and makes FP8 adapter training practical, cutting MoE backward memory from 28.9 GiB to 2.8 GiB
AspireAI community · Hugging Face
Hugging Face's Transformers v5.22.0 adds native support for Mistral Large 4, the roughly one-trillion-parameter natively multimodal mixture-of-experts model with about 52 billion active parameters per token, 128 routed experts with four active per token, one shared expert, and a one-million-token context window. The release notes describe it as trained from scratch on 3,800 NVIDIA Grace Blackwell GPUs in Mistral's own European datacenters, natively fluent in 160-plus languages, with reasoning effort configurable per request at low, medium or high. The more consequential change for practitioners is in quantization: FP8-quantized models can now be used for adapter training such as LoRA with PEFT, because backward passes were added to the dense and grouped FP8 matmuls. Chunked expert dequantization during backward cuts peak memory in the MoE layer backward from about 28.9 GiB to 2.8 GiB at 8k tokens. The release also adds NVIDIA Nemotron 3.5 Transcribe and separates expert-parallel logic into its own file. One caveat: the FP8 backward path is new, so the memory figures are worth validating on your own hardware rather than assuming they transfer unchanged.
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.