This work studies Vision Wormhole's redundancy by fitting a post-hoc sparse autoencoder to frozen Vision Wormhole activations and measuring reconstruction, downstream utility, feature reuse, and token-level interventions across nine reasoning benchmarks, and establishes strong post-hoc compressibility relative to the original transport.
Abstract
Latent-space communication allows heterogeneous vision-language model agents to exchange continuous representations without serializing visual and reasoning states into text. Vision Wormhole realizes this approach by translating visual features into a universal latent representation that can be consumed by another model, but every message is transported as a dense tensor of the same size regardless of its content. A fixed-capacity dense tensor therefore need not have a fixed effective information density: some messages may use only a small fraction of the available representational degrees of freedom. This observation suggests that the communication channel may be substantially compressible. We study its redundancy by fitting a post-hoc sparse autoencoder to frozen Vision Wormhole activations and measuring reconstruction, downstream utility, feature reuse, and token-level interventions across nine reasoning benchmarks. Relative to the original float32 transport, a uint16-index/float16-value sparse payload with k=4 active coefficients per token reduces the transmitted bytes by 128x. In a single-run evaluation, the seven-task non-AIME mean accuracy changes from 49.85% to 49.77%. The fitted 4096-element dictionary uses only 50 features, and task-level active sets have a mean pairwise Jaccard similarity of 0.906. These measurements establish strong post-hoc compressibility relative to the original transport, but do not yet isolate the incremental contribution of sparse coding from position selection, reduced precision, low-rank structure, or SAE optimization effects. The results motivate matched-payload comparisons and communication mechanisms whose payload adapts to the information used by each message.
Downstream reasoning depends on coarse structure and relative geometry rather than exact floating-point values, which argues for rate-task rather than rate-distortion optimization of AI traffic codecs.
Reza Heidari, H. R. Tavakoli, Juho Kannala· 1 citation
CoViST is proposed, a training-free framework that represents a compressed image as a composable visual state that retains its interpretation under successive reductions, enabling the same formulation to support both fixed compression before prefill and progressive compression within the decoder.
Qi Zhang, Xian-Dong Meng, Rong-Gang Wang et al.· 0 citations
This work proposes LatCom, a cross-agent latent compression framework for efficient multi-agent latent collaboration, which achieves an average 2.46x inference speed-up over LatentMAS and reduces output token usage by 70.3% while maintaining comparable average accuracy.
Shi-Nan Zhang, Tao Zhang, Qi-Hui Zhu et al.· 0 citations
This work proposes StateBridge, a training-free latent communication approach that aligns the sender's final-layer hidden states to the receiver's input space via a closed-form orthogonal transformation and prepended to the input of the receiver agent as a continuous prefix.
Yan-Wen Peng, Delvin Ce Zhang, Xi Wang et al.· 6 citations
XKV is introduced, which lifts all three restrictions on multi-agent LLM answering: learned-query attention pools both caches; self-attention over receiver-aligned layer tokens, with a learned layer map reconciling different depths, mixes the pooled summaries into a compact joint memory.
Ji-Yao Liu, Qi Zhang, Yaoyi Jia et al.· 3 citations
This work presents Token-Disentangled Latent Test-Time Scaling, an inference-time framework that makes latent refinement token-role-aware and outperforms strong output-space test-time scaling baselines under matched decoded-candidate budgets.
Hao-Xuan Ma, Yi-Hao Liu, Yu-Tao Sun et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.