aiqbench analysis
This research introduces a dynamic neural optimal transport framework designed to align source distributions with specific subpopulations of a target, addressing scenarios where direct matching is inappropriate due to irrelevant components. By learning the terminal distribution within the target's support rather than assuming it fixed, the method improves upon existing approaches for positive-unlabeled learning and domain translation tasks. The work represents a significant advancement in handling partial alignment challenges within machine learning theory and applications.
Dynamic Neural Optimal Transport for Subset Alignment
arXiv:2610.24258v1 Announce Type: new Abstract: We study optimal transport between distributions when only a subset of the target population is relevant to the source. The goal is to map the source distribution to a reweighted target distribution whose density ratio with respect to the full target lies in $[0, c]$. This constraint enables the transported distribution to select an appropriate target subpopulation while limiting how strongly any region of the target can be emphasized. We propose a dynamic neural optimal transport framework for this setting using two neural networks. The first parameterizes a time-dependent potential whose spatial gradient defines the velocity field and whose terminal value enforces the density-ratio constraint. The second parameterizes an interpolation between the source distribution and the learned terminal distribution. Unlike prior neural dynamic optimal transport methods, which typically assume a fixed terminal distribution, our formulation learns the terminal distribution within the support of the target. We demonstrate the method on positive-unlabeled learning, unpaired domain translation, and trajectory inference, where meaningful alignments exist between source and target distributions, but direct distribution matching is inappropriate because the target contains additional or irrelevant components
Abstract:We study optimal transport between distributions when only a subset of the target population is relevant to the source. The goal is to map the source distribution to a reweighted target distribution whose density ratio with respect to the full target lies in $[0, c]$. This constraint enables the transported distribution to select an appropriate target subpopulation while limiting how strongly any region of the target can be emphasized. We propose a dynamic neural optimal transport framework for this setting using two neural networks. The first parameterizes a time-dependent potential whose spatial gradient defines the velocity field and whose terminal value enforces the density-ratio constraint. The second parameterizes an interpolation between the source distribution and the learned terminal distribution. Unlike prior neural dynamic optimal transport methods, which typically assume a fixed terminal distribution, our formulation learns the terminal distribution within the support of the target. We demonstrate the method on positive-unlabeled learning, unpaired domain translation, and trajectory inference, where meaningful alignments exist between source and target distributions, but direct distribution matching is inappropriate because the target contains additional or irrelevant components
Machine Learning (cs.LG)
arXiv:2610.24258 [cs.LG]
(or arXiv:2610.24258v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2610.24258 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 275 words
Related coverage
Visual-Invariance-Augmented Feature Optimal Alignment for Transferable Adversarial Attacks against Closed-Source MLLMs
arXiv · Oct 7, 2026
Simultaneous Neural Optimal Transport
arXiv · Sep 30, 2026
Unsupervised Multi-Scale Gromov-Wasserstein Hypergraph Alignment
arXiv · Sep 1, 2026
Distribution Alignment for One-Shot Federated Learning via Optimal Transport
arXiv · Jun 16, 2026