Skip to content

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.

Related topics

You may also like