Search Results for author:
Found 12 papers, 7 papers with code
Dynamic Sparse Learning: A Novel Paradigm for Efficient Recommendation
In the realm of deep learning-based recommendation systems, the increasing computational demands, driven by the growing number of users and items, pose a significant challenge to practical deployment.
EXGC: Bridging Efficiency and Explainability in Graph Condensation
Graph representation learning on vast datasets, like web data, has made significant strides.
Two Heads Are Better Than One: Boosting Graph Sparse Training via Semantic and Topological Awareness
Specifically, GST initially constructs a topology & semantic anchor at a low training cost, followed by performing dynamic sparse training to align the sparse graph with the anchor.
On the Opportunities of Green Computing: A Survey
To tackle the challenges of computing resources and environmental impact of AI, Green Computing has become a hot research topic.
GIF: A General Graph Unlearning Strategy via Influence Function
Then, we recognize the crux to the inability of traditional influence function for graph unlearning, and devise Graph Influence Function (GIF), a model-agnostic unlearning method that can efficiently and accurately estimate parameter changes in response to a $\epsilon$-mass perturbation in deleted data.
Unleashing the Power of Graph Data Augmentation on Covariate Distribution Shift
From the perspective of invariant learning and stable learning, a recently well-established paradigm for out-of-distribution generalization, stable features of the graph are assumed to causally determine labels, while environmental features tend to be unstable and can lead to the two primary types of distribution shifts.
Causal Attention for Interpretable and Generalizable Graph Classification
To endow the classifier with better interpretation and generalization, we propose the Causal Attention Learning (CAL) strategy, which discovers the causal patterns and mitigates the confounding effect of shortcuts.
Inductive Lottery Ticket Learning for Graph Neural Networks
In this work, we propose a simple and effective learning paradigm, Inductive Co-Pruning of GNNs (ICPG), to endow graph lottery tickets with inductive pruning capacity.
Exploring Lottery Ticket Hypothesis in Media Recommender Systems
We get inspirations from the recently proposed lottery ticket hypothesis (LTH), which argues that the dense and over-parameterized model contains a much smaller and sparser sub-model that can reach comparable performance to the full model.
GANs Can Play Lottery Tickets Too
In this work, we for the first time study the existence of such trainable matching subnetworks in deep GANs.
A Unified Lottery Ticket Hypothesis for Graph Neural Networks
With graphs rapidly growing in size and deeper graph neural networks (GNNs) emerging, the training and inference of GNNs become increasingly expensive.
Graph Contrastive Learning with Augmentations
In this paper, we propose a graph contrastive learning (GraphCL) framework for learning unsupervised representations of graph data.
