EUVIMEDEUVIMED entdecken
Crossref

Khan-GCL: Kolmogorov–Arnold Network Based Graph Contrastive Learning with Hard Negatives

Zihu Wang, Boxun Xu, Hejia Geng, Peng Li

Proceedings of the AAAI Conference on Artificial Intelligence · 14.03.2026 · 40 (32) · 26797-26805

DOI: 10.1609/aaai.v40i32.39890 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the AAAI Conference on Artificial Intelligence, online erschienen am 14.03.2026. Verfasst von Zihu Wang und 3 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Graph contrastive learning (GCL) has demonstrated great promise for learning generalizable graph representations from unlabeled data. However, conventional GCL approaches face two critical limitations: (1) the restricted expressive capacity of multilayer perceptron (MLP) based encoders, and (2) suboptimal negative samples that either from random augmentations—failing to provide effective 'hard negatives'—or generated hard negatives without addressing the semantic distinctions crucial for discriminating graph data. To this end, we propose Khan-GCL, a novel framework that integrates the Kolmogorov–Arnold Network (KAN) into the GCL encoder architecture, substantially enhancing its representational capacity. Furthermore, we exploit the rich information embedded within KAN coefficient parameters to develop two novel critical feature identification techniques that enable the generation of semantically meaningful hard negative samples for each graph representation. These strategically constructed hard negatives guide the encoder to learn more discriminative features by emphasizing critical semantic differences between graphs. Extensive experiments demonstrate that our approach achieves state-of-the-art performance compared to existing GCL methods across a variety of datasets and tasks.

Zitieren

APA

Wang, Z., Xu, B., Geng, H., & Li, P. (2026). Khan-GCL: Kolmogorov–Arnold Network Based Graph Contrastive Learning with Hard Negatives. Proceedings of the AAAI Conference on Artificial Intelligence, 40(32), 26797-26805. https://doi.org/10.1609/aaai.v40i32.39890

Vancouver

Wang Z, Xu B, Geng H, Li P. Khan-GCL: Kolmogorov–Arnold Network Based Graph Contrastive Learning with Hard Negatives. Proceedings of the AAAI Conference on Artificial Intelligence. 2026;40(32):26797-26805. doi:10.1609/aaai.v40i32.39890

BibTeX
@article{Wang2026,
  author = {Wang, Zihu and Xu, Boxun and Geng, Hejia and Li, Peng},
  title = {Khan-GCL: Kolmogorov–Arnold Network Based Graph Contrastive Learning with Hard Negatives},
  journal = {Proceedings of the AAAI Conference on Artificial Intelligence},
  year = {2026},
  volume = {40},
  number = {32},
  pages = {26797--26805},
  doi = {10.1609/aaai.v40i32.39890}
}
Kostenlos starten →