You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I'm interested in contributing an implementation of Attract-Repel embeddings from the paper "Pseudo-Euclidean Attract-Repel Embeddings for Undirected Graphs" (Peysakhovich et al.). https://arxiv.org/pdf/2106.09671
This approach addresses a fundamental limitation in traditional graph embeddings: their inability to effectively represent non-transitive relationships. By splitting node representations into "attract" and "repel" components, the method improves link prediction performance, especially on heterophilic graphs.
The implementation would include:
Core AR embedding layers that can be plugged into existing models
AR versions of common layers like GCNConv
Utilities for calculating R-fraction and other metrics
Example notebooks demonstrating improvements on link prediction tasks
The method has shown 10-20% AUC improvements on heterophilic networks while requiring minimal architectural changes. Result of a rudimentary implementation here: https://substack.com/home/post/p-157861370
Would the PyG team be interested in such a contribution? I'd appreciate any feedback or guidance before submitting a PR.
Thanks,
Tommy
Alternatives
No response
Additional context
No response
The text was updated successfully, but these errors were encountered:
🚀 The feature, motivation and pitch
Hi PyG team,
I'm interested in contributing an implementation of Attract-Repel embeddings from the paper "Pseudo-Euclidean Attract-Repel Embeddings for Undirected Graphs" (Peysakhovich et al.). https://arxiv.org/pdf/2106.09671
This approach addresses a fundamental limitation in traditional graph embeddings: their inability to effectively represent non-transitive relationships. By splitting node representations into "attract" and "repel" components, the method improves link prediction performance, especially on heterophilic graphs.
The implementation would include:
The method has shown 10-20% AUC improvements on heterophilic networks while requiring minimal architectural changes. Result of a rudimentary implementation here: https://substack.com/home/post/p-157861370
Would the PyG team be interested in such a contribution? I'd appreciate any feedback or guidance before submitting a PR.
Thanks,
Tommy
Alternatives
No response
Additional context
No response
The text was updated successfully, but these errors were encountered: