Research map / Graph learning / Graph self-supervised learning
Representing Graphs via Gromov-Wasserstein Factorization
Hongteng Xu, Jiachang Liu, Dixin Luo, Lawrence Carin
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI 2020 · similarity 0.94)
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching (NeurIPS 2019 · similarity 0.91)
- THESAURUS: Contrastive Graph Clustering by Swapping Fused Gromov-Wasserstein Couplings (AAAI 2025 · similarity 0.89)
- Learning Graph Representation via Graph Entropy Maximization (ICML 2024 · similarity 0.88)
- Exploring Consistency in Graph Representations: from Graph Kernels to Graph Neural Networks (NeurIPS 2024 · similarity 0.88)
- Exploitation of a Latent Mechanism in Graph Contrastive Learning: Representation Scattering (NeurIPS 2024 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
