Metraipolis › archive › dc_418ad49e59df

$α$-Graph: Attention-Infused Normalizing Flow Approach to Tractable Graph Modeling — arXiv:2609.07961

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.07961
License (as archived)
CC0-1.0
Archived
2026-10-16T13:58:01.240Z
SHA-256 of the archived text
630a60fe90b9a69701b3d59a49fa20bc122121d40a9640fce148447d0c0f18b2
Stable URL of this page
https://metraipolis.com/documento/dc_418ad49e59df

How to cite

$α$-Graph: Attention-Infused Normalizing Flow Approach to Tractable Graph Modeling — arXiv:2609.07961 — arXiv (en), https://arxiv.org/abs/2609.07961 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_418ad49e59df (Metraipolis archive dc_418ad49e59df, sha256 630a60fe90b9a69701b3d59a49fa20bc122121d40a9640fce148447d0c0f18b2)
BibTeX
@misc{dc418ad49e59df,
  title = {$α$-Graph: Attention-Infused Normalizing Flow Approach to Tractable Graph Modeling — arXiv:2609.07961},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.07961},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_418ad49e59df; sha256 630a60fe90b9a69701b3d59a49fa20bc122121d40a9640fce148447d0c0f18b2},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.07961. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Graph modeling, a crucial task for representing complex relationships in graph-structured data, has achieved significant success in recent years. However, current graph modeling methods rely on traditional Graph Neural Networks and pre-training approaches to implicitly learn the underlying relational structure of graph data. Thus, these prior methods cannot capture the complex graph structure and correlations among inputs. In this paper, we introduce a novel Attention-based Normalizing Flow-based Approach\footnote{Our implementation and models will be released publicly for research reproducibility.} (ANFA or $\alpha$) that provides an explicit, interpretable, and tractable Graph Modeling ($\alpha$-Graph). In particular, we propose a new Unconditional Graph Normalizing Flow with an Invertible Attention Mechanism to capture the complex relational structure of graph data. To further enhance the expressiveness of the model, we introduce Conditional Graph Normalizing Flow with Learnable Queries that enables efficient modeling of correlations in graph-structured data. We show that our Conditional Graph Normalizing Flows behave similarly to Unconditional Graph Normalizing Flows, enhancing expressiveness while maintaining training stability and efficiency. Our experimental results on three benchmarks will illustrate the effectiveness and the state-of-the-art (SoTA) performance of the proposed $\alpha$-Graph method.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-09 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG) ; Computer Vision and Pattern Recognition (cs.CV).
Pagina del lavoro: https://arxiv.org/abs/2609.07961 — 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-16T13:39:43.004Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).