Cited by 3,661Advanced Graph Neural NetworksTopological and Geometric Data Analysis3D Shape Modeling and Analysis

Geometric Deep Learning: Going beyond Euclidean data

Open access
Bronstein, Michael M., Bruna, Joan, LeCun, Yann, Szlam, Arthur, Vandergheynst, Pierre·2017·IEEE Signal Processing Magazine

Abstract

Geometric deep learning is an umbrella term for emerging techniques attempting to generalize (structured) deep neural models to non-Euclidean domains, such as graphs and manifolds. The purpose of this article is to overview different examples of geometric deep-learning problems and present available solutions, key difficulties, applications, and future research directions in this nascent field.

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1109/msp.2017.2693418

Cites

137 of 137 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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?

  • Existing surveys on graph neural networks only include some of the GNNs and examine a limited number of works, thereby missing the most recent development of GNNs.

    “In summary, existing surveys only include some of the GNNs and examine a limited number of works, thereby missing the most recent development of GNNs.”

    From A Comprehensive Survey on Graph Neural Networks (2021) · cites this paper as [9]

Self-check

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

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

Cites

Flagged first, then by citations

Research works printed but not linked: 7

  1. [13][13] I. Goodfellow, Y. Bengio, and A. Courville, Deep Learning . MIT Press, 2016, in preparation. -
  2. [34][34] S. Cao, W. Lu, and Q. Xu, 'GraRep: Learning graph representations with global structural information,' in Proc. IKM , 2015. -
  3. [45][45] M. Defferrard, X. Bresson, and P. Vandergheynst, 'Convolutional neural networks on graphs with fast localized spectral filtering,' in Proc. NIPS , 2016. -
  4. [105][105] A. M. Bronstein, M. M. Bronstein, L. J. Guibas, and M. Ovsjanikov, 'ShapeGoogle: Geometric words and expressions for invariant shape retrieval,' ACM Trans. Graphics , vol. 30, no. 1, p. 1, 2011. -
  5. [111][111] P. Battaglia, R. Pascanu, M. Lai, D. J. Rezende et al. , 'Interaction networks for learning about objects, relations and physics,' in Proc. NIPS , 2016. -
  6. [113][113] H. L. Morgan, 'The generation of a unique machine description for chemical structure,' J. Chemical Documentation , vol. 5, no. 2, pp. 107113, 1965. -
  7. [114][114] R. C. Glem, A. Bender, C. H. Arnby, L. Carlsson, S. Boyer, and J. Smith, 'The generation of a unique machine description for chemical structure,' Investigational Drugs , vol. 9, no. 3, pp. 199-204, 2006. -

Cited by

Sorted by citations

Authors
Bronstein, M. M., Bruna, J., LeCun, Y., Szlam, A., & Vandergheynst, P.
Affiliations
  • Tel Aviv University (IL)
  • Courant Institute of Mathematical Sciences (US)
  • Meta (United Kingdom) (GB)
  • Meta (United States) (US)
  • École Polytechnique Fédérale de Lausanne (CH)
Venue
IEEE Signal Processing Magazine
Published
2017-07
Volume
34
Issue
4
Pages
18-42
ISSN
  • 1053-5888 (ISSN-L)
  • 1558-0792
OpenAlex
W2558748708
Cited by
3,661
References
137
Citations by year
2026: 350 · 2025: 412 · 2024: 388 · 2023: 428 · 2022: 462 · 2021: 567 · 2020: 493 · 2019: 353 · 2018: 181 · 2017: 25 · 2016: 1
FWCI
169.40
Type
journal article
Language
en
Open access
Locations
  • IEEE Signal Processing Magazine (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • HAL (submittedVersion)
  • Infoscience (Ecole Polytechnique Fédérale de Lausanne) (submittedVersion)
  • Infoscience (Ecole Polytechnique Fédérale de Lausanne) (submittedVersion, cc-by-nc-nd)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Topological and Geometric Data Analysis
  • Physical Sciences › Engineering › Computational Mechanics › 3D Shape Modeling and Analysis
Keywords
geometric deep learning, non-Euclidean data, graph neural networks, manifold learning, structured data, deep neural network

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