Generalized Dimension Reduction Using Semi-Relaxed Gromov-Wasserstein Distance
Ranthony A. Clark, Tom Needham, Thomas Weighill
摘要
Dimension reduction techniques typically seek an embedding of a high-dimensional point cloud into a low-dimensional Euclidean space which optimally preserves the geometry of the input data. Based on expert knowledge, one may instead wish to embed the data into some other manifold or metric space in order to better reflect the geometry or topology of the point cloud. We propose a general method for manifold-valued multidimensional scaling based on concepts from optimal transport. In particular, we establish theoretical connections between the recently introduced semi-relaxed Gromov-Wasserstein (srGW) framework and multidimensional scaling by solving the Monge problem in this setting. We also derive novel connections between srGW distance and Gromov-Hausdorff distance. We apply our computational framework to analyze ensembles of political redistricting plans for states with two Congressional districts, achieving an effective visualization of the ensemble as a distribution on a circle which can be used to characterize typical neutral plans, and to flag outliers.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- Joint Metric Space Embedding by Unbalanced Optimal Transport with Gromov-Wasserstein Marginal PenalizationFlorian Beier, Moritz Piening, Robert Beinert, Gabriele SteidlICML 2025
- Gromov-Wasserstein at Scale, Beyond Squared NormsGuillaume Houry, Jean Feydy, François-Xavier VialardICML 2026
它引用的顶会 Paper3
- CO-Optimal TransportTitouan Vayer, Ievgen Redko, Rémi Flamary, Nicolas CourtyNeurIPS 2020 · 被引用 86 次
- Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and CostsMeyer Scetbon, Gabriel Peyré, Marco CuturiICML 2022 · 被引用 73 次
- Compact Redistricting Plans Have Many Spanning TreesAriel D. Procaccia, Jamie Tucker-FoltzSODA 2022 · 被引用 9 次
相关 Paper
- Semidefinite Relaxations of the Gromov-Wasserstein DistanceJunyu Chen, Binh T. Nguyen, Shang Koh, Yong Sheng SohNeurIPS 2024 · 被引用 18 次
- Wasserstein Wormhole: Scalable Optimal Transport Distance with TransformerDoron Haviv, Russell Zhang Kunes, Thomas Dougherty, Cassandra Burdziak 等ICML 2024 · 被引用 15 次
- Achieving Structurally Robust Gromov Wasserstein Distance via Adaptive Dual-MaskKangke Cheng, Jiawei Huang, Jingni Song, Wanlin Zhang 等ICML 2026
- The Shape of Data: Intrinsic Distance for Data DistributionsAnton Tsitsulin, Marina Munkhoeva, Davide Mottin, Panagiotis Karras 等ICLR 2020 · 被引用 57 次
- Disentangled Representation Learning with the Gromov-Monge GapThéo Uscidda, Luca Eyring, Karsten Roth, Fabian J. Theis 等ICLR 2025
