Probabilistic Geometric Alignment via Bayesian Latent Transport for Domain-Adaptive Foundation Models

• URL: http://arxiv.org/abs/2603.23783v2
• Date: Thu, 26 Mar 2026 07:49:59 GMT
• Title: Probabilistic Geometric Alignment via Bayesian Latent Transport for Domain-Adaptive Foundation Models
• Abstract summary: Adapting large-scale foundation models to new domains with limited supervision remains a fundamental challenge.<n>This paper introduces an uncertainty-aware probabilistic latent transport framework that formulates domain adaptation as a geometric alignment problem.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Adapting large-scale foundation models to new domains with limited supervision remains a fundamental challenge due to latent distribution mismatch, unstable optimization dynamics, and miscalibrated uncertainty propagation. This paper introduces an uncertainty-aware probabilistic latent transport framework that formulates domain adaptation as a stochastic geometric alignment problem in representation space. A Bayesian transport operator is proposed to redistribute latent probability mass along Wasserstein-type geodesic trajectories, while a PAC-Bayesian regularization mechanism constrains posterior model complexity to mitigate catastrophic overfitting. The proposed formulation yields theoretical guarantees on convergence stability, loss landscape smoothness, and sample efficiency under distributional shift. Empirical analyses demonstrate substantial reduction in latent manifold discrepancy, accelerated transport energy decay, and improved covariance calibration compared with deterministic fine-tuning and adversarial domain adaptation baselines. Furthermore, bounded posterior uncertainty evolution indicates enhanced probabilistic reliability during cross-domain transfer. By establishing a principled connection between stochastic optimal transport geometry and statistical generalization theory, the proposed framework provides new insights into robust adaptation of modern foundation architectures operating in heterogeneous environments. These findings suggest that uncertainty-aware probabilistic alignment constitutes a promising paradigm for reliable transfer learning in next-generation deep representation systems.

Related papers

• Coupled Optimal Transport with Landmark Constraints [64.98367856457412]
  An optimal transport (OT) model seeks a map or plan between distributions by minimizing a prescribed transport cost or distortion.<n>This paper proposes a novel coupled OT framework that leverages a small number of annotated landmarks to guide the recovery of an underlying deformation.<n>The proposed framework provides a principled connection between landmark-based registration and transport-based distribution matching.
  arXiv  Detail & Related papers  (2026-08-20T08:28:13Z)
• Augmented Inverse Hybrid Weighting: Robust Inference under Deterministic and Random Distribution Shifts [17.842727239557995]
  We introduce a new model that allows non-systematic changes between two population laws after systematic shifts are accounted for.<n>Such residual shift is modeled as random perturbations to the probability space that cannot be represented in a learnable way.<n>Under pure random perturbations, this principle yields Augmented Inverse Distance Weighting (AIDW), which uses regression augmentation and variance-optimal dataset-level pooling.<n>For mixed shifts, we develop Augmented Inverse Hybrid Weighting (AIHW), which interpolates between AIDW and standard augmented importance weighting.
  arXiv  Detail & Related papers  (2026-08-01T15:02:13Z)
• A Semiparametric Framework for Stochastic Fundamental Diagram Modeling [2.851144416944319]
  The fundamental diagram (SFD) provides a probabilistic description of the relationship between traffic density and flow or speed.<n>We propose a novel semiparametric SFD modeling framework by leveraging specially designed functional forms.<n> Empirical evaluations on a real-world dataset reveal that our approach consistently outperforms representative baselines.
  arXiv  Detail & Related papers  (2026-07-17T12:30:46Z)
• Distribution-Agnostic Robust Trajectory Optimization via Chance-Constrained Reinforcement Learning [0.0]
  This paper presents a distribution-agnostic robust trajectory-optimization framework based on chance-constrained reinforcement learning.<n>The framework is assessed on two materially different trajectory design problems.
  arXiv  Detail & Related papers  (2026-06-11T17:22:05Z)
• A Mean-Field Analysis of Multi-Head Self-Attention under Cross-Entropy Training [0.0]
  This paper develops a mean-field theory for a single-layer causal multi-head self-attention model trained by cross-entropy minimization.<n>In the infinite-head limit, the averaged attention logits define a risk functional on probability measures, whose first variation generates a nonlinear Wasserstein gradient-flow equation.<n>We study the long-time behavior of the PDE: energy dissipation, convergence to the stationary set under compactness, convergence to a single stationary measure under topological or Kurdyka--ojasiewicz assumptions, and explicit convergence rates under gradient-domination conditions.
  arXiv  Detail & Related papers  (2026-06-09T06:38:27Z)
• Hyperparameter Trajectory Inference with Conditional Lagrangian Optimal Transport [51.56484100374058]
  Post-deployment, user preferences can evolve, making initial settings undesirable.<n>We learn, from observed data, how a NN's conditional output distribution changes with its hyper parameters.<n>We construct a surrogate model that approximates the NN at unobserved hyper parameters.
  arXiv  Detail & Related papers  (2026-03-02T11:55:02Z)
• On the Plasticity and Stability for Post-Training Large Language Models [54.757672540381236]
  We identify a root cause as the conflict between plasticity and stability gradients.<n>We propose Probabilistic Conflict Resolution (PCR), a framework that models gradients as random variables.<n>PCR significantly smooths the training trajectory and achieves superior performance in various reasoning tasks.
  arXiv  Detail & Related papers  (2026-02-06T07:31:26Z)
• CURVE: Learning Causality-Inspired Invariant Representations for Robust Scene Understanding via Uncertainty-Guided Regularization [30.613712415224473]
  CURVE is a framework that integrates variational uncertainty modeling with uncertainty-guided structural regularization to suppress high-variance relations.<n>Specifically, we apply prototype-conditioned debiasing to disentangle invariant interaction dynamics from environment-dependent variations, promoting a sparse and domain-stable topology.<n> Empirically, we evaluate CURVE in zero-shot transfer and low-data sim-to-real adaptation, verifying its ability to learn domain-stable sparse topologies and provide reliable uncertainty estimates to support risk prediction under distribution shifts.
  arXiv  Detail & Related papers  (2026-01-28T08:15:56Z)
• Worst-case generation via minimax optimization in Wasserstein space [19.645939141861543]
  Worst-case generation plays a critical role in evaluating robustness and stress-testing systems under distribution shifts.<n>We develop a generative modeling framework for worst-case generation for a pre-specified risk.
  arXiv  Detail & Related papers  (2025-12-09T02:11:08Z)
• Adaptive Dual Uncertainty Optimization: Boosting Monocular 3D Object Detection under Test-Time Shifts [80.32933059529135]
  Test-Time Adaptation (TTA) methods have emerged to adapt to target distributions during inference.<n>We propose Dual Uncertainty Optimization (DUO), the first TTA framework designed to jointly minimize both uncertainties for robust M3OD.<n>In parallel, we design a semantic-aware normal field constraint that preserves geometric coherence in regions with clear semantic cues.
  arXiv  Detail & Related papers  (2025-08-28T07:09:21Z)
• Topology-Aware Conformal Prediction for Stream Networks [68.02503121089633]
  We propose Spatio-Temporal Adaptive Conformal Inference (textttCISTA), a novel framework that integrates network topology and temporal dynamics into the conformal prediction framework.<n>Our results show that textttCISTA effectively balances prediction efficiency and coverage, outperforming existing conformal prediction methods for stream networks.
  arXiv  Detail & Related papers  (2025-03-06T21:21:15Z)
• Nash Equilibria, Regularization and Computation in Optimal Transport-Based Distributionally Robust Optimization [7.841376286262178]
  We study optimal transport-based distributionally robust optimization problems where a fictitious adversary, often envisioned as nature, can choose the distribution of the uncertain problem parameters by a prescribed reference distribution at a finite transportation cost.
  arXiv  Detail & Related papers  (2023-03-07T13:52:32Z)
• Which Invariance Should We Transfer? A Causal Minimax Learning Approach [18.71316951734806]
  We present a comprehensive minimax analysis from a causal perspective. We propose an efficient algorithm to search for the subset with minimal worst-case risk. The effectiveness and efficiency of our methods are demonstrated on synthetic data and the diagnosis of Alzheimer's disease.
  arXiv  Detail & Related papers  (2021-07-05T09:07:29Z)
• Comparing Probability Distributions with Conditional Transport [63.11403041984197]
  We propose conditional transport (CT) as a new divergence and approximate it with the amortized CT (ACT) cost. ACT amortizes the computation of its conditional transport plans and comes with unbiased sample gradients that are straightforward to compute. On a wide variety of benchmark datasets generative modeling, substituting the default statistical distance of an existing generative adversarial network with ACT is shown to consistently improve the performance.
  arXiv  Detail & Related papers  (2020-12-28T05:14:22Z)

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.