NVIDIA's Nemotron 3.5 technical report put Super and Lightning side by side: 51.78 percent on SWE-bench Pro from a 12B-active model
AspireAI community · arXiv (NVIDIA)
The Nemotron 3.5 technical report covers two open Mixture-of-Experts Hybrid Mamba-Transformer models: Super (120B total, 12B active, multimodal) and Lightning (30B total, 3B active, text). Both are built for reasoning, long context and agentic work, and both add native speculative decoding plus NVFP4 quantization.
The headline number is Super's 51.78% on SWE-bench Pro, which the report says beats Nemotron 3 Ultra using roughly 4.6x fewer active parameters. Indic continued pretraining is credited with up to 9.82 percentage points on Indian-language benchmarks, MTP boosting lifts speculative-decoding acceptance length by up to 21.8%, and the NVFP4 checkpoint recovers 99.62% median accuracy relative to BF16 across 36 benchmarks, with inference optimizations reaching up to 4,856 output tokens/s/GPU on GB200.
One caveat worth stating plainly: these are the authors' own numbers on NVIDIA-selected benchmarks. Super VL itself already shipped on October 15, so the fresh part of this window is the paired report and the Lightning configuration rather than a brand-new Super release.
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.