Hugging Face Trending Papers

Node-level Graph Neural Architecture Search Framework

arXiv Machine Learning
Oct 8

Node-level Graph Neural Architecture Search Framework

The paper introduces N-GNAS, a Node-Level Graph Neural Architecture Search framework that selects distinct network architectures for different node subsets during feature updates. It incorporates a contrastive learning loss to better separate features across categories. Experiments on eight node and graph classification datasets show that N-GNAS outperforms existing GNAS methods and hand‑crafted GNNs, achieving 78.26% accuracy on CiteSeer.

By Lintao Yanga, Sirui Lia, Yaqing Wang, Pietro Li\`o, Xu Shen, Baisong Liu, Chengbin Peng
Hugging Face Trending Papers
Aug 3

CoRe-GNN: Multilevel Message passing on Coarsened graphs

Training Graph Neural Networks on large graphs is challenged by the memory cost of storing all node representations across layers. We show that several existing scalable approaches can be written as structured modifications of the GNN propagation matrix, providing a unified perspective that exposes their respective limitations.

arXiv Machine Learning
4d ago

DIFFNAS: Predictor-Free Neural Architecture Search via Diffusion Model and Zero-Cost Evaluation

DIFFNAS is a new neural architecture search framework that eliminates the need for performance predictors by using a discrete graph diffusion model conditioned on zero‑cost performance proxies such as MeCo and SWAP. The method achieves state‑of‑the‑art results on NAS‑Bench‑201 for CIFAR‑10 and CIFAR‑100, matching optimal architectures while cutting search cost by up to 17.5× compared to DiffusionNAG. Although its accuracy on the MobileNetV3 search space is lower than DiffusionNAG, the results demonstrate the potential of diffusion models combined with training‑free metrics for scalable architecture search.

By Yize Sun, Hanzhang Ma, Zixin Wu, Xuechun Li, Volker Tresp, Yunpu Ma
arXiv AI
Jun 26

Learning to Select Maximum Clique Algorithms: From Traditional Machine Learning to a Dual-Channel Hybrid Neural Architecture

arXiv:2508. 08005v4 Announce Type: replace-cross Abstract: The Maximum Clique Problem (MCP) is an NP-hard problem with wide-ranging applications in fields such as bioinformatics, network science, and social computing, yet no single algorithm consistently outperforms all others across diverse graph instances.

By Xiang Li, Shanshan Wang, Chenglong Xiao