Graph Autoencoder Uncovering Descriptive Information (GAUDI), an unsupervised graph deep learning framework designed to capture both local details and global structure, is introduced, providing new insights into emergent phenomena across diverse scientific domains.
Abstract
Graphs provide a powerful framework for modeling complex systems, but their structural variability poses significant challenges for analysis and classification. To address these challenges, we introduce Graph Autoencoder Uncovering Descriptive Information (GAUDI), an unsupervised graph deep learning framework designed to capture both local details and global structure. GAUDI employs an hourglass architecture with hierarchical pooling and upsampling layers linked through skip connections, which preserve essential connectivity information throughout the encoding–decoding process. Even though identical or highly similar underlying parameters describing a system’s state can lead to significant variability in graph realizations, GAUDI consistently maps them into nearby regions of a structured and continuous latent space, effectively disentangling invariant process-level features from stochastic noise. We demonstrate GAUDI’s versatility across multiple applications, including small-world networks modeling, characterization of protein assemblies from super-resolution microscopy, analysis of collective motion in the Vicsek model, and identification of age-related changes in brain connectivity. Comparison with related approaches highlights GAUDI’s superior performance in analyzing complex graphs, providing new insights into emergent phenomena across diverse scientific domains.
This work develops a framework for learning over Mapper induced structured representations, and studies mathematical properties of these representations, including invariance under relabeling, a distance functional on the space of Mapper representations, structural complexity of multiscale decompositions, and learning...
This work introduces Topoformer, a lightweight and scalable framework for graph representation learning that encodes topological structure into attention-friendly sequences by decomposing a graph into a short, ordered sequence of topological tokens by slicing over node or edge filtrations.
Md Joshem Uddin, Astrit Tola, C. Akcora et al.· arXiv.org· 1 citation
This work presents a constrained two-view learning framework for robust graph learning, which aligns structure-aware GNN embeddings with a structure-free feature prior and designs a channel-split adaptive gated layer within DSAL to effectively integrate this prior.
This work introduces a parameter-efficient Tri-Branch Modular Fusion Neural Network that synthesizes three orthogonal modalities: 3D spatial geometry, discrete topological grammar, and explicit macroscopic physicochemical descriptors that offers a highly efficient alternative to brute-force parameter scaling.
Qiwei Han, Chi Zhou, Ruo-Yuan Wang et al.· 0 citations
Across five graph benchmarks, the performance of SDRs is competitive with that of real-valued dense embeddings on node classification and link prediction, while the architecture exhibits portability, resilience to noise, and robustness to data corruption.
A novel broad graph convolutional network (BGCN) paradigm is proposed, which completely eliminates hidden layers and instead expands the receptive field through network width, effectively circumventing the inherent limitations of over-smoothing and overfitting in existing deep and high-order GCN models.
Alex Hay-Man Ng, Xun Liu, Fang-Yuan Lei et al.· Complex & Intelligent Sy...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.