Search Results for author:
Found 22 papers, 13 papers with code
Retrieval-Enhanced Knowledge Editing for Multi-Hop Question Answering in Language Models
Large Language Models (LLMs) have shown proficiency in question-answering tasks but often struggle to integrate real-time knowledge updates, leading to potentially outdated or inaccurate responses.
Reinforcement Neighborhood Selection for Unsupervised Graph Anomaly Detection
To address these issues, we utilize the advantages of reinforcement learning in adaptively learning in complex environments and propose a novel method that incorporates Reinforcement neighborhood selection for unsupervised graph ANomaly Detection (RAND).
GiGaMAE: Generalizable Graph Masked Autoencoder via Collaborative Latent Space Reconstruction
By considering embeddings encompassing graph topology and attribute information as reconstruction targets, our model could capture more generalized and comprehensive knowledge.
Homophily-enhanced Structure Learning for Graph Clustering
Graph clustering is a fundamental task in graph analysis, and recent advances in utilizing graph neural networks (GNNs) have shown impressive results.
Collaborative Graph Neural Networks for Attributed Network Embedding
Graph neural networks (GNNs) have shown prominent performance on attributed network embedding.
OpenGSL: A Comprehensive Benchmark for Graph Structure Learning
Moreover, we observe that the learned graph structure demonstrates a strong generalization ability across different GNN models, despite the high computational and space consumption.
ChatGraph: Interpretable Text Classification by Converting ChatGPT Knowledge to Graphs
To tackle these limitations, we propose a novel framework that leverages the power of ChatGPT for specific tasks, such as text classification, while improving its interpretability.
Multi-Task Learning for Post-transplant Cause of Death Analysis: A Case Study on Liver Transplant
Organ transplant is the essential treatment method for some end-stage diseases, such as liver failure.
Towards Fair Patient-Trial Matching via Patient-Criterion Level Fairness Constraint
To tackle these challenges, deep learning frameworks have been created to match patients to trials.
Towards Personalized Preprocessing Pipeline Search
However, the existing systems often have a very small search space for feature preprocessing with the same preprocessing pipeline applied to all the numerical features.
Bring Your Own View: Graph Neural Networks for Link Prediction with Personalized Subgraph Selection
To bridge the gap, we introduce a Personalized Subgraph Selector (PS2) as a plug-and-play framework to automatically, personally, and inductively identify optimal subgraphs for different edges when performing GNNLP.
DreamShard: Generalizable Embedding Table Placement for Recommender Systems
Although prior work has explored learning-based approaches for the device placement of computational graphs, embedding table placement remains to be a challenging problem because of 1) the operation fusion of embedding tables, and 2) the generalizability requirement on unseen placement tasks with different numbers of tables and/or devices.
Graph Contrastive Learning with Personalized Augmentation
Thus, blindly augmenting all graphs without considering their individual characteristics may undermine the performance of GCL arts. To deal with this, we propose the first principled framework, termed as \textit{G}raph contrastive learning with \textit{P}ersonalized \textit{A}ugmentation (GPA), to advance conventional GCL by allowing each graph to choose its own suitable augmentation operations. In essence, GPA infers tailored augmentation strategies for each graph based on its topology and node attributes via a learnable augmentation selector, which is a plug-and-play module and can be effectively trained with downstream GCL models end-to-end.
Towards Automated Imbalanced Learning with Deep Hierarchical Reinforcement Learning
Motivated by this, we investigate developing a learning-based over-sampling algorithm to optimize the classification performance, which is a challenging task because of the huge and hierarchical decision space.
Hierarchical Reinforcement Learning
reinforcement-learning
+1
Unseen Anomaly Detection on Networks via Multi-Hypersphere Learning
Network anomaly detection is a crucial task since a few anomalies can cause huge losses.
MGAE: Masked Autoencoders for Self-Supervised Learning on Graphs
We introduce a novel masked graph autoencoder (MGAE) framework to perform effective learning on graph structure data.
Subtractive Aggregation for Attributed Network Anomaly Detection
It aims to detect nodes that significantly deviate from their corresponding background.
Dynamic Memory based Attention Network for Sequential Recommendation
It segments the overall long behavior sequence into a series of sub-sequences, then trains the model and maintains a set of memory blocks to preserve long-term interests of users.
Sparse-Interest Network for Sequential Recommendation
Our sparse-interest module can adaptively infer a sparse set of concepts for each user from the large concept pool and output multiple embeddings accordingly.
Learning to Hash with Graph Neural Networks for Recommender Systems
In this work, we investigate the problem of hashing with graph neural networks (GNNs) for high quality retrieval, and propose a simple yet effective discrete representation learning framework to jointly learn continuous and discrete codes.
Is a Single Vector Enough? Exploring Node Polysemy for Network Embedding
Network embedding models are powerful tools in mapping nodes in a network into continuous vector-space representations in order to facilitate subsequent tasks such as classification and link prediction.
Deep Representation Learning for Social Network Analysis
First, we introduce the basic models for learning node representations in homogeneous networks.
