Metraipolis › archive › dc_4563e736337d
Towards One-for-All Foundation Model for Attributed Graph Clustering — arXiv:2610.07778
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.07778
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T11:21:11.642Z
- SHA-256 of the archived text
71249b2ddd717b774e2ec96c019e32dcf6d1b47891d4e1526651fb0071ec6d20- Stable URL of this page
https://metraipolis.com/documento/dc_4563e736337d
How to cite
Towards One-for-All Foundation Model for Attributed Graph Clustering — arXiv:2610.07778 — arXiv (en), https://arxiv.org/abs/2610.07778 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4563e736337d (Metraipolis archive dc_4563e736337d, sha256 71249b2ddd717b774e2ec96c019e32dcf6d1b47891d4e1526651fb0071ec6d20)
BibTeX
@misc{dc4563e736337d,
title = {Towards One-for-All Foundation Model for Attributed Graph Clustering — arXiv:2610.07778},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.07778},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4563e736337d; sha256 71249b2ddd717b774e2ec96c019e32dcf6d1b47891d4e1526651fb0071ec6d20},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.07778. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Attributed graph clustering aims to discover node groups by jointly exploiting node attributes and graph topology, yet its unsupervised nature makes model selection and adaptation inherently difficult. Existing methods typically train and tune a separate model for each input graph, leading to costly and fragile pipelines that often fail to transfer across graphs with different feature spaces, structural patterns, and attribute-structure correlations. In this paper, we study a one-for-all alternative: can a single model be trained once and directly applied to diverse attributed graphs without graph-specific training, fine-tuning, or hyperparameter search? We propose OFAG, a foundation model for attributed graph clustering. Building upon Prior-data Fitted Networks, OFAG learns a reusable clustering inference strategy from synthetic attributed graphs generated under broad priors over latent clusters, node attributes, and graph structures. To handle incompatible feature spaces across graphs, OFAG adopts a dimension-agnostic signal-wise graph encoder that treats each feature channel as a graph signal and models its response to shared graph filters. The model is trained with a hyperspherical clustering objective, producing clustering-friendly node representations in a single forward pass at inference time. On ten datasets, one frozen OFAG model achieves the best mean performance and average rank across NMI, ACC, ARI, and F1, while completing all ten datasets in 12.43 minutes total---over 6* faster than the second-fastest baseline and nearly 28* faster than the second-best on clustering quality. Our code and pretrained checkpoint are available at this https URL , allowing practitioners to directly apply OFAG to their own attributed graph datasets without additional training or tuning. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno). Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI). Pagina del lavoro: https://arxiv.org/abs/2610.07778 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T11:15:24.766Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).