Making two action heads agree: coordination mechanisms and a runtime collapse certificate for flow-matching policies

• URL: http://arxiv.org/abs/2608.15748v1
• Date: Sun, 16 Aug 2026 13:57:36 GMT
• Title: Making two action heads agree: coordination mechanisms and a runtime collapse certificate for flow-matching policies
• Abstract summary: Flow-matching policy decodes each predicted motion into joint and end-effector spaces.<n>On multimodal tasks, independently sampled branches may choose different valid modes, causing false alarms.<n>We study how to coordinate the two branches and at what cost.
• Score: 13.05465000489116
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A dual-representation flow-matching policy decodes each predicted motion into joint and end-effector spaces, and the residual between the two kinematically equivalent decodings provides a physically interpretable runtime signal. On multimodal tasks, however, independently sampled branches may choose different valid modes, causing false alarms. We study how to coordinate the two branches and at what cost. Across two robot environments and a non-robotic testbed, the tested mechanisms fall into four classes. An auxiliary latent shared by both branches but absent from the flow-matching construction is erased at the population optimum, a provable dead end confirmed within a prespecified 2% equivalence band. Sharing source noise can coordinate or anti-coordinate: its effect changes sign with the representation map and tracks the alignment of decoder mode basins. Consistency regularization gives intermediate coordination but reduces the valid-pair rate, while training-supported discrete partitions achieve near-ceiling coordination robustly. We further derive a chance-corrected coordination bound based only on each branch's Gini-Simpson diversity, yielding an attainable region and a label-free certificate that separates coordination from collapse when zero mismatch is ambiguous. On LIBERO-Plus, benign multimodality adds 1.57 percentage points of false alarms to the residual, which remains the strongest evaluated failure signal; the preregistered token intervention does not meet its false-alarm criterion or produce a seed-robust detection change. Code, models, and per-run configurations are available at https://github.com/kimo423/dual-head-coordination.

Related papers

• Networked Admissibility-Preserving Control for Directed Safe Coordination [0.0]
  This paper addresses safety-critical coordination for scalar agents.<n>Agents communicate over a fixed weighted digraph with a directed spanning tree.<n>The synthesis yields an exact cascade in which exponentially decaying realization errors drive nonsymmetric consensus dynamics.
  arXiv  Detail & Related papers  (2026-09-08T19:38:20Z)
• Differentiable Interval Bottlenecks for Interpretable Anomaly Detection in Numerical Data [0.5213778368155993]
  DIFFINT is an autoencoder whose latent bottleneck is structured as a set of soft, axis-aligned interval memberships.<n>It is the only interpretable detector in the statistically-tied leading cluster of seven methods.
  arXiv  Detail & Related papers  (2026-09-03T14:05:27Z)
• Local verification cannot detect non-transportability: a cohomological theory of context preservation in agentic reasoning [0.0]
  Agentic AI systems routinely transport conclusions across biological, clinical and financial contexts.<n>We show that the emerging safeguard of local verification is structurally incomplete.<n>We quantify the distortion under unequal precision and supply the precision-whitened form that restores exactness.
  arXiv  Detail & Related papers  (2026-08-04T21:09:50Z)
• TwistedMerge: Certified Higher-Order Diagnostics and Abstention for Model Merging [0.48086260459837454]
  We formulate merging as a finite descent problem in which checkpoints are local objects, alignment maps are transitions, and cycle products are residuals.<n>We prove a constant-edge no-go result, frozen-complex three-way and pre-family error-control theorems, and a refinement test for comparison-complex sensitivity.<n>A trained low-rank-adapter audit shows that naive factor averaging depends on the chosen GLr representative, whereas global factor synchronization and dense-delta SVD are stable.
  arXiv  Detail & Related papers  (2026-07-23T03:24:50Z)
• BTI-Net: Bidirectional Decoder-Level Task Interaction via Uncertainty-Aware Gating for Multi-Task Medical Image Analysis [2.8218290601001854]
  BTI-Net establishes bidirectional communication at every decoder level through two parallel pathways via Task Interaction Modules.<n>Uncertainty Proxy Attention gates each TIM output per instance and per level using three signals that capture cross-task alignment, scene complexity, and prediction confidence.<n>Experiments on three medical benchmarks spanning ultrasound, dermoscopy, and brain MRI demonstrate consistent improvements in segmentation IoU and classification accuracy over both encoder-sharing and decoder-interaction baselines.
  arXiv  Detail & Related papers  (2026-06-27T22:37:26Z)
• What Accuracy and Gradient Cosine Miss: Evaluating Feedback Alignment via Scale Stability, Reference Validity, and Depth Utility [48.10132234701036]
  We propose a diagnostic evaluation protocol based on three checks -- scale stability, reference validity, and depth utility -- together with per-layer rather than aggregate cosine reporting.<n>Across multiple architectures and methods, our protocol identifies all failures with wide calibration margins.
  arXiv  Detail & Related papers  (2026-06-19T06:04:17Z)
• Follow the Latent Roadmap: Navigating Revocable Decoding for Diffusion LLMs with Anchor Tokens [22.687236570529844]
  We propose ASRD (Anchor Supervised Revocable Decoding), a training-free framework that operates within the embedding space.<n>We show that ASRD outperforms recent remasking baselines, achieving accuracy improvements of up to 6.4% while accelerating inference throughput by up to 7.2times$.
  arXiv  Detail & Related papers  (2026-06-15T15:23:47Z)
• Mean-Field Parallel Decoding for Discrete Diffusion Language Models [47.086589631406035]
  We introduce a training-free decoding framework that coordinates parallel updates.<n>A variational relaxation yields a simple fixed-point update that suppresses conflicting simultaneous commitments.<n> Experiments on reasoning and code-generation benchmarks show consistent improvements in the quality-latency trade-off.
  arXiv  Detail & Related papers  (2026-06-14T13:17:58Z)
• Strategic Non-Shareability of Quantum Correlations [0.0]
  We prove that on finite alphabets, the game-optimized anti-collusion capacity equals the total-variation distance to the shadow.<n>We recast entanglement monogamy as a measurable shareability deficit for quantum-mediated strategic networks.
  arXiv  Detail & Related papers  (2026-05-25T07:19:53Z)
• Unsupervised Conformal Inference: Bootstrapping and Alignment to Control LLM Uncertainty [49.19257648205146]
  We propose an unsupervised conformal inference framework for generation.<n>Our gates achieve close-to-nominal coverage and provide tighter, more stable thresholds than split UCP.<n>The result is a label-free, API-compatible gate for test-time filtering.
  arXiv  Detail & Related papers  (2025-09-26T23:40:47Z)
• Unpaired Adversarial Learning for Single Image Deraining with Rain-Space Contrastive Constraints [61.40893559933964]
  We develop an effective unpaired SID method which explores mutual properties of the unpaired exemplars by a contrastive learning manner in a GAN framework, named as CDR-GAN. Our method performs favorably against existing unpaired deraining approaches on both synthetic and real-world datasets, even outperforms several fully-supervised or semi-supervised models.
  arXiv  Detail & Related papers  (2021-09-07T10:00:45Z)
• Cross-domain Speech Recognition with Unsupervised Character-level Distribution Matching [60.8427677151492]
  We propose CMatch, a Character-level distribution matching method to perform fine-grained adaptation between each character in two domains. Experiments on the Libri-Adapt dataset show that our proposed approach achieves 14.39% and 16.50% relative Word Error Rate (WER) reduction on both cross-device and cross-environment ASR.
  arXiv  Detail & Related papers  (2021-04-15T14:36:54Z)
• Consensus-Guided Correspondence Denoising [67.35345850146393]
  We propose to denoise correspondences with a local-to-global consensus learning framework to robustly identify correspondence. A novel "pruning" block is introduced to distill reliable candidates from initial matches according to their consensus scores estimated by dynamic graphs from local to global regions. Our method outperforms state-of-the-arts on robust line fitting, wide-baseline image matching and image localization benchmarks by noticeable margins.
  arXiv  Detail & Related papers  (2021-01-03T09:10:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.