Search Results for author:
Found 111 papers, 56 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.
MetaSLRCL: A Self-Adaptive Learning Rate and Curriculum Learning Based Framework for Few-Shot Text Classification
For the meta learner, it requires a good generalization ability so as to quickly adapt to new tasks.
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
This invisible relevance bias is prevalent across retrieval models with varying training data and architectures.
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.
CAME: Competitively Learning a Mixture-of-Experts Model for First-stage Retrieval
The first-stage retrieval aims to retrieve a subset of candidate documents from a huge collection both effectively and efficiently.
Retrieval-Augmented Code Generation for Universal Information Extraction
Therefore, in this paper, we propose a universal retrieval-augmented code generation framework based on LLMs, called Code4UIE, for IE tasks.
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.
An In-Context Schema Understanding Method for Knowledge Base Question Answering
As a kind of common method for this task, semantic parsing-based ones first convert natural language questions to logical forms (e. g., SPARQL queries) and then execute them on knowledge bases to get answers.
From Relevance to Utility: Evidence Retrieval with Feedback for Fact Verification
We argue that, rather than relevance, for FV we need to focus on the utility that a claim verifier derives from the retrieved evidence.
CIR at the NTCIR-17 ULTRE-2 Task
The Chinese academy of sciences Information Retrieval team (CIR) has participated in the NTCIR-17 ULTRE-2 task.
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.
Exploring Progress in Multivariate Time Series Forecasting: Comprehensive Benchmarking and Heterogeneity Analysis
Moreover, based on the proposed BasicTS and rich heterogeneous MTS datasets, we conduct an exhaustive and reproducible performance and efficiency comparison of popular models, providing insights for researchers in selecting and designing MTS forecasting models.
A Topological Perspective on Demystifying GNN-Based Link Prediction Performance
Despite the widespread belief that low-degree nodes exhibit poorer LP performance, our empirical findings provide nuances to this viewpoint and prompt us to propose a better metric, Topological Concentration (TC), based on the intersection of the local subgraph of each node with the ones of its neighbors.
A Comparative Study of Training Objectives for Clarification Facet Generation
In this paper, we aim to conduct a systematic comparative study of various types of training objectives, with different properties of not only whether it is permutation-invariant but also whether it conducts sequential prediction and whether it can control the count of output facets.
ProtoEM: A Prototype-Enhanced Matching Framework for Event Relation Extraction
To comprehensively understand their intrinsic semantics, in this paper, we obtain prototype representations for each type of event relation and propose a Prototype-Enhanced Matching (ProtoEM) framework for the joint extraction of multiple kinds of event relations.
Nested Event Extraction upon Pivot Element Recogniton
Specifically, PerNee first recognizes the triggers of both inner and outer events and further recognizes the PEs via classifying the relation type between trigger pairs.
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.
A Survey on Privacy in Graph Neural Networks: Attacks, Preservation, and Applications
Despite this progress, there is a lack of a comprehensive overview of the attacks and the techniques for preserving privacy in the graph domain.
Continual Learning for Generative Retrieval over Dynamic Corpora
We put forward a novel Continual-LEarner for generatiVE Retrieval (CLEVER) model and make two major contributions to continual learning for GR: (i) To encode new documents into docids with low computational cost, we present Incremental Product Quantization, which updates a partial quantization codebook according to two adaptive thresholds; and (ii) To memorize new documents for querying without forgetting previous knowledge, we propose a memory-augmented learning mechanism, to form meaningful connections between old and new documents.
Inducing Causal Structure for Abstractive Text Summarization
The key idea is to reformulate the Variational Auto-encoder (VAE) to fit the joint distribution of the document and summary variables from the training corpus.
L^2R: Lifelong Learning for First-stage Retrieval with Backward-Compatible Representations
First-stage retrieval is a critical task that aims to retrieve relevant document candidates from a large-scale collection.
Black-box Adversarial Attacks against Dense Retrieval Models: A Multi-view Contrastive Learning Method
The AREA task is meant to trick DR models into retrieving a target document that is outside the initial set of candidate documents retrieved by the DR model in response to a query.
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.
Fairness and Diversity in Recommender Systems: A Survey
Additionally, motivated by the concepts of user-level and item-level fairness, we broaden the understanding of diversity to encompass not only the item level but also the user level.
On the Robustness of Generative Retrieval Models: An Out-of-Distribution Perspective
Recently, we have witnessed generative retrieval increasingly gaining attention in the information retrieval (IR) field, which retrieves documents by directly generating their identifiers.
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.
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.
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.
Semantic-Enhanced Differentiable Search Index Inspired by Learning Strategies
Specifically, we assign each document an Elaborative Description based on the query generation technique, which is more meaningful than a string of integers in the original DSI; and (2) For the associations between a document and its identifier, we take inspiration from Rehearsal Strategies in human learning.
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.
Semantic Structure Enhanced Event Causality Identification
This is a very challenging task, because causal relations are usually expressed by implicit associations between events.
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.
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.
Few-shot Link Prediction on N-ary Facts
Link prediction on n-ary facts is to predict a missing element in an n-ary fact.
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.
Visual Transformation Telling
In this paper, we propose a new visual reasoning task, called Visual Transformation Telling (VTT).
Visual Reasoning: from State to Transformation
Such \textbf{state driven} visual reasoning has limitations in reflecting the ability to infer the dynamics between different states, which has shown to be equally important for human cognition in Piaget's theory.
Search-in-the-Chain: Towards Accurate, Credible and Traceable Large Language Models for Knowledge-intensive Tasks
Second, IR verifies the answer of each node of CoQ, it corrects the answer that is not consistent with the retrieved information when IR gives high confidence, which improves the credibility.
A Unified Generative Retriever for Knowledge-Intensive Language Tasks via Prompt Learning
Learning task-specific retrievers that return relevant contexts at an appropriate level of semantic granularity, such as a document retriever, passage retriever, sentence retriever, and entity retriever, may help to achieve better performance on the end-to-end task.
Topic-oriented Adversarial Attacks against Black-box Neural Ranking Models
In this paper, we focus on a more general type of perturbation and introduce the topic-oriented adversarial ranking attack task against NRMs, which aims to find an imperceptible perturbation that can promote a target document in ranking for a group of queries with the same topic.
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.
Rich Event Modeling for Script Event Prediction
Fundamentally, it is based on the proposed rich event description, which enriches the existing ones with three kinds of important information, namely, the senses of verbs, extra semantic roles, and types of participants.
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.
Visual Named Entity Linking: A New Dataset and A Baseline
Since each entity often contains rich visual and textual information in KBs, we thus propose three different sub-tasks, i. e., visual to visual entity linking (V2VEL), visual to textual entity linking (V2TEL), and visual to visual-textual entity linking (V2VTEL).
LegoNet: A Fast and Exact Unlearning Architecture
However, such a strategy typically leads to a loss in model performance, which poses the challenge that increasing the unlearning efficiency while maintaining acceptable performance.
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.
HiSMatch: Historical Structure Matching based Temporal Knowledge Graph Reasoning
This is actually a matching task between a query and candidate entities based on their historical structures, which reflect behavioral trends of the entities at different timestamps.
Certified Robustness to Word Substitution Ranking Attack for Neural Ranking Models
A ranking model is said to be Certified Top-$K$ Robust on a ranked list when it is guaranteed to keep documents that are out of the top $K$ away from the top $K$ under any attack.
Hard Negatives or False Negatives: Correcting Pooling Bias in Training Neural Ranking Models
When sampling top-ranked results (excluding the labeled positives) as negatives from a stronger retriever, the performance of the learned NRM becomes even worse.
A Contrastive Pre-training Approach to Learn Discriminative Autoencoder for Dense Retrieval
Empirical results show that our method can significantly outperform the state-of-the-art autoencoder-based language models and other pre-trained models for dense retrieval.
Scattered or Connected? An Optimized Parameter-efficient Tuning Approach for Information Retrieval
Unlike the promising results in NLP, we find that these methods cannot achieve comparable performance to full fine-tuning at both stages when updating less than 1\% of the original model parameters.
CorpusBrain: Pre-train a Generative Retrieval Model for Knowledge-Intensive Language Tasks
We show that a strong generative retrieval model can be learned with a set of adequately designed pre-training tasks, and be adopted to improve a variety of downstream KILT tasks with further fine-tuning.
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.
Pre-train a Discriminative Text Encoder for Dense Retrieval via Contrastive Span Prediction
% Therefore, in this work, we propose to drop out the decoder and introduce a novel contrastive span prediction task to pre-train the encoder alone.
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?
GERE: Generative Evidence Retrieval for Fact Verification
This classical approach has clear drawbacks as follows: i) a large document index as well as a complicated search process is required, leading to considerable memory and computational overhead; ii) independent scoring paradigms fail to capture the interactions among documents and sentences in ranking; iii) a fixed number of sentences are selected to form the final evidence set.
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.
PRADA: Practical Black-Box Adversarial Attacks against Neural Ranking Models
We focus on the decision-based black-box attack setting, where the attackers cannot directly get access to the model information, but can only query the target model to obtain the rank positions of the partial retrieved list.
Twin Weisfeiler-Lehman: High Expressive GNNs for Graph Classification
The expressive power of message passing GNNs is upper-bounded by Weisfeiler-Lehman (WL) test.
Complex Evolutional Pattern Learning for Temporal Knowledge Graph Reasoning
Furthermore, these models are all trained offline, which cannot well adapt to the changes of evolutional patterns from then on.
A Re-Balancing Strategy for Class-Imbalanced Classification Based on Instance Difficulty
By reducing the weights of the majority classes, such instances would become more difficult to learn and hurt the overall performance consequently.
What is Event Knowledge Graph: A Survey
Besides entity-centric knowledge, usually organized as Knowledge Graph (KG), events are also an essential kind of knowledge in the world, which trigger the spring up of event-centric knowledge representation form like Event KG (EKG).
Piecing and Chipping: An effective solution for the information-erasing view generation in Self-supervised Learning
In self-supervised learning frameworks, deep networks are optimized to align different views of an instance that contains the similar visual semantic information.
Integrating Deep Event-Level and Script-Level Information for Script Event Prediction
In this paper, we propose a Transformer-based model, called MCPredictor, which integrates deep event-level and script-level information for script event prediction.
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.
Toward the Understanding of Deep Text Matching Models for Information Retrieval
We further extend these constraints to the semantic settings, which are shown to be better satisfied for all the deep text matching models.
FedMatch: Federated Learning Over Heterogeneous Question Answering Data
A possible solution to this dilemma is a new approach known as federated learning, which is a privacy-preserving machine learning technique over distributed datasets.
Are Neural Ranking Models Robust?
So we raise the question in this work: Are neural ranking models robust?
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
A Discriminative Semantic Ranker for Question Retrieval
However, these methods often lose the discriminative power as term-based methods, thus introduce noise during retrieval and hurt the recall performance.
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.
Search from History and Reason for Future: Two-stage Reasoning on Temporal Knowledge Graphs
Specifically, at the clue searching stage, CluSTeR learns a beam search policy via reinforcement learning (RL) to induce multiple clues from historical facts.
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.
Link Prediction on N-ary Relational Data Based on Relatedness Evaluation
However, they mainly focus on link prediction on binary relational data, where facts are usually represented as triples in the form of (head entity, relation, tail entity).
B-PROP: Bootstrapped Pre-training with Representative Words Prediction for Ad-hoc Retrieval
The basic idea of PROP is to construct the \textit{representative words prediction} (ROP) task for pre-training inspired by the query likelihood model.
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.
Sketch and Customize: A Counterfactual Story Generator
In the sketch stage, a skeleton is extracted by removing words which are conflict to the counterfactual condition, from the original ending.
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.
Semantic Models for the First-stage Retrieval: A Comprehensive Review
We believe it is the right time to survey current status, learn from existing methods, and gain some insights for future development.
A Linguistic Study on Relevance Modeling in Information Retrieval
We employ 16 linguistic tasks to probe a unified retrieval model over these three retrieval tasks to answer this question.
Learning to Truncate Ranked Lists for Information Retrieval
One is the widely adopted metric such as F1 which acts as a balanced objective, and the other is the best F1 under some minimal recall constraint which represents a typical objective in professional search.
Match-Ignition: Plugging PageRank into Transformer for Long-form Text Matching
However, these models designed for short texts cannot well address the long-form text matching problem, because there are many contexts in long-form texts can not be directly aligned with each other, and it is difficult for existing models to capture the key matching signals from such noisy data.
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.
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.
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.
Event Coreference Resolution with their Paraphrases and Argument-aware Embeddings
To resolve event coreference, existing methods usually calculate the similarities between event mentions and between specific kinds of event arguments.
Transformation Driven Visual Reasoning
Following this definition, a new dataset namely TRANCE is constructed on the basis of CLEVR, including three levels of settings, i. e.~Basic (single-step transformation), Event (multi-step transformation), and View (multi-step transformation with variant views).
PROP: Pre-training with Representative Words Prediction for Ad-hoc Retrieval
Recently pre-trained language representation models such as BERT have shown great success when fine-tuned on downstream tasks including information retrieval (IR).
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
Beyond Language: Learning Commonsense from Images for Reasoning
This paper proposes a novel approach to learn commonsense from images, instead of limited raw texts or costly constructed knowledge bases, for the commonsense reasoning problem in NLP.
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.
Statistical Consistency of Ranking Methods in A Rank-Differentiable Probability Space
This paper is concerned with the statistical consistency of ranking methods.
