Graph Representation Learning (GRL) has experienced significant progress as a means to extract structural information in a meaningful way for subsequent learning tasks. Current approaches including shallow embeddings and Graph Neural Networks have mostly been tested with node classification and link prediction tasks. In this work, we provide an application oriented perspective to a set of popular embedding approaches and evaluate their representational power with respect to real-world graph properties. We implement an extensive empirical data-driven framework to challenge existing norms regarding the expressive power of embedding approaches in graphs with varying patterns along with a theoretical analysis of the limitations we discovered in this process. Our results suggest that "one-to-fit-all" GRL approaches are hard to define in real-world scenarios and as new methods are being introduced they should be explicit about their ability to capture graph properties and their applicability in datasets with non-trivial structural differences.
When GNNs Fail: Quantifying and Overcoming Temporal Correlation Volatility in Time Series
Karlsruhe Institute of Technology(卡尔斯鲁厄理工学院);The Hong Kong University of Science and Technology(香港科技大学);East China Normal University(华东师范大学);University of Michigan(密歇根大学)
From Heuristics to Data: Quantifying Site Planning Layout Indicators with Deep Learning and Multi-Modal Data
National University of Singapore (NUS)(新加坡国立大学);The Cambridge Centre for Advanced Research and Education in Singapore (CARES)(新加坡剑桥高级研究与教育中心);China Southwest Architectural Design and Research Institute Co., Ltd. (CSWADI)(中国西南建筑规划设计研究院有限公司)
Quantifying the Optimization and Generalization Advantages of Graph Neural Networks Over Multilayer Perceptrons
RIKEN AIP(日本学术振兴会先进研究所);The University of Hong Kong(香港大学);National University of Singapore(新加坡国立大学);The University of New South Wales(新南威尔士大学);University of Tokyo(东京大学)
Quantifying the Noise of Structural Perturbations on Graph Adversarial Attacks
Department of Electrical Engineering, City University of Hong Kong(香港城市大学电气工程系);School of Computer Science and Engineering, Sun Yat-sen University(中山大学计算机科学与工程学院);School of Software Engineering, Sun Yat-sen University(中山大学软件工程学院)
Quantifying the Limits of Segmentation Foundation Models: Modeling Challenges in Segmenting Tree-Like and Low-Contrast Objects
Department of Electrical and Computer Engineering(电气与计算机工程系);Department of Computer Science(计算机科学系);Department of Radiology(放射学系);Department of Biostatistics & Bioinformatics(生物统计学与生物信息学系);Minnesota Health Solutions(明尼苏达健康解决方案)
Quantifying Local Specialization in Deep Neural Networks
University of California Berkeley(加州大学伯克利分校);Boston University(波士顿大学);Center for Human-Compatible AI (CHAI)(人类兼容人工智能中心);MIT Computer Science and Artificial Intelligence Laboratory (CSAIL)(麻省理工学院计算机科学与人工智能实验室)