Signals 4 · free daily AI digest

G-NAC: Graph Neural Automata Clustering via Emergent Domain Formation

Paper recorded by Signals 4 on 2026-09-21 in cs.LG. Abstract reproduced from arXiv; link to the original below.

Published 2026-09-21 on arXiv · recorded by Signals 4 on 2026-09-22

Category: cs.LG · 机器学习 · first seen 2026-09-22

Abstract

We introduce Graph Neural Automata Clustering (G-NAC), an unsupervised clustering method in which observations interact as cells on a fixed neighborhood graph. A shared recurrent graph-neural cellular rule evolves latent domain states through local interactions, which are converted into a rank-based spectral affinity for partitioning. Across 73 clustering tasks from 57 benchmark datasets, G-NAC ac

Read on arXiv →

#9 most recent of 250 cs.LG papers we have recorded · ↑ newer: PredActor: Predictive Action Diffusion for Steerable Onboard Humanoid · ↓ older: Mobile Imaging Solutions for Medical Diagnosis: Trends and Application
Cite this page: G-NAC: Graph Neural Automata Clustering via Emergent Domain Formation: the #9 most recent of 250 cs.LG papers we have recorded (as of 2026-09-21). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/g-nac-graph-neural-automata-clustering-via-emergent-domain-formation.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable: papers.json
Related: More cs.LG papers · arXiv signals · All papers · Today in AI
Get 4 AI signals a day by email — free.
Subscribe free → See all plans →
Get 4 AI signals a day by email — free
All models · All repos · By company · Daily editions