CS224W: Machine Learning with Graphs | 2021 | Lecture 15.3 - Scaling Up & Evaluating Graph Gen
For more information about Stanford’s Artificial Intelligence professional and graduate programs, visit: https://stanford.io/3Eu3ZMV
Lecture 15.3: Scaling Up and Evaluating Graph Generation
Jure Leskovec
Computer Science, PhD
A key question when designing deep generative models for graphs is algorithm scalability. In principle, a newly added node could potentially connect with any prior node. GraphRNN solves this issue via enforcing a Bread-first-search (BFS) node ordering for any given graph. Through the BFS ordering, we can reduce the possible node orderings from O(n!) to the number of distinct BFS orderings; additionally, a BFS ordering greatly reduces the steps for edge generation, since it limits the number of considered previous nodes to the nodes in the BFS frontier.
Another core topic is how to properly evaluate a generative model for graphs. As an intuitive metric, one can visually examine the similarity of graphs. GraphRNN proposes a more rigorous approach, where we wish to compare the set of graph statistics between the synthetic graphs and the ground-truth graphs. Here, we will first use Earth Mover Distance (EMD) to compute similarity between 2 graph statistic distributions; then, we will use Maximum Mean Discrepancy (MMD) to compute the similarity between 2 sets of graph statistics. More information can be found in the paper: “GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models” https://arxiv.org/abs/1802.08773
To follow along with the course schedule and syllabus, visit:
http://web.stanford.edu/class/cs224w/
Видео CS224W: Machine Learning with Graphs | 2021 | Lecture 15.3 - Scaling Up & Evaluating Graph Gen канала Stanford Online
Lecture 15.3: Scaling Up and Evaluating Graph Generation
Jure Leskovec
Computer Science, PhD
A key question when designing deep generative models for graphs is algorithm scalability. In principle, a newly added node could potentially connect with any prior node. GraphRNN solves this issue via enforcing a Bread-first-search (BFS) node ordering for any given graph. Through the BFS ordering, we can reduce the possible node orderings from O(n!) to the number of distinct BFS orderings; additionally, a BFS ordering greatly reduces the steps for edge generation, since it limits the number of considered previous nodes to the nodes in the BFS frontier.
Another core topic is how to properly evaluate a generative model for graphs. As an intuitive metric, one can visually examine the similarity of graphs. GraphRNN proposes a more rigorous approach, where we wish to compare the set of graph statistics between the synthetic graphs and the ground-truth graphs. Here, we will first use Earth Mover Distance (EMD) to compute similarity between 2 graph statistic distributions; then, we will use Maximum Mean Discrepancy (MMD) to compute the similarity between 2 sets of graph statistics. More information can be found in the paper: “GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models” https://arxiv.org/abs/1802.08773
To follow along with the course schedule and syllabus, visit:
http://web.stanford.edu/class/cs224w/
Видео CS224W: Machine Learning with Graphs | 2021 | Lecture 15.3 - Scaling Up & Evaluating Graph Gen канала Stanford Online
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
![CS224W: Machine Learning with Graphs | 2021 | Lecture 15.4 - Applications of Deep Graph Generation](https://i.ytimg.com/vi/SdBk8fMmwUU/default.jpg)
![](https://i.ytimg.com/vi/KQkfNwDA_qo/default.jpg)
![CS224W: Machine Learning with Graphs | 2021 | Lecture 17.2 - GraphSAGE Neighbor Sampling](https://i.ytimg.com/vi/LLUxwHc7O4A/default.jpg)
![CS224W: Machine Learning with Graphs | 2021 | Lecture 16.2 - Position-Aware Graph Neural Networks](https://i.ytimg.com/vi/6ZFvToZUjGA/default.jpg)
![Step By Step Process To Learn Machine Learning Algorithm Efficiently](https://i.ytimg.com/vi/qPIaYD96sXU/default.jpg)
![CS224W: Machine Learning with Graphs | 2021 | Lecture 14.4 - Kronecker Graph Model](https://i.ytimg.com/vi/Xnpt8US31cQ/default.jpg)
![CS224W: Machine Learning with Graphs | 2021 | Lecture 15.1 - Deep Generative Models for Graphs](https://i.ytimg.com/vi/IMpkHvQ0LA4/default.jpg)
![CS224W: Machine Learning with Graphs | 2021 | Lecture 16.1 - Limitations of Graph Neural Networks](https://i.ytimg.com/vi/yT5PziOXxQg/default.jpg)
![Lecture 1: Algorithmic Thinking, Peak Finding](https://i.ytimg.com/vi/HtSuA80QTyo/default.jpg)
![Life Lessons From 100-Year-Olds](https://i.ytimg.com/vi/9AThycGCakk/default.jpg)
![CS224W: Machine Learning with Graphs | 2021 | Lecture 14.3 - The Small World Model](https://i.ytimg.com/vi/ZrDpzzVWwFs/default.jpg)
![CS224W: Machine Learning with Graphs | 2021 | Lecture 2.3 - Traditional Feature-based Methods: Graph](https://i.ytimg.com/vi/buzsHTa4Hgs/default.jpg)
![CS224W: Machine Learning with Graphs | 2021 | Lecture 17.1 - Scaling up Graph Neural Networks](https://i.ytimg.com/vi/2nPCw3yHlnI/default.jpg)
![CS224W: Machine Learning with Graphs | 2021 | Lecture 3.2-Random Walk Approaches for Node Embeddings](https://i.ytimg.com/vi/Xv0wRy66Big/default.jpg)
![Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 1.2 - Applications of Graph ML](https://i.ytimg.com/vi/aBHC6xzx9YI/default.jpg)
![CS224W: Machine Learning with Graphs | 2021 | Lecture 16.4 - Robustness of Graph Neural Networks](https://i.ytimg.com/vi/uBmtTL3EitI/default.jpg)
![Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths](https://i.ytimg.com/vi/OQ5jsbhAv_M/default.jpg)
![CS224W: Machine Learning with Graphs | 2021 | Lecture 19.1 - Pre-Training Graph Neural Networks](https://i.ytimg.com/vi/JDW82csukhE/default.jpg)
![CS224W: Machine Learning with Graphs | 2021 | Lecture 16.3 - Identity-Aware Graph Neural Networks](https://i.ytimg.com/vi/SJqWQGh__N8/default.jpg)
![CS224W: Machine Learning with Graphs | 2021 | Lecture 19.3 - Design Space of Graph Neural Networks](https://i.ytimg.com/vi/8OhnwzT9ypg/default.jpg)