Reconciling competing sampling strategies of network embedding

Y Yan, B Jing, L Liu, R Wang, J Li… - Advances in …, 2024 - proceedings.neurips.cc
Network embedding plays a significant role in a variety of applications. To capture the
topology of the network, most of the existing network embedding algorithms follow a …

Contrastive learning for signed bipartite graphs

Z Zhang, J Liu, K Zhao, S Yang, X Zheng… - Proceedings of the 46th …, 2023 - dl.acm.org
This paper is the first to use contrastive learning to improve the robustness of graph
representation learning for signed bipartite graphs, which are commonly found in social …

From trainable negative depth to edge heterophily in graphs

Y Yan, Y Chen, H Chen, M Xu, M Das… - Advances in …, 2024 - proceedings.neurips.cc
Finding the proper depth $ d $ of a graph convolutional network (GCN) that provides strong
representation ability has drawn significant attention, yet nonetheless largely remains an …

Hierarchical multi-marginal optimal transport for network alignment

Z Zeng, B Du, S Zhang, Y Xia, Z Liu… - Proceedings of the AAAI …, 2024 - ojs.aaai.org
Finding node correspondence across networks, namely multi-network alignment, is an
essential prerequisite for joint learning on multiple networks. Despite great success in …

Pacer: Network embedding from positional to structural

Y Yan, Y Hu, Q Zhou, L Liu, Z Zeng, Y Chen… - Proceedings of the …, 2024 - dl.acm.org
Network embedding plays an important role in a variety of social network applications.
Existing network embedding methods, explicitly or implicitly, can be categorized into …

ArieL: Adversarial Graph Contrastive Learning

S Feng, B Jing, Y Zhu, H Tong - ACM Transactions on Knowledge …, 2024 - dl.acm.org
Contrastive learning is an effective unsupervised method in graph representation learning.
The key component of contrastive learning lies in the construction of positive and negative …

FairGen: Towards Fair Graph Generation

L Zheng, D Zhou, H Tong, J Xu, Y Zhu, J He - arXiv preprint arXiv …, 2023 - arxiv.org
There have been tremendous efforts over the past decades dedicated to the generation of
realistic graphs in a variety of domains, ranging from social networks to computer networks …

Heterogeneous Contrastive Learning for Foundation Models and Beyond

L Zheng, B Jing, Z Li, H Tong, J He - arXiv preprint arXiv:2404.00225, 2024 - arxiv.org
In the era of big data and Artificial Intelligence, an emerging paradigm is to utilize contrastive
self-supervised learning to model large-scale heterogeneous data. Many existing foundation …

SLOG: An Inductive Spectral Graph Neural Network Beyond Polynomial Filter

H Xu, Y Yan, D Wang, Z Xu, Z Zeng… - Forty-first International … - openreview.net
Graph neural networks (GNNs) have exhibited superb power in many graph related tasks.
Existing GNNs can be categorized into spatial GNNs and spectral GNNs. The spatial GNNs …

Graph Mixup on Approximate Gromov–Wasserstein Geodesics

Z Zeng, R Qiu, Z Xu, Z Liu, Y Yan, T Wei, L Ying… - Forty-first International … - openreview.net
Mixup, which generates synthetic training samples on the data manifold, has been shown to
be highly effective in augmenting Euclidean data. However, finding a proper data manifold …