← Search

Soo Yong Lee

7 accepted papers

2026

Feature-Centric Unsupervised Node Representation Learning Without Homophily Assumption

AAAI 2026technical

Unsupervised node representation learning aims to obtain meaningful node embeddings without relying on node labels. To achieve this, graph convolution, which aggregates information from neighboring nodes, is commonly employed to encode node features and graph topology. However, excessive reliance on

Cited by 0SourcePDFScholar
2024

Feature Distribution on Graph Topology Mediates the Effect of Graph Convolution: Homophily Perspective

ICML 2024poster

How would randomly shuffling feature vectors among nodes from the same class affect graph neural networks (GNNs)? The feature shuffle, intuitively, perturbs the dependence between graph topology and features (A-X dependence) for GNNs to learn from. Surprisingly, we observe a consistent and significa…

Cited by 9SourcePDFScholar
2024

HypeBoy: Generative Self-Supervised Representation Learning on Hypergraphs

ICLR 2024poster

Hypergraphs are marked by complex topology, expressing higher-order interactions among multiple nodes with hyperedges, and better capturing the topology is essential for effective representation learning. Recent advances in generative self-supervised learning (SSL) suggest that hypergraph neural net…

2024

Rethinking Reconstruction-based Graph-Level Anomaly Detection: Limitations and a Simple Remedy

NeurIPS 2024poster

Graph autoencoders (Graph-AEs) learn representations of given graphs by aiming to accurately reconstruct them. A notable application of Graph-AEs is graph-level anomaly detection (GLAD), whose objective is to identify graphs with anomalous topological structures and/or node features compared to the…

2024

Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More

ICML 2024poster

Combinatorial optimization (CO) is naturally discrete, making machine-learning techniques based on differentiable optimization inapplicable. Karalias & Loukas (2020) adapted the probabilistic method by Erdős & Spencer (1974), to incorporate CO into differentiable optimization. Their work ignited the…

Cited by 3SourcePDFScholar
2023

Towards Deep Attention in Graph Neural Networks: Problems and Remedies

ICML 2023poster

Graph neural networks (GNNs) learn the representation of graph-structured data, and their expressiveness can be further enhanced by inferring node relations for propagation. Attention-based GNNs infer neighbor importance to manipulate the weight of its propagation. Despite their popularity, the disc…