CoChat

Echo state graph neural networks with analogue random resistive memory arrays

Open access

The DOI matches its Crossref record; 65 of the 65 references it cites were found in a registry or an index.

Abstract

Recent years have witnessed a surge of interest in learning representations of graph-structured data, with applications from social networks to drug discovery. However, graph neural networks, the machine learning models for handling graph-structured data, face significant challenges when running on conventional digital hardware, including the slowdown of Moore’s law due to transistor scaling limits and the von Neumann bottleneck incurred by physically separated memory and processing units, as well as a high training cost. Here we present a hardware–software co-design to address these challenges, by designing an echo state graph neural network based on random resistive memory arrays, which are built from low-cost, nanoscale and stackable resistors for efficient in-memory computing. This approach leverages the intrinsic stochasticity of dielectric breakdown in resistive switching to implement random projections in hardware for an echo state network that effectively minimizes the training complexity thanks to its fixed and random weights. The system demonstrates state-of-the-art performance on both graph classification using the MUTAG and COLLAB datasets and node classification using the CORA dataset, achieving 2.16×, 35.42× and 40.37× improvements in energy efficiency for a projected random resistive memory-based hybrid analogue–digital system over a state-of-the-art graphics processing unit and 99.35%, 99.99% and 91.40% reductions of backward pass complexity compared with conventional graph learning. The results point to a promising direction for next-generation artificial intelligence systems for graph learning.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1038/s42256-023-00609-5

Cites

65 of 65 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 65 references

Research works printed but not linked: 4

  1. Kipf, T. N. & Welling, M. Semi-supervised classification with graph convolutional networks.In Proc. 5th International Conference on Learning Representations (OpenReview.net, 2017).
  2. Veličković, P. et al. Graph attention networks. In Proc. 6th International Conference on Learning Representations (OpenReview.net, 2018).
  3. Niepert, M., Ahmed, M. & Kutzkov, K. Learning convolutional neural networks for graphs.In International Conference on Machine Learning 2014–2023 (PMLR, 2016).
  4. Hamilton, W., Ying, Z. & Leskovec, J. Inductive representation learning on large graphs. In Advances in Neural Information Processing Systems (Curran Associates, Inc., 2017).

Cited by

See all 93

Metadata

Authors
Wang, S., Li, Y., Wang, D., Zhang, W., Chen, X., Dong, D., Wang, S., Zhang, X., Lin, P., Gallicchio, C., Xu, X., Liu, Q., Cheng, K.-T., Wang, Z., Shang, D., & Liu, M.
Affiliations
  • Chinese Academy of Sciences (CN)
  • University of Hong Kong (HK)
  • Fudan University (CN)
  • Zhejiang University (CN)
  • University of Pisa (IT)
  • Hong Kong University of Science and Technology (HK)
Corresponding author
  • Wang, Zhongrui
  • Shang, Dashan
Venue
Nature Machine Intelligence
Published
2023-02-13
Volume
5
Issue
2
Pages
104-113
ISSN
2522-5839 (ISSN-L)
OpenAlex
W4320486502
Cited by
84
References
65
Citations by year
2026: 15 · 2025: 26 · 2024: 25 · 2023: 18
FWCI
6.24
Type
journal article
Language
en
Open access
Licence
Locations
  • Nature Machine Intelligence (publishedVersion, cc-by)
  • Rare & Special e-Zone (The Hong Kong University of Science and Technology) (submittedVersion)
  • CINECA IRIS Institutial research information system (University of Pisa) (submittedVersion, cc-by)
Funders
  • National Natural Science Foundation of China (61888102, 61874138, 62122004, XDB44000000, 2018YFA0701500, Z210006, 61821091)
  • Chinese Academy of Sciences (XDB44000000, 61888102)
  • Innovation and Technology Commission (MHP/066/20)
  • Innovation and Technology Fund
Topics
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Memory and Neural Computing
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Reservoir Computing
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
Keywords
echo state networks, graph neural networks, in-memory computing, hardware-software co-design, dielectric breakdown, energy efficiency, node classification, graph classification, von Neumann bottleneck

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Echo state graph neural networks with analogue random resistive memory arrays. https://app.cochat.ai/papers/10.1038/s42256-023-00609-5
The paper
Wang, S., Li, Y., Wang, D., Zhang, W., Chen, X., Dong, D., Wang, S., Zhang, X., Lin, P., Gallicchio, C., Xu, X., Liu, Q., Cheng, K.-T., Wang, Z., Shang, D., & Liu, M. (2023). Echo state graph neural networks with analogue random resistive memory arrays. Nature Machine Intelligence. https://doi.org/10.1038/s42256-023-00609-5

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.