SOURCE-LINKED INTELLIGENCE

A dictionary learning framework for graphs via filters and optimal transport

arXiv · AI, language, vision and robotics · article · Sep 5, 2026 · UTC

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

Read original source ↗ Open in workspace

recordType

paper

region

Global