11 citations · 25 across the 18 of their papers we have counts for
11 papers · 1 filter
TAROT: Task-Adaptive Refinement of LLM-prior Graphs for Few-shot Tabular Learning
Ruxue Shi, Yili Wang, Mengnan Du +3
Few-shot tabular learning provides a cost-effective approach for real-world applications where annotation is costly and collecting sufficient samples for new tasks is difficult. Ex…
Dual Mamba for Node-Specific Representation Learning: Tackling Over-Smoothing with Selective State Space Modeling
Xin He, Yili Wang, Yiwei Dai +1
Over-smoothing remains a fundamental challenge in deep Graph Neural Networks (GNNs), where repeated message passing causes node representations to become indistinguishable. While e…
CrystalICL: Enabling In-Context Learning for Crystal Generation
Ruobing Wang, Qiaoyu Tan, Yili Wang +2
Designing crystal materials with desired physicochemical properties remains a fundamental challenge in materials science. While large language models (LLMs) have demonstrated stron…
A Comprehensive Survey of Synthetic Tabular Data Generation
Ruxue Shi, Yili Wang, Mengnan Du +3
Tabular data is one of the most prevalent and important data formats in real-world applications such as healthcare, finance, and education. However, its effective use in machine le…
Raising the Bar in Graph OOD Generalization: Invariant Learning Beyond Explicit Environment Modeling
Xu Shen, Yixin Liu, Yili Wang +5
Out-of-distribution (OOD) generalization has emerged as a critical challenge in graph learning, as real-world graph data often exhibit diverse and shifting environments that tradit…
Mamba-Based Graph Convolutional Networks: Tackling Over-smoothing with Selective State Space
Xin He, Yili Wang, Wenqi Fan +4
Graph Neural Networks (GNNs) have shown great success in various graph-based learning tasks. However, it often faces the issue of over-smoothing as the model depth increases, which…
Graph Defense Diffusion Model
Xin He, Wenqi Fan, Yili Wang +4
Graph Neural Networks (GNNs) are highly vulnerable to adversarial attacks, which can greatly degrade their performance. Existing graph purification methods attempt to address this…
Efficient Sharpness-Aware Minimization for Molecular Graph Transformer Models
Yili Wang, Kaixiong Zhou, Ninghao Liu +2
Sharpness-aware minimization (SAM) has received increasing attention in computer vision since it can effectively eliminate the sharp local minima from the training trajectory and m…
Unifying Unsupervised Graph-Level Anomaly Detection and Out-of-Distribution Detection: A Benchmark
Yili Wang, Yixin Liu, Xu Shen +6
To build safe and reliable graph machine learning systems, unsupervised graph-level anomaly detection (GLAD) and unsupervised graph-level out-of-distribution (OOD) detection (GLOD)…
Rethinking Independent Cross-Entropy Loss For Graph-Structured Data
Rui Miao, Kaixiong Zhou, Yili Wang +3
Graph neural networks (GNNs) have exhibited prominent performance in learning graph-structured data. Considering node classification task, based on the i.i.d assumption among node…
Optimizing OOD Detection in Molecular Graphs: A Novel Approach with Diffusion Models
Xu Shen, Yili Wang, Kaixiong Zhou +2
The open-world test dataset is often mixed with out-of-distribution (OOD) samples, where the deployed models will struggle to make accurate predictions. Traditional detection metho…