Density-Reweighted Entropic Optimal Transport: Decoupling Geometry from Sampling Density

• URL: http://arxiv.org/abs/2608.16506v1
• Date: Mon, 17 Aug 2026 12:46:03 GMT
• Title: Density-Reweighted Entropic Optimal Transport: Decoupling Geometry from Sampling Density
• Abstract summary: We propose a density-reweighted EOT framework in which the influence of sampling density on the transport plan can be discounted to a desired degree.<n>We show that our approach recovers geometrically faithful correspondences when datasets exhibit substantial sampling density disparity.
• Score: 11.771119649617575
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Dataset alignment is a central step in data analysis across science and engineering, where the goal is to match observations between datasets. Entropic Optimal Transport (EOT) offers a computationally tractable framework for this task by encoding cross-dataset affinities in a transport plan. However, when two datasets are sampled from geometrically similar low-dimensional structures with substantially different sampling densities, the EOT plan may match points by relative sampling density rather than geometric proximity, yielding geometrically misleading correspondences. To address this issue, we propose a density-reweighted EOT framework in which the influence of sampling density on the transport plan can be discounted to a desired degree, ranging from standard EOT to alignment driven purely by underlying geometry. Under suitable regularity conditions, we establish convergence of the reweighted EOT plan to a family of population-level plans whose dependence on sampling density is made explicit. Through simulations, we show that our approach recovers geometrically faithful correspondences, improving over related EOT-based frameworks when datasets exhibit substantial sampling density disparity.

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)
• Towards Fast GNN Surrogates for CO2 Migration in Complex Geological Formations [58.079925240809644]
  We propose an end-to-end graph neural surrogate tailored to CO$$ibility plume migration forecasting in geological storage.<n>The method is evaluated on the SPE11A benchmark, a well-known industry test case designed to assess CO$$ storage scenarios.<n>The proposed model produces competitive forecasts of gas saturation and liquid-phase density, with cumulative errors that remain moderate over extended forecasting horizons.
  arXiv  Detail & Related papers  (2026-06-15T18:19:17Z)
• Geometry-Aware Dataset Condensation for Diffusion Model Training [103.45641113998839]
  We propose to reformulate real subset selection as a geometry-aware distribution alignment problem.<n>By incorporating one-sided partial optimal transport, our method selectively aligns a compact subset with the full data distribution.<n>Experiments across diffusion variants, subset sizes, image resolutions, and training rounds show that our method achieves superior fidelity and distributional coverage.
  arXiv  Detail & Related papers  (2026-06-04T08:53:58Z)
• DR-SNE: Density-Regularized Stochastic Neighbor Embedding [0.0]
  We introduce Density-Regularized SNE (DR-SNE), which augments the neighbor embedding objective with a density regularization term derived from normalized log-density estimates.<n>DR-SNE improves density preservation while maintaining competitive neighborhood fidelity.<n>These results suggest that incorporating density information complements geometry-focused objectives in dimensionality reduction.
  arXiv  Detail & Related papers  (2026-05-03T21:08:15Z)
• GeodesicNVS: Probability Density Geodesic Flow Matching for Novel View Synthesis [54.39598154430305]
  We propose a Data-to-Data Flow Matching framework that learns deterministic transformations directly between paired views.<n>PDG-FM constrains flow trajectories using geodesic interpolants derived from probability density metrics of pretrained diffusion models.<n>These results highlight the advantages of incorporating data-dependent geometric regularization into deterministic flow matching for consistent novel view generation.
  arXiv  Detail & Related papers  (2026-03-01T09:30:11Z)
• Conic Formulations of Transport Metrics for Unbalanced Measure Networks and Hypernetworks [3.7687375904925484]
  This paper is concerned with the Conic Gromov-Wasserstein (CGW) distance introduced by S'ejourn'e, Vialard, and Peyr'e.<n>We provide a novel formulation in terms of semi-couplings, and extend the framework beyond the metric measure space setting.
  arXiv  Detail & Related papers  (2025-08-14T17:55:55Z)
• Geometric Operator Learning with Optimal Transport [77.16909146519227]
  We propose integrating optimal transport (OT) into operator learning for partial differential equations (PDEs) on complex geometries.<n>For 3D simulations focused on surfaces, our OT-based neural operator embeds the surface geometry into a 2D parameterized latent space.<n> Experiments with Reynolds-averaged Navier-Stokes equations (RANS) on the ShapeNet-Car and DrivAerNet-Car datasets show that our method achieves better accuracy and also reduces computational expenses.
  arXiv  Detail & Related papers  (2025-07-26T21:28:25Z)
• Density Estimation via Binless Multidimensional Integration [45.21975243399607]
  We introduce the Binless Multidimensional Thermodynamic Integration (BMTI) method for nonparametric, robust, and data-efficient density estimation. BMTI estimates the logarithm of the density by initially computing log-density differences between neighbouring data points. The method is tested on a variety of complex synthetic high-dimensional datasets, and is benchmarked on realistic datasets from the chemical physics literature.
  arXiv  Detail & Related papers  (2024-07-10T23:45:20Z)
• Entropic Optimal Transport Eigenmaps for Nonlinear Alignment and Joint Embedding of High-Dimensional Datasets [11.105392318582677]
  We propose a principled approach for aligning and jointly embedding a pair of datasets with theoretical guarantees. Our approach leverages the leading singular vectors of the EOT plan matrix between two datasets to extract their shared underlying structure. We show that in a high-dimensional regime, the EOT plan recovers the shared manifold structure by approximating a kernel function evaluated at the locations of the latent variables.
  arXiv  Detail & Related papers  (2024-07-01T18:48:55Z)
• InfoOT: Information Maximizing Optimal Transport [58.72713603244467]
  InfoOT is an information-theoretic extension of optimal transport. It maximizes the mutual information between domains while minimizing geometric distances. This formulation yields a new projection method that is robust to outliers and generalizes to unseen samples.
  arXiv  Detail & Related papers  (2022-10-06T18:55:41Z)

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.