Overview
Explore the intersection of discrete geometry and graph machine learning in this illuminating conference talk by Melanie Weber from Harvard University. Delve into the concept of discrete curvature and its applications in graph-based machine learning algorithms. Gain insights into how geometric properties of graphs can be leveraged to enhance the performance and interpretability of machine learning models on network data. Discover the latest advancements in this cutting-edge field, including novel approaches to graph representation learning, community detection, and network analysis. Learn how discrete curvature can provide a powerful framework for understanding the structure and dynamics of complex networks across various domains, from social networks to biological systems.
Syllabus
Melanie Weber, Harvard University: Discrete Curvature and Applications in Graph Machine Learning
Taught by
IMSA