{"url":"/sota/graph-regression-on-esr2","task":{"name":"Graph Regression","url":"/task/graph-regression","note":null},"dataset":{"name":"ESR2","url":"/dataset/dockstring"},"category":"Graphs","categories":["Graphs"],"category_note":null,"description":"The regression task is similar to graph classification but using different loss function and performance metric.","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["R2","RMSE"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"R2":null,"RMSE":"lower"}},"counts":{"rows":9,"rows_with_code":9,"rows_with_paper_page":9,"rows_dated":9,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"ESA (Edge set attention, no positional encodings)","metrics":{"R2":"0.697±0.000","RMSE":"0.486±0.697"},"uses_additional_data":false,"paper_date":"2024-02-16","paper":"/paper/masked-attention-is-all-you-need-for-graphs","paper_url":"https://arxiv.org/abs/2402.10793v2","paper_title":"An end-to-end attention-based approach for learning on graphs","code":"https://github.com/davidbuterez/edge-set-attention","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"PNA","metrics":{"R2":"0.696±0.000","RMSE":"0.486±0.696"},"uses_additional_data":false,"paper_date":"2020-04-12","paper":"/paper/principal-neighbourhood-aggregation-for-graph","paper_url":"https://arxiv.org/abs/2004.05718v5","paper_title":"Principal Neighbourhood Aggregation for Graph Nets","code":"https://github.com/rusty1s/pytorch_geometric","n_code_links":8,"syntology":{"n_ran":33,"n_unverified":22,"n_samples":55,"n_pointer_only_licence":48}},{"rank_in_archive_order":3,"model":"DropGIN","metrics":{"R2":"0.675±0.000","RMSE":"0.503±0.675"},"uses_additional_data":false,"paper_date":"2021-11-11","paper":"/paper/dropgnn-random-dropouts-increase-the","paper_url":"https://arxiv.org/abs/2111.06283v1","paper_title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","code":"https://github.com/karolismart/dropgnn","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":3,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":4,"model":"GIN","metrics":{"R2":"0.668±0.000","RMSE":"0.509±0.668"},"uses_additional_data":false,"paper_date":"2018-10-01","paper":"/paper/how-powerful-are-graph-neural-networks","paper_url":"http://arxiv.org/abs/1810.00826v3","paper_title":"How Powerful are Graph Neural Networks?","code":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gin","n_code_links":19,"syntology":{"n_ran":3,"n_unverified":7,"n_samples":10,"n_pointer_only_licence":5}},{"rank_in_archive_order":5,"model":"GAT","metrics":{"R2":"0.666±0.000","RMSE":"0.510±0.666"},"uses_additional_data":false,"paper_date":"2017-10-30","paper":"/paper/graph-attention-networks","paper_url":"http://arxiv.org/abs/1710.10903v3","paper_title":"Graph Attention Networks","code":"https://github.com/labmlai/annotated_deep_learning_paper_implementations","n_code_links":93,"syntology":{"n_ran":50,"n_unverified":56,"n_samples":106,"n_pointer_only_licence":43}},{"rank_in_archive_order":6,"model":"GATv2","metrics":{"R2":"0.655±0.000","RMSE":"0.518±0.655"},"uses_additional_data":false,"paper_date":"2021-05-30","paper":"/paper/how-attentive-are-graph-attention-networks","paper_url":"https://arxiv.org/abs/2105.14491v3","paper_title":"How Attentive are Graph Attention Networks?","code":"https://github.com/labmlai/annotated_deep_learning_paper_implementations","n_code_links":8,"syntology":{"n_ran":6,"n_unverified":10,"n_samples":16,"n_pointer_only_licence":1}},{"rank_in_archive_order":7,"model":"GCN","metrics":{"R2":"0.642±0.000","RMSE":"0.528±0.642"},"uses_additional_data":false,"paper_date":"2016-09-09","paper":"/paper/semi-supervised-classification-with-graph","paper_url":"http://arxiv.org/abs/1609.02907v4","paper_title":"Semi-Supervised Classification with Graph Convolutional Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gcn","n_code_links":55,"syntology":{"n_ran":31,"n_unverified":27,"n_samples":58,"n_pointer_only_licence":22}},{"rank_in_archive_order":8,"model":"TokenGT","metrics":{"R2":"0.641±0.000","RMSE":"0.529±0.641"},"uses_additional_data":false,"paper_date":"2022-07-06","paper":"/paper/pure-transformers-are-powerful-graph-learners","paper_url":"https://arxiv.org/abs/2207.02505v2","paper_title":"Pure Transformers are Powerful Graph Learners","code":"https://github.com/jw9730/tokengt","n_code_links":2,"syntology":{"n_ran":7,"n_unverified":0,"n_samples":7,"n_pointer_only_licence":7}},{"rank_in_archive_order":9,"model":"Graphormer","metrics":{"R2":"OOM","RMSE":"OOM"},"uses_additional_data":false,"paper_date":"2021-06-09","paper":"/paper/do-transformers-really-perform-bad-for-graph","paper_url":"https://arxiv.org/abs/2106.05234v5","paper_title":"Do Transformers Really Perform Bad for Graph Representation?","code":"https://github.com/microsoft/Graphormer","n_code_links":5,"syntology":null}],"since_archive":{"present":false,"note":"No Syntology-extracted rows are published in this build."},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":7,"rows_with_any_sample_ran":6,"distinct_papers_with_graph_line":7,"distinct_papers_with_any_sample_ran":6,"samples_over_distinct_papers":{"n_ran":130,"n_unverified":125,"n_samples":255,"n_pointer_only_licence":126,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":130,"n_unverified":125,"n_samples":255,"n_pointer_only_licence":126,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}