8 papers
Filter Learning for Subgraphs: Algebras and Performance Risk Bounds
Purui Zhang, Feng Ji, Yanan Zhao +2
Graph signal processing tasks that leverage spectral information typically assume access to the complete graph topology, which is often unavailable in practice. We propose a system…
Graph Distribution-valued Signals in Wasserstein Spaces: Theory and Applications
Yanan Zhao, Feng Ji, Xingchao Jian +1
We introduce a framework for graph signal processing (GSP) in which signals are represented as graph distribution-valued signals (GDSs), i.e., probability measures in a Wasserstein…
Adaptive Multi-view Graph Contrastive Learning via Fractional-order Neural Diffusion Networks
Yanan Zhao, Feng Ji, Jingyang Dai +4
Graph contrastive learning (GCL) learns node and graph representations by contrasting multiple views of the same graph. Existing methods typically rely on fixed, handcrafted views-…
Graph Distribution-valued Signals: A Wasserstein Space Perspective
Yanan Zhao, Feng Ji, Xingchao Jian +1
We introduce a novel framework for graph signal processing (GSP) that models signals as graph distribution-valued signals (GDSs), which are probability distributions in the Wassers…
Uncertainty Principle for Vertex-Time Graph Signal Processing
Yanan Zhao, Xingchao Jian, Feng Ji +2
We present an uncertainty principle for graph signals in the vertex-time domain, unifying the classical time-frequency and graph uncertainty principles within a single framework. B…
Personalized Subgraph Federated Learning with Sheaf Collaboration
Wenfei Liang, Yanan Zhao, Rui She +2
Graph-structured data is prevalent in many applications. In subgraph federated learning (FL), this data is distributed across clients, each with a local subgraph. Personalized subg…