Search Results for author:
Found 13 papers, 11 papers with code
Dynamic Graph Information Bottleneck
Leveraged by the Information Bottleneck (IB) principle, we first propose the expected optimal representations should satisfy the Minimal-Sufficient-Consensual (MSC) Condition.
Poincaré Differential Privacy for Hierarchy-Aware Graph Embedding
Specifically, PoinDP first learns the hierarchy weights for each entity based on the Poincar\'e model in hyperbolic space.
Environment-Aware Dynamic Graph Learning for Out-of-Distribution Generalization
To the best of our knowledge, we are the first to study OOD generalization on dynamic graphs from the environment learning perspective.
Does Graph Distillation See Like Vision Dataset Counterpart?
We validate the proposed SGDD across 9 datasets and achieve state-of-the-art results on all of them: for example, on the YelpChi dataset, our approach maintains 98. 6% test accuracy of training on the original graph dataset with 1, 000 times saving on the scale of the graph.
Hyperbolic Geometric Graph Representation Learning for Hierarchy-imbalance Node Classification
We find that training labeled nodes with different hierarchical properties have a significant impact on the node classification tasks and confirm it in our experiments.
Unbiased and Efficient Self-Supervised Incremental Contrastive Learning
Contrastive Learning (CL) has been proved to be a powerful self-supervised approach for a wide range of domains, including computer vision and graph representation learning.
Self-organization Preserved Graph Structure Learning with Principle of Relevant Information
Most Graph Neural Networks follow the message-passing paradigm, assuming the observed structure depicts the ground-truth node relationships.
Heterogeneous Graph Neural Network for Privacy-Preserving Recommendation
To address this issue, we propose a novel heterogeneous graph neural network privacy-preserving method based on a differential privacy mechanism named HeteDP, which provides a double guarantee on graph features and topology.
Position-aware Structure Learning for Graph Topology-imbalance by Relieving Under-reaching and Over-squashing
Topology-imbalance is a graph-specific imbalance problem caused by the uneven topology positions of labeled nodes, which significantly damages the performance of GNNs.
Curvature Graph Generative Adversarial Networks
In this paper, we proposed a novel Curvature Graph Generative Adversarial Networks method, named \textbf{\modelname}, which is the first GAN-based graph representation method in the Riemannian geometric manifold.
Graph Structure Learning with Variational Information Bottleneck
Graph Neural Networks (GNNs) have shown promising results on a broad spectrum of applications.
ACE-HGNN: Adaptive Curvature Exploration Hyperbolic Graph Neural Network
Hyperbolic Graph Neural Networks(HGNNs) extend GNNs to hyperbolic space and thus are more effective to capture the hierarchical structures of graphs in node representation learning.
A Robust and Generalized Framework for Adversarial Graph Embedding
With the prevalence of graph data in real-world applications, many methods have been proposed in recent years to learn high-quality graph embedding vectors various types of graphs.
