AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Solving graph compression via optimal transport

Vikas Garg, Tommi Jaakkola

NeurIPS 2019 · Graph learning › Graph algorithms and clustering · approach: Graph comparison and random features · 2 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
OTC instead of best baseline, MSRC-21Cgraph compression · MSRC-21Ctest accuracy: .485 -> .548Improved
OTC instead of REC, MSRC-9 at 20% traingraph compression · MSRC-9test accuracy: .738 -> .784Improved
OTC instead of Alg. Dist. on DHFR at 70% traingraph compression · DHFRtest accuracy: .817 -> .814No clear effect
OTC instead of REC on BZR-MD at 40% traingraph compression · BZR-MDtest accuracy: .563 -> .547Hurt
OTC instead of Heavy on Mutagenicity at 20% traingraph compression · Mutagenicitytest accuracy: .718 -> .749Improved
OTC instead of baselines on compression timegraph compression · standard graph datasetscompression timeImproved
label-aware edge costs (c=0.01 same label, 0.02 different)OTC · synthetic tree and real graphsqualitative compressionImproved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy