Papers › Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs

Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs

10 Apr 2017CVPR 2017 7arXiv:1704.02901archive 2025-07-28

Martin Simonovsky, Nikos Komodakis

A number of problems can be formulated as prediction on graph-structured data. In this work, we generalize the convolution operator from regular grids to arbitrary graphs while avoiding the spectral domain, which allows us to handle graphs of varying size and connectivity. To move beyond a simple diffusion, filter weights are conditioned on the specific edge labels in the neighborhood of a vertex. Together with the proper choice of graph coarsening, we explore constructing deep neural networks for graph classification. In particular, we demonstrate the generality of our formulation in point cloud classification, where we set the new state of the art, and on a graph classification dataset, where we outperform other deep learning approaches. The source code is available at https://github.com/mys007/ecc

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1704.02901")

Code

Syntology Ran 0 of 2 code samples harvested from 1 repository linked to this paper; 2 have no recorded run.

By repository: community (archive-listed): 2 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

mys007/ecc officialmentioned in papermentioned on GitHubpytorch report
rusty1s/pytorch_cluster mentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

2 samples harvested; 0 ran; 0 honoured the contract we drafted; 2 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

2unverified

Licence: 0 of the 2 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from rusty1s/pytorch_cluster. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

graclus_cluster rusty1s/pytorch_cluster/torch_cluster/graclus.py community (archive-listed) unverified MIT (permissive) · 0e3b09435d6bad19 · report
grid_cluster rusty1s/pytorch_cluster/torch_cluster/grid.py community (archive-listed) unverified MIT (permissive) · c661c2264020cbb0 · report

Tasks

3D Object Classification3D Point Cloud ClassificationClassificationGeneral ClassificationGraph ClassificationPoint Cloud Classification

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
3D Object Classification ModelNet10 ECC (12 votes) Accuracy 90 #4 of 4 Archive leaderboard report
3D Object Classification ModelNet40 ECC (12 votes) Classification Accuracy 83.2 #7 of 7 Archive leaderboard report
3D Point Cloud Classification ModelNet40 ECC Mean Accuracy 83.2 #107 of 111 Archive leaderboard report
3D Point Cloud Classification ModelNet40 ECC Overall Accuracy 87.4 #107 of 111 Archive leaderboard report
3D Point Cloud Classification Sydney Urban Objects ECC F1 78.4 #1 of 3 Archive leaderboard report
Graph Classification D&D ECC (5 scores) Accuracy 74.1% #47 of 53 Archive leaderboard report
Graph Classification ENZYMES ECC (5 scores) Accuracy 52.67% #40 of 54 Archive leaderboard report
Graph Classification MUTAG ECC (5 scores) Accuracy 88.33% #40 of 74 Archive leaderboard report
Graph Classification NCI1 ECC (5 scores) Accuracy 83.8% #25 of 69 Archive leaderboard report
Graph Classification NCI109 ECC (5 scores) Accuracy 82.14 #18 of 38 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

Convolution

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections