Тёмный

Graph Neural Networks for Link Prediction with Subgraph Sketching 

Valence Labs
Подписаться 8 тыс.
Просмотров 2,6 тыс.
50% 1

Try datamol.io - the open source toolkit that simplifies molecular processing and featurization workflows for machine learning scientists working in drug discovery: datamol.io/
Never miss another LoGG Talk, add the schedule to your calendar: m2d2.io/talks/m2d2/about/
Join the Learning on Graphs and Geometry Reading Group on Slack: join.slack.com/t/logag/shared...
Abstract: Many Graph Neural Networks (GNNs) perform poorly compared to simple heuristics on Link Prediction (LP) tasks. This is due to limitations in expressive power such as the inability to count triangles (the backbone of most LP heuristics) and because they can not distinguish automorphic nodes (those having identical structural roles). Both expressiveness issues can be alleviated by learning link (rather than node) representations and incorporating structural features such as triangle counts. Since explicit link representations are often prohibitively expensive, recent works resorted to subgraph-based methods, which have achieved state-of-the-art performance for LP, but suffer from poor efficiency due to high levels of redundancy between subgraphs. We analyze the components of subgraph GNN (SGNN) methods for link prediction. Based on our analysis, we propose a novel full-graph GNN called ELPH (Efficient Link Prediction with Hashing) that passes subgraph sketches as messages to approximate the key components of SGNNs without explicit subgraph construction. ELPH is provably more expressive than Message Passing GNNs (MPNNs). It outperforms existing SGNN models on many standard LP benchmarks while being orders of magnitude faster. However, it shares the common GNN limitation that it is only efficient when the dataset fits in GPU memory. Accordingly, we develop a highly scalable model, called BUDDY, which uses feature precomputation to circumvent this limitation without sacrificing predictive performance. Our experiments show that BUDDY also outperforms SGNNs on standard LP benchmarks while being highly scalable and faster than ELPH.
Speakers:
Ben Chamberlain - / benjaminchamberlain
Sergey Shirobokov - / sergey-shirobokov
Twitter Hannes: / hannesstaerk
Twitter Dominique: / dom_beaini
Twitter datamol.io: / datamol_io
~
Chapters
00:00 - Intro
04:03 - Production Model at Twitter
07:32 - First Attempt with GNNs for Recommendations
10:59 - Automorphic Nodes
15:08 - Subgraph GNNs
18:22 - Analyzing Subgraph GNNs: Model Components
22:18 - Subgraph Sketching: Minhash
26:51 - GNNs with Subgraph Sketching
34:10 - BUDDY: Scaling ELPH
37:42 - Results
39:09 - Q+A

Наука

Опубликовано:

 

15 июл 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии    
Далее
Gradient Boost Part 2 (of 4): Regression Details
26:46
Просмотров 284 тыс.
Graph Neural Networks for Binding Affinity Prediction
18:53
iPhone 15 Pro в реальной жизни
24:07
Просмотров 326 тыс.
😮Новый ДИРЕКТОР Apple🍏
0:29
Просмотров 36 тыс.