Partial Distribution Alignment via Adaptive Optimal Transport

• URL: http://arxiv.org/abs/2503.05087v1
• Date: Fri, 07 Mar 2025 02:13:04 GMT
• Title: Partial Distribution Alignment via Adaptive Optimal Transport
• Authors: Pei Yang, Qi Tan, Guihua Wen,
• Abstract summary: We propose adaptive optimal transport which is distinctive from the classical optimal transport in its ability of adaptive-mass preserving.<n>We instantiate the adaptive optimal transport in machine learning application to align source and target distributions partially and adaptively.
• Score: 11.167177175327359
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: To remedy the drawbacks of full-mass or fixed-mass constraints in classical optimal transport, we propose adaptive optimal transport which is distinctive from the classical optimal transport in its ability of adaptive-mass preserving. It aims to answer the mathematical problem of how to transport the probability mass adaptively between probability distributions, which is a fundamental topic in various areas of artificial intelligence. Adaptive optimal transport is able to transfer mass adaptively in the light of the intrinsic structure of the problem itself. The theoretical results shed light on the adaptive mechanism of mass transportation. Furthermore, we instantiate the adaptive optimal transport in machine learning application to align source and target distributions partially and adaptively by respecting the ubiquity of noises, outliers, and distribution shifts in the data. The experiment results on the domain adaptation benchmarks show that the proposed method significantly outperforms the state-of-the-art algorithms.

Related papers

• Leveraging Robust Optimization for LLM Alignment under Distribution Shifts [54.654823811482665]
  Large language models (LLMs) increasingly rely on preference alignment methods to steer outputs toward human values. Recent approaches have turned to synthetic data generated by LLMs as a scalable alternative. We propose a novel distribution-aware optimization framework that improves preference alignment in the presence of such shifts.
  arXiv  Detail & Related papers  (2025-04-08T09:14:38Z)
• Optimal Transport Adapter Tuning for Bridging Modality Gaps in Few-Shot Remote Sensing Scene Classification [80.83325513157637]
  Few-Shot Remote Sensing Scene Classification (FS-RSSC) presents the challenge of classifying remote sensing images with limited labeled samples. We propose a novel Optimal Transport Adapter Tuning (OTAT) framework aimed at constructing an ideal Platonic representational space.
  arXiv  Detail & Related papers  (2025-03-19T07:04:24Z)
• Convex Physics Informed Neural Networks for the Monge-Ampère Optimal Transport Problem [49.1574468325115]
  Optimal transportation of raw material from suppliers to customers is an issue arising in logistics.<n>A physics informed neuralnetwork method is advocated here for the solution of the corresponding generalized Monge-Ampere equation.<n>A particular focus is set on the enforcement of transport boundary conditions in the loss function.
  arXiv  Detail & Related papers  (2025-01-17T12:51:25Z)
• Optimal Transport for Domain Adaptation through Gaussian Mixture Models [7.292229955481438]
  Machine learning systems operate under the assumption that training and test data are sampled from a fixed probability distribution.<n>In this work, we explore optimal transport between Gaussian Mixture Models (GMMs), which is conveniently written in terms of the components of source and target GMMs.<n>We experiment with 9 benchmarks, with a total of $85$ adaptation tasks, showing that our methods are more efficient than previous shallow domain adaptation methods.
  arXiv  Detail & Related papers  (2024-03-18T09:32:33Z)
• A Computational Framework for Solving Wasserstein Lagrangian Flows [48.87656245464521]
  In general, the optimal density path is unknown, and solving these variational problems can be computationally challenging. We propose a novel deep learning based framework approaching all of these problems from a unified perspective. We showcase the versatility of the proposed framework by outperforming previous approaches for the single-cell trajectory inference.
  arXiv  Detail & Related papers  (2023-10-16T17:59:54Z)
• Decorrelation using Optimal Transport [0.0]
  We introduce a novel decorrelation method that is able to decorrelate a continuous feature space against protected attributes with optimal transport. We demonstrate how well it performs in the context of jet classification in high energy physics. When moving to multiclass outputs the optimal transport approach performs significantly better than the state-of-the-art, suggesting substantial gains at decorrelating multidimensional feature spaces.
  arXiv  Detail & Related papers  (2023-07-11T11:49:55Z)
• New Perspectives on Regularization and Computation in Optimal Transport-Based Distributionally Robust Optimization [6.522972728187888]
  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)
• Neural Optimal Transport [82.2689844201373]
  We present a novel neural-networks-based algorithm to compute optimal transport maps and plans for strong and weak transport costs. We prove that neural networks are universal approximators of transport plans between probability distributions.
  arXiv  Detail & Related papers  (2022-01-28T16:24:13Z)
• The statistical effect of entropic regularization in optimal transportation [6.269377544160702]
  We provide a closed form for the regularized optimal transport which enables to provide a better understanding of the effect of the regularization from a statistical framework.
  arXiv  Detail & Related papers  (2020-06-09T11:48:37Z)
• Large-Scale Optimal Transport via Adversarial Training with Cycle-Consistency [30.305690062622283]
  We propose an end-to-end approach for large-scale optimal transport, which directly solves the transport map and is compatible with general cost function. We demonstrate the effectiveness of the proposed method against existing methods with large-scale real-world applications.
  arXiv  Detail & Related papers  (2020-03-14T14:06:46Z)
• Bilevel Optimization for Differentially Private Optimization in Energy Systems [53.806512366696275]
  This paper studies how to apply differential privacy to constrained optimization problems whose inputs are sensitive. The paper shows that, under a natural assumption, a bilevel model can be solved efficiently for large-scale nonlinear optimization problems.
  arXiv  Detail & Related papers  (2020-01-26T20:15:28Z)

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.