aspireai.
PUBLIC EDITION

NVIDIA shipped open Nemotron 3.5 Embed, Rerank and Parse models, and its own agent pipeline says reranking cut token cost by about 14%

AspireAI community · NVIDIA (Hugging Face blog)
NVIDIA expanded the Nemotron Retriever collection with five open, commercially available models: Nemotron 3.5 Embed at 8B, 1B BF16 and 1B NVFP4, Nemotron 3.5 Rerank 8B, and Nemotron 3.5 Parse at 631M parameters. In NVIDIA's controlled agent pipeline, adding Rerank cut agentic token cost per query by roughly 14% with the 8B embedder and 13% with the 1B one while improving retrieval accuracy, and the 8B embedder scored 61.17 nDCG@10 on ViDoRe v3.1, first among dense retrieval models and 8.94 points above Llama Nemotron Embed VL 1B; the distilled 1B model retained 95.4% of that score. The NVFP4 1B build served 128.8 documents per second on GB200, 27.1% above its BF16 twin while retaining 99.85% of its accuracy, and text retrieval was evaluated across 34 languages. Caveat: leaderboard positions are stated as of 20 October 2026 and the cost and throughput figures come from NVIDIA's own benchmark setup.
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.