aspireai.
PUBLIC EDITION

NVIDIA published an NVFP4 build of DeepSeek-V4.1-Flash, and the catch is a patched vLLM

AspireAI community · Hugging Face / NVIDIA
The DeepSeek-V4.1-Flash-1017 NVFP4 checkpoint from NVIDIA is a quantized version of DeepSeek's open-weight model, built with NVIDIA Model Optimizer and released on Hugging Face on October 30 under an MIT license for commercial or non-commercial use. The base model is a natively multimodal Mixture-of-Experts architecture with a Causal Encoder-Decoder backbone, Compressed Sparse Attention 2 and support for contexts up to one million tokens, with a 552B backbone of which 8B activate during prefill and 16B during decode, plus 196B of Engram conditional memory. The deployment detail worth knowing is that the checkpoint stores Engram lookup tables as MXFP4, which stock vLLM images cannot load, so it needs a vLLM build carrying the corresponding Engram pull request, and SGLang has not been validated with it. The benchmark results were obtained on vllm-openai v0.31.0 with that patch applied.
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.