{"url":"/sota/graph-regression-on-pcqm4m-lsc","task":{"name":"Graph Regression","url":"/task/graph-regression","note":null},"dataset":{"name":"PCQM4M-LSC","url":"/dataset/ogb-lsc"},"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":["Test MAE","Validation MAE"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Test MAE":"lower","Validation MAE":"lower"}},"counts":{"rows":11,"rows_with_code":11,"rows_with_paper_page":11,"rows_dated":11,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"Graphormer","metrics":{"Test MAE":"13.28","Validation MAE":"0.1234"},"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},{"rank_in_archive_order":2,"model":"GIN-virtual","metrics":{"Test MAE":"14.87","Validation MAE":"0.1396"},"uses_additional_data":false,"paper_date":"2021-03-17","paper":"/paper/ogb-lsc-a-large-scale-challenge-for-machine","paper_url":"https://arxiv.org/abs/2103.09430v3","paper_title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/ogb_lsc","n_code_links":6,"syntology":null},{"rank_in_archive_order":3,"model":"GCN-Virtual","metrics":{"Test MAE":"15.79","Validation MAE":"0.1536"},"uses_additional_data":false,"paper_date":"2021-03-17","paper":"/paper/ogb-lsc-a-large-scale-challenge-for-machine","paper_url":"https://arxiv.org/abs/2103.09430v3","paper_title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/ogb_lsc","n_code_links":6,"syntology":null},{"rank_in_archive_order":4,"model":"GIN","metrics":{"Test MAE":"16.78"},"uses_additional_data":false,"paper_date":"2021-03-17","paper":"/paper/ogb-lsc-a-large-scale-challenge-for-machine","paper_url":"https://arxiv.org/abs/2103.09430v3","paper_title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/ogb_lsc","n_code_links":6,"syntology":null},{"rank_in_archive_order":5,"model":"GCN","metrics":{"Test MAE":"18.38","Validation MAE":"0.1684"},"uses_additional_data":false,"paper_date":"2021-03-17","paper":"/paper/ogb-lsc-a-large-scale-challenge-for-machine","paper_url":"https://arxiv.org/abs/2103.09430v3","paper_title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/ogb_lsc","n_code_links":6,"syntology":null},{"rank_in_archive_order":6,"model":"MLP-fingerprint","metrics":{"Test MAE":"20.68","Validation MAE":"0.2044"},"uses_additional_data":false,"paper_date":"2021-03-17","paper":"/paper/ogb-lsc-a-large-scale-challenge-for-machine","paper_url":"https://arxiv.org/abs/2103.09430v3","paper_title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/ogb_lsc","n_code_links":6,"syntology":null},{"rank_in_archive_order":7,"model":"O-GNN","metrics":{"Validation MAE":"0.1148"},"uses_additional_data":false,"paper_date":"2023-05-01","paper":"/paper/o-gnn-incorporating-ring-priors-into","paper_url":"https://openreview.net/forum?id=5cFfz6yMVPU","paper_title":"O-GNN: Incorporating Ring Priors into Molecular Modeling","code":"https://github.com/O-GNN/O-GNN","n_code_links":1,"syntology":null},{"rank_in_archive_order":8,"model":"GPTrans-L","metrics":{"Validation MAE":"0.1151"},"uses_additional_data":false,"paper_date":"2023-05-19","paper":"/paper/graph-propagation-transformer-for-graph","paper_url":"https://arxiv.org/abs/2305.11424v3","paper_title":"Graph Propagation Transformer for Graph Representation Learning","code":"https://github.com/czczup/gptrans","n_code_links":1,"syntology":{"n_ran":4,"n_unverified":4,"n_samples":8,"n_pointer_only_licence":8}},{"rank_in_archive_order":9,"model":"Graphormer + GFSA","metrics":{"Validation MAE":"0.1193"},"uses_additional_data":false,"paper_date":"2023-12-07","paper":"/paper/graph-convolutions-enrich-the-self-attention","paper_url":"https://arxiv.org/abs/2312.04234v5","paper_title":"Graph Convolutions Enrich the Self-Attention in Transformers!","code":"https://github.com/jeongwhanchoi/gfsa","n_code_links":1,"syntology":{"n_ran":19,"n_unverified":10,"n_samples":29,"n_pointer_only_licence":0}},{"rank_in_archive_order":10,"model":"EGT","metrics":{"Validation MAE":"0.1224"},"uses_additional_data":false,"paper_date":"2021-08-07","paper":"/paper/edge-augmented-graph-transformers-global-self","paper_url":"https://arxiv.org/abs/2108.03348v3","paper_title":"Global Self-Attention as a Replacement for Graph Convolution","code":"https://github.com/shamim-hussain/egt_pytorch","n_code_links":3,"syntology":{"n_ran":0,"n_unverified":4,"n_samples":4,"n_pointer_only_licence":0}},{"rank_in_archive_order":11,"model":"Higher-Order Transformer","metrics":{"Validation MAE":"0.1263"},"uses_additional_data":false,"paper_date":"2021-10-27","paper":"/paper/transformers-generalize-deepsets-and-can-be","paper_url":"https://arxiv.org/abs/2110.14416v2","paper_title":"Transformers Generalize DeepSets and Can be Extended to Graphs and Hypergraphs","code":"https://github.com/jw9730/hot","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":1}}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,821 of the 9,623 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9623,"papers_checked":6821,"papers_extracted_not_yet_verified":65,"boards_without_verdict":29,"papers_not_yet_extracted":2737},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-25T09:33:49+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":4,"rows_with_any_sample_ran":2,"distinct_papers_with_graph_line":4,"distinct_papers_with_any_sample_ran":2,"samples_over_distinct_papers":{"n_ran":23,"n_unverified":19,"n_samples":42,"n_pointer_only_licence":9,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":23,"n_unverified":19,"n_samples":42,"n_pointer_only_licence":9,"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"}}}