Skip to content

SemRD-V2X: Closure-Guided Communication with Bounded Inference for Cooperative Perception

Sep 2026 · 0 citations · 29 references
Computer Science Mathematics

TL;DR

SemRD-V2X is an operational neural proxy that combines exact-budget BEV support selection, pointwise channel compression, and masked shared-weight reconstruction before standard fusion before standard fusion, and position closure fidelity as both an analytical lens and an actionable design principle for communication-efficient cooperative perception.

Abstract

Vehicle-to-Everything (V2X) cooperative perception improves 3-D detection by sharing intermediate features, but dense remote features may repeat context that the ego agent can infer locally. Most communication-efficient designs optimize masks or codes empirically, leaving a more basic question open: which remote evidence is indispensable given the receiver's own observation? We introduce a closure-fidelity perspective on ego conditioned remote perception. Under a finite deductive abstraction and explicit conditions, its rate--distortion function decomposes over an irredundant core, and the exact zero-distortion rate becomes $P_A H(\pi_A)$. This analysis suggests a concrete design principle: transmit compact evidence and recover derivable context with bounded receiver-side inference. Guided by this principle, SemRD-V2X is an operational neural proxy that combines exact-budget BEV support selection, pointwise channel compression, and masked shared-weight reconstruction before standard fusion. Experiments on simulated V2XSet and real-world DAIR-V2X validate the resulting design. In a controlled five-run V2XSet comparison against a locally reproduced V2X-ViT-v1 baseline on one Tesla V100, SemRD-V2X reduces the analytical feature payload by $26.6\times$ while improving AP@0.5/AP@0.7 by 4.13/8.57 points, with 3.81\% additional mean compute latency. These results position closure fidelity as both an analytical lens and an actionable design principle for communication-efficient cooperative perception.

View source

Similar papers

Preprint Sep 2026

Dense Coverage, Sparse Refinement: Byte-Constrained Cooperative Perception

Collaborative perception improves autonomous perception by sharing intermediate Bird's-Eye-View (BEV) features across connected agents, but dense feature exchange is difficult to deploy under strict Vehicle-to-Everything (V2X) bandwidth limits. Existing efficient methods typically either compress the full feature map u...

Melih Yazgan, Timon Müller, J. Zöllner · 1 citation

EviRover: Reinforcing Agentic Perception Beyond a Glance

Visual perception is conventionally formulated as a one-shot prediction from a single glance at the image, under the assumption that the image content and the model's parametric knowledge suffice to resolve the query. This assumption often fails in real-world scenarios that hinge on fine-grained visual details or requi...

Kai-Xuan Fan, Kai-Tuo Feng, Tian-Shuo Peng et al. · 1 citation
Preprint Aug 2026

GaussVLA: Geometry-Aware Spatial Reasoning for Vision-Language-Action Model

GaussVLA is proposed, a Mamba-based VLA that incorporates two custom modules: Gaussian Spatial Tokenizer (GST) to lift frozen semantic and depth features into compact 3D Gaussian tokens, and Depth-Aware Chain-of-Thought (DA-CoT) that performs structured, non-autoregressive geometric reasoning under language and flow-ti...

MD SELIM SAROWAR, Md Tanvir Islam, Sungho Kim et al. · 1 citation
#edge computing Preprint Sep 2026

ComVLA: Communication-Aware Split Inference for VLA Models in 6G-Connected Robotics

ComVLA is proposed, a framework that uses the dense semantic information contained in the language guidance to adapt the VLA token budget to the channel capacity, and demonstrates that co-designing VLA inference and wireless communication is a practical direction for 6G-connected robotics.

Bo-Liang Liu, Wint Yi Poe, Jing-Yun Di et al. · 0 citations
Conference Open access Sep 2026

Context-Adaptive World Models for Visual Out-of-Distribution Generalization

This thesis is developing a context-adaptive Mamba-based world model that infers K context vectors from short pixel-trajectory windows, and shows that its suboptimality is bounded by √K times the context-inference error along a Lipschitz chain through FiLM, the SSM, and the decoder.

Shubham Subhnil · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.