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

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

Geometric Deep Learning: Going beyond Euclidean data

Open access

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.

Overview

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

Verification

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?

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

Flagged first, then by citations

Show all 137 references

Research works printed but not linked: 6

  1. defferrard, 0, Convolutional neural networks on graphs with fast localized spectral filtering, Proc Int Conf Neural Information Processing Systems (NIPS), 3844
  2. chang, 2016, A compositional object-based approach to learning physical dynamics
  3. goodfellow, 2016, Deep Learning
  4. glem, 2006, The generation of a unique machine description for chemical structure, Investigational Drugs, 9, 199
  5. preti, 2016, The dynamic functional connectome State-of-the-art and perspectives Science
  6. battaglia, 0, Interaction networks for learning about objects, relations and physics, Proc Int Conf Neural Information Processing Systems (NIPS), 4502

Cited by

Sorted by citations

Items 601–700 of 1,003

Metadata

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
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 › Computer Science › Computer Graphics and Computer-Aided Design › 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