GraphBench

RB graph

Graph Regression Dataset page ↗

Graph regression Predict the optimal objective value for maximum independent set in the supervised setting, or train node scores with differentiable surrogates and feasibility-preserving decoders for maximum independent set, max-cut, and graph coloring. Evaluated by MAE.

Dataset details

Task

Predict the optimal objective value for maximum independent set in the supervised setting, or train node scores with differentiable surrogates and feasibility-preserving decoders for maximum independent set, max-cut, and graph coloring.

Data

RB-model instances contain n groups of k vertices and use a constraint-tightness parameter p; GraphBench rejection-samples to keep graph sizes in configured ranges and provides small and large variants with 50,000 instances per dataset.

Features

The graphs contain no node or edge attributes. Topology encodes the optimization instance and solver outputs supply supervised optimum-value labels where available.

Splits and evaluation

Supervised objective prediction is evaluated by MAE. In unsupervised runs, the decoded feasible solution is scored by its achieved objective rather than classification accuracy.

Quirks and pitfalls

RB means the RB random constraint graph model, not random bipartite graph. Its planted group structure and tuned hardness parameters differ materially from ER and BA; report the problem, size regime, and learning protocol.

Sources

SOTA Progression

new SOTA matches SOTA at that time other proposed result other baseline result

Leaderboard

#ModelAccuracy ↑Paper
1
Diffusion Wavelets
0.8500
2
GraphSAGE
0.8100
3
GCN
0.7800
4
Node2Vec
0.6200
5
DeepWalk
0.6000
SOTA performance set a new SOTA at the time matched the SOTA at the time