← Search

Weilin Cong

7 accepted papers

2026

RODIS: Robust Diffusion Solver to Dataset Quality in Combinatorial Optimization

IJCAI 2026

Combinatorial optimization (CO) problems have widespread applications in science and engineering, but they present significant computational challenges. Recent advancements in generative models, particularly diffusion models, have shown promise in bypassing traditional optimization solvers by direct

Cited by 0Scholar
2025

Learning Graph Quantized Tokenizers

ICLR 2025poster

Transformers serve as the backbone architectures of Foundational Models, where domain-specific tokenizers allow them to adapt to various domains. Graph Transformers (GTs) have recently emerged as leading models in geometric deep learning, outperforming Graph Neural Networks (GNNs) in various graph l…

2023

Do We Really Need Complicated Model Architectures For Temporal Networks?

ICLR 2023top-5%

Recurrent neural network (RNN) and self-attention mechanism (SAM) are the de facto methods to extract spatial-temporal information for temporal graph learning. Interestingly, we found that although both RNN and SAM could lead to a good performance, in practice neither of them is always necessary. In…

Cited by 156SourcePDFScholar
2023

Efficiently Forgetting What You Have Learned in Graph Representation Learning via Projection

AISTATS 2023poster

As privacy protection receives much attention, unlearning the effect of a specific node from a pre-trained graph learning model has become equally important. However, due to the node dependency in the graph-structured data, representation unlearning in Graph Neural Networks (GNNs) is challenging and…

2022

Learn Locally, Correct Globally: A Distributed Algorithm for Training Graph Neural Networks

ICLR 2022poster

Despite the recent success of Graph Neural Networks (GNNs), training GNNs on large graphs remains challenging. The limited resource capacities of the existing servers, the dependency between nodes in a graph, and the privacy concern due to the centralized storage and model learning have spurred the…

Cited by 44SourcePDFScholar
2021

On Provable Benefits of Depth in Training Graph Convolutional Networks

NeurIPS 2021poster

Graph Convolutional Networks (GCNs) are known to suffer from performance degradation as the number of layers increases, which is usually attributed to over-smoothing. Despite the apparent consensus, we observe that there exists a discrepancy between the theoretical understanding of over-smoothing an…

2020

GCN meets GPU: Decoupling “When to Sample” from “How to Sample”

NeurIPS 2020poster

Sampling-based methods promise scalability improvements when paired with stochastic gradient descent in training Graph Convolutional Networks (GCNs). While effective in alleviating the neighborhood explosion, due to bandwidth and memory bottlenecks, these methods lead to computational overheads in p…

Cited by 41SourcePDFScholar