Uncertainty-DTW for Sequences and Visual Tokens

• URL: http://arxiv.org/abs/2605.25110v1
• Date: Sun, 24 May 2026 14:49:43 GMT
• Title: Uncertainty-DTW for Sequences and Visual Tokens
• Abstract summary: We introduce uncertainty-aware alignment, a probabilistic framework that models correspondences with heteroscedastic uncertainty and performs structured matching along alignment paths.<n>We generalize this framework from temporal sequences to tokenized visual representations, enabling structured matching over sets of visual tokens.<n>These findings establish uncertainty-aware alignment as a general, robust, and interpretable framework for learning from structured data.
• Score: 43.798398689900075
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Aligning structured data is a fundamental problem in computer vision and machine learning, underlying tasks such as time series analysis, human action recognition, and visual representation learning. Existing alignment methods, including Dynamic Time Warping (DTW) and its differentiable variants, rely on deterministic similarity measures and are therefore sensitive to heterogeneous and noisy features. In this work, we introduce uncertainty-aware alignment, a probabilistic framework that models pairwise correspondences with heteroscedastic uncertainty and performs structured matching along alignment paths. Our formulation, uncertainty-DTW (uDTW), assigns each correspondence a Normal distribution and parametrizes each alignment path by a Maximum Likelihood Estimate objective consisting of (i) a precision-weighted matching term that suppresses unreliable features, and (ii) a log-variance regularization that prevents degenerate solutions. This yields a probabilistic alignment mechanism that is robust to noise and interpretable, as uncertainty directly reflects the reliability of matches. We further generalize this framework from temporal sequences to tokenized visual representations, enabling structured matching over sets of visual tokens. The learned uncertainty can be interpreted as a reverse-attention: semantically relevant regions exhibit low uncertainty and dominate the alignment, while ambiguous/noisy regions have high uncertainty. This provides a connection between alignment, attention, and uncertainty modeling. We evaluate the proposed framework across diverse domains. The results demonstrate consistent improvements over state-of-the-art methods and show that learned uncertainty correlates with semantic importance. These findings establish uncertainty-aware alignment as a general, robust, and interpretable framework for learning from structured data.

Related papers

• MomentBA: Second-order Spatial Moments for Anisotropic Correspondence Uncertainty in Differentiable Bundle Adjustment [25.614583001276767]
  We propose MomentBA, a geometry-aware bundle adjustment framework that derives anisotropic correspondence uncertainty from second-order spatial moments of local similarity responses.<n> Experiments on the EuRoC MAV and TartanAir v1 Hard datasets demonstrate that MomentBA improves monocular visual odometry accuracy compared with existing feature-based and learning-based approaches.
  arXiv  Detail & Related papers  (2026-09-12T03:58:09Z)
• Uncertainty-Aware Deepfake Detection via Multi-View Structural Learning [6.951909224842812]
  Security-critical biometric and forensic applications require accurate predictions and reliable confidence estimates, particularly under distribution shift.<n>We propose an uncertainty-aware deepfake detection framework that identifies manipulations through inconsistencies across complementary evidence sources.<n>We introduce Inter-Branch Disagreement (IBDC), a disagreement-aware uncertainty modeling mechanism that links predictive uncertainty to conflicts among evidence streams.
  arXiv  Detail & Related papers  (2026-07-30T18:42:01Z)
• Sensitivity Uncertainty Alignment in Large Language Models [0.0]
  We propose a framework for analyzing failures of large language models under adversarial and ambiguous inputs.<n>We define a scalar score, SUA_theta(x), capturing the difference between distributional sensitivity and predictive entropy.<n>We introduce SUA-TR, a training method combining consistency regularization and entropy alignment, along with an abstention rule for safer inference.
  arXiv  Detail & Related papers  (2026-04-21T17:53:12Z)
• Beyond Predictive Uncertainty: Reliable Representation Learning with Structural Constraints [0.3948325938742681]
  We argue that reliability should be regarded as a first-class property of learned representations themselves.<n>We propose a principled framework for reliable representation learning that explicitly models representation-level uncertainty.<n>Our approach introduces uncertainty-aware regularization directly in the representation space, encouraging representations that are not only predictive but also stable, well-calibrated, and robust to noise and structural perturbations.
  arXiv  Detail & Related papers  (2026-01-22T18:19:52Z)
• Heterogeneous Uncertainty-Guided Composed Image Retrieval with Fine-Grained Probabilistic Learning [49.28548464288051]
  Composed Image Retrieval (CIR) enables image search by combining a reference image with modification text.<n>In intrinsic noise in CIR triplets incurs intrinsic uncertainty and threatens the model's robustness.<n>This paper introduces a Heterogeneous Uncertainty-Guided (HUG) paradigm to overcome these limitations.
  arXiv  Detail & Related papers  (2026-01-16T16:05:49Z)
• Probabilistic Modeling of Disparity Uncertainty for Robust and Efficient Stereo Matching [61.73532883992135]
  We propose a new uncertainty-aware stereo matching framework.<n>We adopt Bayes risk as the measurement of uncertainty and use it to separately estimate data and model uncertainty.
  arXiv  Detail & Related papers  (2024-12-24T23:28:20Z)
• Detecting and Identifying Selection Structure in Sequential Data [53.24493902162797]
  We argue that the selective inclusion of data points based on latent objectives is common in practical situations, such as music sequences. We show that selection structure is identifiable without any parametric assumptions or interventional experiments. We also propose a provably correct algorithm to detect and identify selection structures as well as other types of dependencies.
  arXiv  Detail & Related papers  (2024-06-29T20:56:34Z)
• Probabilistic computation and uncertainty quantification with emerging covariance [11.79594512851008]
  Building robust, interpretable, and secure AI system requires quantifying and representing uncertainty under a probabilistic perspective. Probability computation presents significant challenges for most conventional artificial neural network.
  arXiv  Detail & Related papers  (2023-05-30T17:55:29Z)
• Robustness and Accuracy Could Be Reconcilable by (Proper) Definition [109.62614226793833]
  The trade-off between robustness and accuracy has been widely studied in the adversarial literature. We find that it may stem from the improperly defined robust error, which imposes an inductive bias of local invariance. By definition, SCORE facilitates the reconciliation between robustness and accuracy, while still handling the worst-case uncertainty.
  arXiv  Detail & Related papers  (2022-02-21T10:36:09Z)
• Acquisition-invariant brain MRI segmentation with informative uncertainties [3.46329153611365]
  Post-hoc multi-site correction methods exist but have strong assumptions that often do not hold in real-world scenarios. This body of work showcases such an algorithm, that can become robust to the physics of acquisition in the context of segmentation tasks. We demonstrate that our method not only generalises to complete holdout datasets, preserving segmentation quality, but does so while also accounting for site-specific sequence choices.
  arXiv  Detail & Related papers  (2021-11-07T13:58:04Z)
• Learning Disentangled Representations with Latent Variation Predictability [102.4163768995288]
  This paper defines the variation predictability of latent disentangled representations. Within an adversarial generation process, we encourage variation predictability by maximizing the mutual information between latent variations and corresponding image pairs. We develop an evaluation metric that does not rely on the ground-truth generative factors to measure the disentanglement of latent representations.
  arXiv  Detail & Related papers  (2020-07-25T08:54:26Z)

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.