Search Results for author:
Found 17 papers, 9 papers with code
Discovering Invariant Neighborhood Patterns for Heterophilic Graphs
We propose a novel Invariant Neighborhood Pattern Learning (INPL) to alleviate the distribution shifts problem on non-homophilous graphs.
MolBind: Multimodal Alignment of Language, Molecules, and Proteins
Recent advancements in biology and chemistry have leveraged multi-modal learning, integrating molecules and their natural language descriptions to enhance drug discovery.
3M-Diffusion: Latent Multi-Modal Diffusion for Text-Guided Generation of Molecular Graphs
However, practical applications call for methods that generate diverse, and ideally novel, molecules with the desired properties.
In-Context Sharpness as Alerts: An Inner Representation Perspective for Hallucination Mitigation
Large language models (LLMs) frequently hallucinate and produce factual errors, yet our understanding of why they make these errors remains limited.
Towards Off-Policy Reinforcement Learning for Ranking Policies with Human Feedback
Probabilistic learning to rank (LTR) has been the dominating approach for optimizing the ranking metric, but cannot maximize long-term rewards.
Learning to Reweight for Graph Neural Network
In this paper, we study the problem of the generalization ability of GNNs in Out-Of-Distribution (OOD) settings.
Simple and Asymmetric Graph Contrastive Learning without Augmentations
Experimental results show that the simple GraphACL significantly outperforms state-of-the-art graph contrastive learning and self-supervised learning methods on homophilic and heterophilic graphs.
Certifiably Robust Graph Contrastive Learning
Extensive experiments on real-world datasets demonstrate the effectiveness of our proposed method in providing effective certifiable robustness and enhancing the robustness of any GCL model.
Learning How to Propagate Messages in Graph Neural Networks
To compensate for this, in this paper, we present learning to propagate, a general learning framework that not only learns the GNN parameters for prediction but more importantly, can explicitly learn the interpretable and personalized propagate strategies for different nodes and various types of graphs.
A General Offline Reinforcement Learning Framework for Interactive Recommendation
This paper studies the problem of learning interactive recommender systems from logged feedbacks without any exploration in online environments.
Towards Fair Graph Neural Networks via Graph Counterfactual
Despite their great performance in modeling graphs, recent works show that GNNs tend to inherit and amplify the bias from training data, causing concerns of the adoption of GNNs in high-stake scenarios.
Fairness-aware Message Passing for Graph Neural Networks
Graph Neural Networks (GNNs) have shown great power in various domains.
Counterfactual Learning on Graphs: A Survey
To facilitate the development of this promising direction, in this survey, we categorize and comprehensively review papers on graph counterfactual learning.
Reconsidering Learning Objectives in Unbiased Recommendation with Unobserved Confounders
In this paper, we propose a theoretical understanding of why existing unbiased learning objectives work for unbiased recommendation.
Decoupled Self-supervised Learning for Non-Homophilous Graphs
This paper studies the problem of conducting self-supervised learning for node representation learning on graphs.
Semi-supervisedly Co-embedding Attributed Networks
Deep generative models (DGMs) have achieved remarkable advances.
Neural Variational Hybrid Collaborative Filtering
Specifically, we consider both the generative processes of users and items, and the prior of latent factors of users and items to be side informationspecific, which enables our model to alleviate matrix sparsity and learn better latent representations of users and items.
