Search Results for author:
Found 74 papers, 48 papers with code
Meta-CQG: A Meta-Learning Framework for Complex Question Generation over Knowledge Bases
Complex question generation over knowledge bases (KB) aims to generate natural language questions involving multiple KB relations or functional constraints.
Do LLMs Play Dice? Exploring Probability Distribution Sampling in Large Language Models for Behavioral Simulation
In the first case, the agent is required to give the type and parameters of the probability distribution through the problem description, and then give the sampling sequence.
MLaKE: Multilingual Knowledge Editing Benchmark for Large Language Models
We evaluate the multilingual knowledge editing generalization capabilities of existing methods on MLaKE.
Knowledge Boundary and Persona Dynamic Shape A Better Social Media Agent
For dynamic persona information, we use current action information to internally retrieve the persona information of the agent, thereby reducing the interference of diverse persona information on the current action.
Unsupervised Information Refinement Training of Large Language Models for Retrieval-Augmented Generation
Retrieval-augmented generation (RAG) enhances large language models (LLMs) by incorporating additional information from retrieval.
Unlocking the Power of Large Language Models for Entity Alignment
To address the constraints of limited input KG data, ChatEA introduces a KG-code translation module that translates KG structures into a format understandable by LLMs, thereby allowing LLMs to utilize their extensive background knowledge to improve EA accuracy.
Qsnail: A Questionnaire Dataset for Sequential Question Generation
Questionnaires entail a series of questions that must conform to intricate constraints involving the questions, options, and overall structure.
Event-aware Video Corpus Moment Retrieval
Video Corpus Moment Retrieval (VCMR) is a practical video retrieval task focused on identifying a specific moment within a vast corpus of untrimmed videos using the natural language query.
Improving Video Corpus Moment Retrieval with Partial Relevance Enhancement
We argue that effectively capturing the partial relevance between the query and video is essential for the VCMR task.
Stable Knowledge Editing in Large Language Models
The premise of localization results in an incomplete knowledge editing, whereas an isolated assumption may impair both other knowledge and general abilities.
Retrieve Only When It Needs: Adaptive Retrieval Augmentation for Hallucination Mitigation in Large Language Models
A careful and balanced integration of the parametric knowledge within LLMs with external information is crucial to alleviate hallucinations.
Unlink to Unlearn: Simplifying Edge Unlearning in GNNs
As concerns over data privacy intensify, unlearning in Graph Neural Networks (GNNs) has emerged as a prominent research frontier in academia.
List-aware Reranking-Truncation Joint Model for Search and Retrieval-augmented Generation
First, it is hard to share the contextual information of the ranking list between the two tasks.
Graph Domain Adaptation: Challenges, Progress and Prospects
To the best of our knowledge, this paper is the first survey for graph domain adaptation.
LoRec: Large Language Model for Robust Sequential Recommendation against Poisoning Attacks
Traditional defense strategies predominantly depend on predefined assumptions or rules extracted from specific known attacks, limiting their generalizability to unknown attack types.
TEA: Test-time Energy Adaptation
To address this, we propose a novel energy-based perspective, enhancing the model's perception of target data distributions without requiring access to training data or processes.
AI-Generated Images Introduce Invisible Relevance Bias to Text-Image Retrieval
Furthermore, our subsequent exploration reveals that the inclusion of AI-generated images in the training data of the retrieval models exacerbates the invisible relevance bias.
Think Before You Speak: Cultivating Communication Skills of Large Language Models via Inner Monologue
The emergence of large language models (LLMs) further improves the capabilities of open-domain dialogue systems and can generate fluent, coherent, and diverse responses.
Plot Retrieval as an Assessment of Abstract Semantic Association
Readers usually only give an abstract and vague description as the query based on their own understanding, summaries, or speculations of the plot, which requires the retrieval model to have a strong ability to estimate the abstract semantic associations between the query and candidate plots.
DyTSCL: Dynamic graph representation via tempo-structural contrastive learning
In this paper, we propose a novel Dynamic graph representation framework via Tempo-Structural Contrastive Learning, DyTSCL, which trains the model by identifying three different subgraphs as a task, named Tempo-Structural subgraph, Non-Temporal subgraph and Non-Structural subgraph.
RegaVAE: A Retrieval-Augmented Gaussian Mixture Variational Auto-Encoder for Language Modeling
It encodes the text corpus into a latent space, capturing current and future information from both source and target text.
Causality and Independence Enhancement for Biased Node Classification
Most existing methods that address out-of-distribution (OOD) generalization for node classification on graphs primarily focus on a specific type of data biases, such as label selection bias or structural bias.
Robust Recommender System: A Survey and Future Directions
With the rapid growth of information, recommender systems have become integral for providing personalized suggestions and overcoming information overload.
Bridged-GNN: Knowledge Bridge Learning for Effective Knowledge Transfer
Transfer learning has been a feasible way to transfer knowledge from high-quality external data of source domains to limited data of target domains, which follows a domain-level knowledge transfer to learn a shared posterior distribution.
OpenGDA: Graph Domain Adaptation Benchmark for Cross-network Learning
Overall, OpenGDA provides a user-friendly, scalable and reproducible benchmark for evaluating graph domain adaptation models.
PDE+: Enhancing Generalization via PDE with Adaptive Distributional Diffusion
The generalization of neural networks is a central challenge in machine learning, especially concerning the performance under distributions that differ from training ones.
IDEA: Invariant Causal Defense for Graph Adversarial Robustness
Through modeling and analyzing the causal relationships in graph adversarial attacks, we design two invariance objectives to learn the causal features.
LLMDet: A Third Party Large Language Models Generated Text Detection Tool
By jointly analyzing the proxy perplexities of LLMs, we can determine the source of the generated text.
MacLaSa: Multi-Aspect Controllable Text Generation via Efficient Sampling from Compact Latent Space
Multi-aspect controllable text generation aims to generate fluent sentences that possess multiple desired attributes simultaneously.
SimOAP: Improve Coherence and Consistency in Persona-based Dialogue Generation via Over-sampling and Post-evaluation
Language models trained on large-scale corpora can generate remarkably fluent results in open-domain dialogue.
BERM: Training the Balanced and Extractable Representation for Matching to Improve Generalization Ability of Dense Retrieval
Dense retrieval has shown promise in the first-stage retrieval process when trained on in-domain labeled datasets.
Popularity Debiasing from Exposure to Interaction in Collaborative Filtering
In this paper, we propose a new criterion for popularity debiasing, i. e., in an unbiased recommender system, both popular and unpopular items should receive Interactions Proportional to the number of users who Like it, namely IPL criterion.
Search-in-the-Chain: Interactively Enhancing Large Language Models with Search for Knowledge-intensive Tasks
This paper proposes a novel framework named \textbf{Search-in-the-Chain} (SearChain) for the interaction between LLM and IR to solve the challenges.
Toward Practical Entity Alignment Method Design: Insights from New Highly Heterogeneous Knowledge Graph Datasets
Firstly, we address the oversimplified heterogeneity settings of current datasets and propose two new HHKG datasets that closely mimic practical EA scenarios.
Graph Adversarial Immunization for Certifiable Robustness
In this paper, we propose and formulate graph adversarial immunization, i. e., vaccinating part of graph structure to improve certifiable robustness of graph against any admissible adversarial attack.
Adversarial Learning Data Augmentation for Graph Contrastive Learning in Recommendation
To reduce the influence of data sparsity, Graph Contrastive Learning (GCL) is adopted in GNN-based CF methods for enhancing performance.
Predicting the Silent Majority on Graphs: Knowledge Transferable Graph Neural Network
To combat the above challenges, we propose Knowledge Transferable Graph Neural Network (KT-GNN), which models distribution shifts during message passing and representation learning by transferring knowledge from vocal nodes to silent nodes.
Company-as-Tribe: Company Financial Risk Assessment on Tribe-Style Graph with Hierarchical Graph Neural Networks
However, most nodes in the tribe-style graph lack attributes, making it difficult to directly adopt existing graph learning methods (e. g., Graph Neural Networks(GNNs)).
Multi-video Moment Ranking with Multimodal Clue
In this paper, we focus on improving two problems of two-stage method: (1) Moment prediction bias: The predicted moments for most queries come from the top retrieved videos, ignoring the possibility that the target moment is in the bottom retrieved videos, which is caused by the inconsistency of Shared Normalization during training and inference.
Cross-Model Comparative Loss for Enhancing Neuronal Utility in Language Understanding
Comparative loss is essentially a ranking loss on top of the task-specific losses of the full and ablated models, with the expectation that the task-specific loss of the full model is minimal.
NIR-Prompt: A Multi-task Generalized Neural Information Retrieval Training Framework
Different needs correspond to different IR tasks such as document retrieval, open-domain question answering, retrieval-based dialogue, etc., while they share the same schema to estimate the relationship between texts.
Towards Generalizable Graph Contrastive Learning: An Information Theory Perspective
Guided by the bound, we design a GCL framework named InfoAdv with enhanced generalization ability, which jointly optimizes the generalization metric and InfoMax to strike the right balance between pretext task fitting and the generalization ability on downstream tasks.
Hierarchical Estimation for Effective and Efficient Sampling Graph Neural Network
On account that previous studies either lacks variance analysis or only focus on a particular sampling paradigm, we firstly propose an unified node sampling variance analysis framework and analyze the core challenge "circular dependency" for deriving the minimum variance sampler, i. e., sampling probability depends on node embeddings while node embeddings can not be calculated until sampling is finished.
DyTed: Disentangled Representation Learning for Discrete-time Dynamic Graph
Unsupervised representation learning for dynamic graphs has attracted a lot of research attention in recent years.
Adversarial Camouflage for Node Injection Attack on Graphs
In this paper, we first propose and define camouflage as distribution similarity between ego networks of injected nodes and normal nodes.
Learning node embeddings via summary graphs: a brief theoretical analysis
Recent works try to improve scalability via graph summarization -- i. e., they learn embeddings on a smaller summary graph, and then restore the node embeddings of the original graph.
Few-Shot Stance Detection via Target-Aware Prompt Distillation
The main challenge of this task comes two-fold: few-shot learning resulting from the varying targets and the lack of contextual information of the targets.
Augmentation-Aware Self-Supervision for Data-Efficient GAN Training
Training generative adversarial networks (GANs) with limited data is challenging because the discriminator is prone to overfitting.
LoL: A Comparative Regularization Loss over Query Reformulation Losses for Pseudo-Relevance Feedback
Ideally, if a PRF model can distinguish between irrelevant and relevant information in the feedback, the more feedback documents there are, the better the revised query will be.
Multi-scale Anomaly Detection for Big Time Series of Industrial Sensors
Given a multivariate big time series, can we detect anomalies as soon as they occur?
Match-Prompt: Improving Multi-task Generalization Ability for Neural Text Matching via Prompt Learning
In generalization stage, matching model explores the essential matching signals by being trained on diverse matching tasks.
A Roadmap for Big Model
With the rapid development of deep learning, training Big Models (BMs) for multiple downstream tasks becomes a popular paradigm.
Twin Weisfeiler-Lehman: High Expressive GNNs for Graph Classification
The expressive power of message passing GNNs is upper-bounded by Weisfeiler-Lehman (WL) test.
Transductive Learning for Unsupervised Text Style Transfer
The proposed transductive learning approach is general and effective to the task of unsupervised style transfer, and we will apply it to the other two typical methods in the future.
Adaptive Information Seeking for Open-Domain Question Answering
Information seeking is an essential step for open-domain question answering to efficiently gather evidence from a large corpus.
Ranked #3 on
Question Answering
on HotpotQA
Single Node Injection Attack against Graph Neural Networks
In this paper, we focus on an extremely limited scenario of single node injection evasion attack, i. e., the attacker is only allowed to inject one single node during the test phase to hurt GNN's performance.
Signed Bipartite Graph Neural Networks
Signed bipartite networks are different from classical signed networks, which contain two different node sets and signed links between two node sets.
Conditional GANs with Auxiliary Discriminative Classifier
Specifically, the proposed auxiliary discriminative classifier becomes generator-aware by recognizing the class-labels of the real data and the generated data discriminatively.
Ranked #1 on
Conditional Image Generation
on Tiny ImageNet
INMO: A Model-Agnostic and Scalable Module for Inductive Collaborative Filtering
INMO generates the inductive embeddings for users (items) by characterizing their interactions with some template items (template users), instead of employing an embedding lookup table.
Self-Supervised GANs with Label Augmentation
Recently, transformation-based self-supervised learning has been applied to generative adversarial networks (GANs) to mitigate catastrophic forgetting in the discriminator by introducing a stationary learning environment.
Temporal Knowledge Graph Reasoning Based on Evolutional Representation Learning
To capture these properties effectively and efficiently, we propose a novel Recurrent Evolution network based on Graph Convolution Network (GCN), called RE-GCN, which learns the evolutional representations of entities and relations at each timestamp by modeling the KG sequence recurrently.
Locate Who You Are: Matching Geo-location to Text for User Identity Linkage
However, encouraged by online services, users would also post asymmetric information across networks, such as geo-locations and texts.
GCN-ALP: Addressing Matching Collisions in Anchor Link Prediction
However, the low quality of observed user data confuses the judgment on anchor links, resulting in the matching collision problem in practice.
Modelling Universal Order Book Dynamics in Bitcoin Market
Understanding the emergence of universal features such as the stylized facts in markets is a long-standing challenge that has drawn much attention from economists and physicists.
SDGNN: Learning Node Representation for Signed Directed Networks
Guided by related sociological theories, we propose a novel Signed Directed Graph Neural Networks model named SDGNN to learn node embeddings for signed directed networks.
Beyond Low-frequency Information in Graph Convolutional Networks
For a deeper understanding, we theoretically analyze the roles of low-frequency signals and high-frequency signals on learning node representations, which further explains why FAGCN can perform well on different types of networks.
Towards Powerful Graph Neural Networks: Diversity Matters
For a target node, diverse sampling offers it diverse neighborhoods, i. e., rooted sub-graphs, and the representation of target node is finally obtained via aggregating the representation of diverse neighborhoods obtained using any GNN model.
Learning content and context with language bias for Visual Question Answering
Many works concentrate on how to reduce language bias which makes models answer questions ignoring visual content and language context.
PPGN: Phrase-Guided Proposal Generation Network For Referring Expression Comprehension
Reference expression comprehension (REC) aims to find the location that the phrase refer to in a given image.
Slimmable Generative Adversarial Networks
In particular, for real-time generation tasks, different devices require generators of different sizes due to varying computing power.
AugSplicing: Synchronized Behavior Detection in Streaming Tensors
Therefore, we propose a fast streaming algorithm, AugSplicing, which can detect the top dense blocks by incrementally splicing the previous detection with the incoming ones in new tuples, avoiding re-runs over all the history data at every tracking time step.
Summarizing graphs using configuration model
As a solution, graph summarization, which aims to find a compact representation that preserves the important properties of a given graph, has received much attention, and numerous algorithms have been developed for it.
Social and Information Networks
DeepHawkes: Bridging the gap between prediction and understanding of information cascades
In this paper, we propose DeepHawkes to combat the defects of existing methods, leveraging end-to-end deep learning to make an analogy to interpretable factors of Hawkes process — a widely-used generative process to model information cascade.
Cascade Dynamics Modeling with Attention-based Recurrent Neural Network
However, for cascade prediction, each cascade generally corresponds to a diffusion tree, causing cross-dependence in cascade— one sharing behavior could be triggered by its non-immediate predecessor in the memory chain.
