← Search

Yi-Ge Zhang

4 accepted papers

2026

Difficult Examples Hurt Unsupervised Contrastive Learning: A Theoretical Perspective

ICLR 2026oral

Unsupervised contrastive learning has shown significant performance improvements in recent years, often approaching or even rivaling supervised learning in various tasks. However, its learning mechanism is fundamentally different from supervised learning. Previous works have shown that difficult exa…

Cited by 0SourceScholar
2024

HONGAT: Graph Attention Networks in the Presence of High-Order Neighbors

AAAI 2024technical

Graph Attention Networks (GATs) that compute node representation by its lower-order neighbors, are state-of-the-art architecture for representation learning with graphs. In practice, however, the high-order neighbors that turn out to be useful, remain largely unemployed in GATs. Efforts on this issu…

Cited by 5SourcePDFScholar
2024

LSPAN: Spectrally Localized Augmentation for Graph Consistency Learning

IJCAI 2024poster

Graph-based consistency principle has been successfully applied to many semi-supervised problems in machine learning. Its performance largely depends on the quality of augmented graphs, which has been recently proven that revealing graph properties and maintaining the invariance of graphs are crucia…

Cited by 0SourcePDFScholar
2022

Robust Semi-Supervised Learning when Not All Classes have Labels

NeurIPS 2022accept

Semi-supervised learning (SSL) provides a powerful framework for leveraging unlabeled data. Existing SSL typically requires all classes have labels. However, in many real-world applications, there may exist some classes that are difficult to label or newly occurred classes that cannot be labeled in…

Cited by 47SourcePDFScholar