aspireai.
PUBLIC EDITION

SACQ quantizes a vision-language-action robot model to 1.5 bits and still hits 93.85% on LIBERO

AspireAI community · arXiv
Vision-language-action models are large enough that shipping them on a constrained robot platform is a memory problem, and the low-bit post-training quantization recipes inherited from language models tend to break down on them. SACQ is a weight-only vector-codebook quantization framework built for VLAs: it fits codebooks against the input statistics and downstream sensitivity of each role, allocates bits by how much each layer's compression moves the final action, and then runs a two-stage refinement that reassigns codewords with second-order error compensation. On GR00T N1.7 it reaches 93.85% average success across four LIBERO suites at 1.5 bits per language and action weight, with model memory cut 4.83x, and 93.55% with INT8 activations while running 1.51x faster than BF16. This is one base model and one benchmark family, so whether the recipe transfers to other VLA architectures is still an open question.
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.