Metraipolis › archive › dc_4525e2defd26
Generalized Graph Variational Autoencoders: Bounded Divergences Control Posterior Collapse — arXiv:2609.29546
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.29546
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T04:27:35.601Z
- SHA-256 of the archived text
039c535a35265801edb9e873d107b0aa78902f8ecd40764e089d76e049f48ca6- Stable URL of this page
https://metraipolis.com/documento/dc_4525e2defd26
How to cite
Generalized Graph Variational Autoencoders: Bounded Divergences Control Posterior Collapse — arXiv:2609.29546 — arXiv (en), https://arxiv.org/abs/2609.29546 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4525e2defd26 (Metraipolis archive dc_4525e2defd26, sha256 039c535a35265801edb9e873d107b0aa78902f8ecd40764e089d76e049f48ca6)
BibTeX
@misc{dc4525e2defd26,
title = {Generalized Graph Variational Autoencoders: Bounded Divergences Control Posterior Collapse — arXiv:2609.29546},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.29546},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4525e2defd26; sha256 039c535a35265801edb9e873d107b0aa78902f8ecd40764e089d76e049f48ca6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.29546. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The variational graph autoencoder (VGAE) regularizes its posterior toward the prior with the Kullback-Leibler divergence, a choice inherited from the variational autoencoder rather than argued for. We introduce the generalized graph variational autoencoder (GGVA), which replaces that term with any member of the Rényi-Tsallis family of order $q$ while leaving every other part of the model untouched. Both members admit closed forms for diagonal Gaussians and both recover the KL exactly as $q \to 1$, so the VGAE is the $q=1$ arm of our own model rather than a separate baseline, and any measured difference is attributable to a single scalar. Our analysis identifies boundedness, not the order, as the operative property: for $q<1$ the Tsallis divergence is bounded above by $1/(1-q)$, independently of the latent width, whereas the KL and the Rényi divergence of the same order are unbounded. On ten graphs spanning three synthetic families, a social network, three citation networks, a connectome, a power grid and a road network, $q$ moves the retained posterior information by up to $49\times$ relative to the VGAE, while the Rényi arm at the same order stays within $1.02$-$1.30\times$ of it on all six larger real graphs (isolating the bound as the cause). The retained information is usable: probing the frozen embedding for node class, a label absent from the objective, gives GGVA up to $+0.14$ macro-F1 over the VGAE on CiteSeer, with the Rényi control again tracking the VGAE. We also report what the design was built to expose: none of this reaches held-out link-prediction accuracy on any of the six larger real graphs, and boundedness delays posterior collapse rather than preventing it. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-25 in cs.AI). Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI). Pagina del lavoro: https://arxiv.org/abs/2609.29546 — 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-08T03:50:58.092Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).