Papers › Graph Convolutional Matrix Completion
Graph Convolutional Matrix Completion
Rianne van den Berg, Thomas N. Kipf, Max Welling
We consider matrix completion for recommender systems from the point of view of link prediction on graphs. Interaction data such as movie ratings can be represented by a bipartite user-item graph with labeled edges denoting observed ratings. Building on recent progress in deep learning on graph-structured data, we propose a graph auto-encoder framework based on differentiable message passing on the bipartite interaction graph. Our model shows competitive performance on standard collaborative filtering benchmarks. In settings where complimentary feature information or structured data such as a social network is available, our framework outperforms recent state-of-the-art methods.
In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.
Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, on Syntology's MCP service (how to connect):
get_citation_path(paper_1="1706.02263", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="1706.02263")
Code
17 repositories listed; official and paper-mentioned ones first.
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.
A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Recommendation Systems | Douban Monti | GC-MC | RMSE | 0.734 | #5 of 8 | Archive leaderboard | report |
| Recommendation Systems | Flixster Monti | GC-MC | RMSE | 0.917 | #5 of 7 | Archive leaderboard | report |
| Recommendation Systems | MovieLens 100K | GC-MC | RMSE (u1 Splits) | 0.905 | #8 of 18 | Archive leaderboard | report |
| Recommendation Systems | MovieLens 100K | GC-MC | RMSE (u1 Splits) | 0.910 | #9 of 18 | Archive leaderboard | report |
| Recommendation Systems | MovieLens 10M | GC-MC | RMSE | 0.777 | #9 of 17 | Archive leaderboard | report |
| Recommendation Systems | MovieLens 1M | GC-MC | RMSE | 0.832 | #6 of 31 | Archive leaderboard | report |
| Recommendation Systems | YahooMusic Monti | GC-MC | RMSE | 20.5 | #4 of 6 | 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.
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