InData Science at MicrosoftbyJacob H. MarquezDecoding the customer journey with graph node embeddingsHow to use graph networks and algorithms to derive insights from the customer journeyJul 25, 20231Jul 25, 20231
InTDS ArchivebyMichael BronsteinDirection Improves Graph LearningHow a wise use of direction when doing message passing on heterophilic graphs can result in very significant gains.Jun 8, 20234Jun 8, 20234
InLyft EngineeringbyJaven Xulyft2vec — Embeddings at LyftCo-authors: Hakan Baba, Adriana Deneault.Mar 22, 20232Mar 22, 20232
Shaw99GraphMAE: Generative can be better than Contrastive in Graph Self-supervised LearningA new paradigm for self-supervised learning on graphsJul 16, 2022Jul 16, 2022
InTDS ArchivebyMichael BronsteinDeep learning on graphs: successes, challenges, and next stepsWhat would it take for graph neural networks to become a game changer? Evolution and future trends in the field of deep learning on graphs.Jun 15, 20206Jun 15, 20206
InStanford CS224W: Machine Learning with GraphsbyAnya FriesDeep Learning on 3D MeshesA learned solution to node-level classification on irregular graphs via graph neural networks.Jan 26, 20221Jan 26, 20221
InTDS ArchivebyMichael BronsteinNeural Sheaf Diffusion for deep learning on graphsCellular sheaf theory, a branch of algebraic topology, provides new insights into how Graph Neural Networks work and how to design new…May 16, 2022May 16, 2022
InTDS ArchivebyMichael BronsteinLearning on graphs with missing featuresFeature Propagation is a simple and surprisingly efficient solution for learning on graphs with missing node featuresFeb 3, 20223Feb 3, 20223
InTDS ArchivebyMichael BronsteinLearning on graphs with missing featuresFeature Propagation is a simple and surprisingly efficient solution for learning on graphs with missing node featuresFeb 3, 20223Feb 3, 20223
InTDS ArchivebyMichael BronsteinLearning on graphs with missing featuresFeature Propagation is a simple and surprisingly efficient solution for learning on graphs with missing node featuresFeb 3, 20223Feb 3, 20223
InTDS ArchivebyMichael BronsteinLearning on graphs with missing featuresFeature Propagation is a simple and surprisingly efficient solution for learning on graphs with missing node featuresFeb 3, 20223Feb 3, 20223
InTDS ArchivebyMichael BronsteinLearning on graphs with missing featuresFeature Propagation is a simple and surprisingly efficient solution for learning on graphs with missing node featuresFeb 3, 20223Feb 3, 20223
InTDS ArchivebyMichael BronsteinUsing subgraphs for more expressive GNNsGNNs have limited expressive power due to their equivalence to WL test. Recent works show how to improve expressivity by using subgraphs.Dec 20, 20211Dec 20, 20211
InTDS ArchivebyMichael BronsteinLearning on graphs with missing featuresFeature Propagation is a simple and surprisingly efficient solution for learning on graphs with missing node featuresFeb 3, 20223Feb 3, 20223
InTDS ArchivebyMichael BronsteinPredictions and hopes for Graph ML in 2021Leading researchers in Graph ML summarise the progress in 2020 and make predictions for 2021Jan 5, 20212Jan 5, 20212
InTDS ArchivebyMichael BronsteinPredictions and hopes for Geometric & Graph ML in 2022Leading researchers in Geometric & Graph ML summarise the progress in 2021 and make predictions for 2022Jan 24, 20225Jan 24, 20225
InTDS ArchivebyMichael BronsteinSimple scalable graph neural networksOne of the practical challenges of graph neural networks is scalability to large graphs. We present a simple solution for scalable GNNs.Aug 8, 20202Aug 8, 20202
InTDS ArchivebyMichael BronsteinGraph Neural Networks through the lens of Differential Geometry and Algebraic TopologyNew perspectives on old problems in Graph MLNov 18, 2021Nov 18, 2021
InTDS ArchivebyMichael BronsteinExpressive power of graph neural networks and the Weisfeiler-Lehman testThe expressive power of graph neural networks has deep relations to classical results in graph theory, described in this post.Jun 26, 20204Jun 26, 20204
Michael GalkinKnowledge Graphs @ ICLR 2021Your guide to the KG-related research in ML, May editionMay 6, 2021May 6, 2021