DataTalks #18: The Power Couple: Deep Learning + Graphs
Details
Our 18th meetup is hosted by ๐ง๐ฎ๐ฏ๐ผ๐ผ๐น๐ฎ and it's going to be the deepest, graphiest, most awesome one yet!
Uriel Singer is going to give us a marvelous intro to learning on graphs.
Next, ๐ฌ๐ฎ๐บ ๐ฃ๐ฒ๐น๐ฒ๐ด, the one and only, will blow our mind by extending and developing the message passing network to a universal graph network model for accurate property prediction on nearly any graph dataset ๐คฏ
(mind=blown)
๐๐ด๐ฒ๐ป๐ฑ๐ฎ:
๐ 18:30 - 19:00 - Gathering, snacks & mingling
๐ 19:00 - 20:00 - First talk:
Learning on Graphs
by Uriel Singer
(Hebrew)
๐ช 20:10 - 21:10 - Second talk:
The unimaginable power of Graph Message Passing Neural Networks
by Yam Peleg
(Hebrew)
๐๐ฒ๐ฎ๐ฟ๐ป๐ถ๐ป๐ด ๐ผ๐ป ๐๐ฟ๐ฎ๐ฝ๐ต๐ - Uriel Singer (Hebrew)
Images, video, speech, audio, text, time-series, tableau โ tried all these domains? Have you tried the graph domain?
Graphs are a general language for describing complex systems. By looking around, you can realize that they are all around us: social networks, communication systems, internet, citations, economics, diseases, roads, and even neurons in our brains. In many systems, even if there is no formal graph, there is a network that defines the interactions between the components.
In this talk, weโll go through the basics of graphs, understand the tasks we can tackle and learn the methods that are used in order to answer these questions.
By the end of the talk, one should be able to understand when graphs are the right domain to use, be able to formulate his task and use the right techniques.
๐ง๐ต๐ฒ ๐๐ป๐ถ๐บ๐ฎ๐ด๐ถ๐ป๐ฎ๐ฏ๐น๐ฒ ๐ฝ๐ผ๐๐ฒ๐ฟ ๐ผ๐ณ ๐๐ฟ๐ฎ๐ฝ๐ต ๐ ๐ฒ๐๐๐ฎ๐ด๐ฒ ๐ฃ๐ฎ๐๐๐ถ๐ป๐ด ๐ก๐ฒ๐๐ฟ๐ฎ๐น ๐ก๐ฒ๐๐๐ผ๐ฟ๐ธ๐ - Yam Peleg (Hebrew)
Graph message passing neural networks (MPNN) are connectionist models that capture the dependence of graphs via message passing between the nodes of graphs. Unlike standard graph neural networks, MPNN retains a state that can represent information from its neighborhood with arbitrary depth.
In this talk, we extend and develop the message passing network to a universal graph network model for accurate property prediction on nearly any graph dataset.
We will demonstrate (Live Coding) that this method outperforms any prior DL models on nearly any task given (We will test on QM9).
We will also review state-of-the-art graph neural networks of four domains, recurrent graph neural networks, convolutional graph neural networks, graph autoencoders, and spatial-temporal graph neural networks.
๐ก๐ผ๐๐ฒ: This session will be practical, You are invited to bring your own laptop and join.
