{"total":16,"rows":[{"id":"2408.08233","title":"The Z-Gromov-Wasserstein Distance","created":"2024-08-15","cited_by_count":12,"area":null},{"id":"2303.05978","title":"Uncovering Challenges of Solving the Continuous Gromov-Wasserstein Problem","created":"2023-03-10","cited_by_count":6,"area":null},{"id":"2408.02433","title":"On Probabilistic Embeddings in Optimal Dimension Reduction","created":"2024-08-05","cited_by_count":5,"area":null},{"id":"2311.01375","title":"Monotone Generative Modeling via a Gromov-Monge Embedding","created":"2023-11-02","cited_by_count":3,"area":null},{"id":"2407.07829","title":"Disentangled Representation Learning with the Gromov-Monge Gap","created":"2024-07-10","cited_by_count":3,"area":null},{"id":"2407.10495","title":"Improving Hyperbolic Representations via Gromov-Wasserstein Regularization","created":"2024-07-15","cited_by_count":2,"area":null},{"id":"2311.13883","title":"Leveraging Optimal Transport via Projections on Subspaces for Machine Learning Applications","created":"2023-11-23","cited_by_count":1,"area":null},{"id":"2410.16669","title":"Linear Partial Gromov-Wasserstein Embedding","created":"2024-10-22","cited_by_count":1,"area":null},{"id":"2605.08546","title":"Sliced Inner Product Gromov-Wasserstein Distances","created":"2026-05-08","cited_by_count":1,"area":null},{"id":"2407.14957","title":"Strongly Isomorphic Neural Optimal Transport Across Incomparable Spaces","created":"2024-07-20","cited_by_count":0,"area":null},{"id":"2602.16265","title":"On sparsity, extremal structure, and monotonicity properties of Wasserstein and Gromov-Wasserstein optimal transport plans","created":"2026-02-18","cited_by_count":0,"area":null},{"id":"2605.13753","title":"Min Generalized Sliced Gromov Wasserstein: A Scalable Path to Gromov Wasserstein","created":"2026-05-13","cited_by_count":0,"area":null},{"id":"2605.28134","title":"Convergence of empirical subgradients for optimal transport-based objectives","created":"2026-05-27","cited_by_count":0,"area":null},{"id":"2607.16178","title":"Cluster-Aware Matching via Laplacian Optimal Transport","created":"2026-07-17","cited_by_count":0,"area":null},{"id":"2608.11016","title":"Gromov-Wasserstein Quantization and Clustering: Structure, Rates, and Algorithms","created":"2026-08-11","cited_by_count":0,"area":null},{"id":"2608.27500","title":"Optimal Transport for Network Comparison: A Unified Review with New Spectral Bounds and Machine Learning Applications","created":"2026-08-27","cited_by_count":0,"area":null}],"next_cursor":null}