AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

GCOMB: Learning Budget-constrained Combinatorial Algorithms over Billion-sized Graphs

Sahil Manchanda, AKASH MITTAL, Anuj Dhawan, Sourav Medya, Sayan Ranu, Ambuj Singh

NeurIPS 2020 · Graph learning › Graph algorithms and clustering · approach: Neural combinatorial optimization on graphs · 22 citations (OpenAlex)

Read the paper

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
Add Q-learning on top of GCN node scores instead of selecting top-b nodes by predicted marginal gain (ablation)GCOMB · MCP, Gowalla and YouTubecoverage improvement (%): up to 10%Improved
Add noise predictor to prune poor nodes (ablation)GCOMB · MCP, Gowallarunning timeImproved
Add noise predictor to prune poor nodes (ablation)GCOMB · MCP, GowallacoverageImproved
GCOMB versus Greedy on random bipartite graphsGCOMB · MCP BP graphs, b=15coverage: 0.89 vs 0.89 on BP-2kNo clear effect
GCOMB versus GCN-TreeSearchGCOMB · MCP BP-2k, b=15coverage: 0.86 -> 0.89Improved

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