Metraipolis › archive › dc_fec8da998213
A dictionary learning framework for graphs via filters and optimal transport — arXiv:2609.05919
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.05919
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T13:56:26.064Z
- SHA-256 of the archived text
0d8df8ef133ce4094c4534fe5aedc9f091f0237dfb1f56c01a92a11398418e42- Stable URL of this page
https://metraipolis.com/documento/dc_fec8da998213
How to cite
A dictionary learning framework for graphs via filters and optimal transport — arXiv:2609.05919 — arXiv (en), https://arxiv.org/abs/2609.05919 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fec8da998213 (Metraipolis archive dc_fec8da998213, sha256 0d8df8ef133ce4094c4534fe5aedc9f091f0237dfb1f56c01a92a11398418e42)
BibTeX
@misc{dcfec8da998213,
title = {A dictionary learning framework for graphs via filters and optimal transport — arXiv:2609.05919},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.05919},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fec8da998213; sha256 0d8df8ef133ce4094c4534fe5aedc9f091f0237dfb1f56c01a92a11398418e42},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.05919. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We propose a graph dictionary learning (GDL) framework where each graph is represented as a zero-mean Gaussian distribution derived from its filtered Laplacian. Each observed graph is approximated by a barycenter over learned atom graphs, computed under the filter graph distance (fGOT), a graph comparison metric sensitive to global structural properties. The reconstruction error between the observed graph and its barycenter is measured by the surrogate fGOT (sfGOT) distance, a tractable approximation of fGOT that handles graphs without known node correspondence, and is minimized end-to-end via backpropagation. We further provide a novel interpretation of sfGOT through the lens of the Hilbert-Schmidt Independence Criterion, showing that minimizing the sfGOT distance between two graphs is equivalent to maximizing statistical dependence between the spectral embedding of their nodes. Experiments on benchmark datasets demonstrate competitive performance over existing GDL methods on graph clustering and classification tasks. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-09 in cs.LG). Categorie arXiv: Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2609.05919 — 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:42.822Z 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).