

























Abstract:Fused Gromov-Wasserstein (FGW) distances provide a principled framework for comparing objects by jointly aligning structure and node features. However, existing FGW formulations treat all features uniformly, which limits interpretability and robustness in high-dimensional settings where many features may be irrelevant or noisy. We introduce FGW distances with feature selection, which incorporate adaptive feature suppression weights into the FGW objective to selectively downweight or suppress differentiating features during alignment. We propose two approaches: (1) regularized FGW with Lasso and Ridge penalties, and (2) FGW with simplex-constrained weights, including groupwise extensions. We analyze the resulting models and establish their key theoretical properties, including bounds relative to classical FGW and Gromov-Wasserstein distances, and metric behavior. An efficient alternating minimization algorithm is developed. Experiments illustrate how feature suppression enhances interpretability and reveals task-relevant structure, with a special application to computational redistricting.
| Subjects: | Machine Learning (cs.LG); Computers and Society (cs.CY); Metric Geometry (math.MG) |
| Cite as: | arXiv:2605.12161 [cs.LG] |
| (or arXiv:2605.12161v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.12161 arXiv-issued DOI via DataCite (pending registration) |
From: Harlin Lee [view email]
[v1]
Tue, 12 May 2026 14:11:25 UTC (9,146 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。