arXiv AI
Decoupled Structure-Feature Alignment via Alternating Optimization for Graph Learning
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv AI
Jul 14
Structure-Feature Aligned Graph Learning via Alternating Constrained Optimization
arXiv:2607. 11577v1 Announce Type: cross Abstract: We introduce a constrained two-view framework for node prediction that aligns structure-conditioned GNN embeddings with a structure-free feature prior learned by an anchor model.
arXiv Machine Learning
Jul 28
Unsupervised Graph Representation Learning with Complementary View Alignment
arXiv:2607. 24338v1 Announce Type: new Abstract: Unsupervised graph representation learning aims to derive meaningful node embeddings by capturing both structural and attribute information without relying on labeled data.
arXiv Machine Learning
Aug 20
Enhancing Distance-Based Graph Autoencoders with Structural Penalties for Dynamic Graph Embedding
The paper introduces three distance‑based graph autoencoder variants that add structural penalties to the reconstruction loss. All models use a two‑layer Graph Convolutional Network encoder and a Euclidean‑distance decoder, with two node‑level regularizers: a hub penalty based on degree centrality and a penalty based on Natural Community Local Intrinsic Dimensionality (NC‑LID). Experiments on multiple dynamic graph datasets show that incorporating NC‑LID regularization consistently improves reconstruction performance compared to baselines without structural regularization and to the hub‑aware variant.
arXiv AI
Jun 24
Graph Alignment for Benchmarking Graph Neural Networks and Learning Positional Encodings
arXiv:2505. 13087v2 Announce Type: replace-cross Abstract: We propose a novel benchmarking methodology for graph neural networks (GNNs) based on the graph alignment problem, a combinatorial optimization task that generalizes graph isomorphism by aligning two unlabeled graphs to maximize overlapping edges.
arXiv Machine Learning
Jul 7
Graph Classification via Network Usable Information: From Representation Evaluation to Structure Selection
arXiv:2607. 03587v1 Announce Type: new Abstract: We propose NetinfoGC, a framework for graph classification that extends the Network Usable Information (NUI) paradigm to graph-level learning.
arXiv AI
Jul 23
AdvSynGNN: Structure-Adaptive Graph Neural Nets via Adversarial Synthesis and Self-Corrective Propagation
arXiv:2602. 17071v3 Announce Type: replace-cross Abstract: Graph neural networks frequently encounter significant performance degradation when confronted with structural noise or non-homophilous topologies.