- This event has passed.
On Size Generalization in Graph Neural Networks and Lottery Tickets – Learning Club talk by Gilad Yehudai
January 10 @ 12:00 pm - 1:00 pm IST
Gilad Yehudai from Weizmann Institute of Science
Time: Sunday Jan 10th, 2021 12:00 PM — 13:00 PM.
Title: On Size Generalization in Graph Neural Networks and Lottery Tickets
Abstract: In this talk, I will survey two recent works, both have results related to the expressivity of neural networks, but in different architectures: On size generalization in graph neural networks: Graph neural networks can process graphs of any size, a natural question that arises is whether they are able to generalize across sizes, i.e. is it possible to learn on small graphs and successfully predict on larger graphs. We will show that the answer might be related to the local structure of the graph, rather than its global structure, prove an expressivity result on how GNNs learn local structures, and try to improve size generalization using these insights. Proving the lottery ticket hypothesis: The recent prominent lottery ticket hypothesis (Frankle and Carbin, 2018) states that a randomly-initia
Based on joint work with: Ohad Shamir, Haggai Maron, Eran Malach, Gal Chechik, Shai Shalev-Shwartz, Eli Meirom and Ethan Fetaya.
Bio: Gilad is a Ph.D. student at Weizmann institute of science, under the supervision of Professor Ohad Shamir. Recently Gilad interned at Nvidia Research Israel, working with Haggai Maron and Gal Chechik.