Papers by Jiafeng Guo

64 papers
Complex Evolutional Pattern Learning for Temporal Knowledge Graph Reasoning (2022.acl-short)

Copied to clipboard

Challenge: Existing models for TKG reasoning focus on modeling fact sequences of a fixed length, which cannot discover complex evolutional patterns that vary in length.
Approach: They propose to use a length-aware Convolutional Neural Network to handle evolutional patterns of different lengths via an easy-to-difficult curriculum learning strategy.
Outcome: The proposed model improves performance under both offline and online learning strategies.
QUITO-X: A New Perspective on Context Compression from the Information Bottleneck Theory (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for compressing context by removing redundant tokens are inconsistent with the objective of retaining the most important tokens when conditioning on a given query.
Approach: They propose a method that uses information bottleneck theory to compress context . they propose to remove redundant tokens using metrics such as self-information or perplexity .
Outcome: The proposed method achieves a 25% increase in compression rate compared to the state-of-the-art .
Lost in Decomposition: Analyzing and Mitigating the Limitations of Long Context Methods via Context Dependency (2026.findings-acl)

Copied to clipboard

Challenge: Existing workflow-based long context methods do not perform well on specific datasets . performance degradation is associated with the indiscriminate application of long context models .
Approach: They propose a training-free adaptive routing strategy to improve long context large language models' robustness.
Outcome: The proposed method can be generalized to all types of datasets, but performance degradation is a concern.
Search from History and Reason for Future: Two-stage Reasoning on Temporal Knowledge Graphs (2021.acl-long)

Copied to clipboard

Challenge: Temporal Knowledge Graphs (TKGs) are used in many different areas of research.
Approach: They propose to use a beam search policy to induce multiple clues from historical facts . they propose to adopt a graph convolution network based sequence method to deduce answers from clues .
Outcome: The proposed model can predict future facts in two stages, Clue Searching and Temporal Reasoning.
MDPO: Customized Direct Preference Optimization with a Metric-based Sampler for Question and Answer Generation (2025.coling-main)

Copied to clipboard

Challenge: Existing methods for QA data generation are limited by the dependence of existing evaluation metrics on ground truth labels.
Approach: They propose a set of unsupervised evaluation metrics for QA data that enable multidimensional assessment based on the relationships among context,question and answer.
Outcome: The proposed method outperforms state-of-the-art methods on public datasets and shows that it produces high-quality and domain-specific QA pairs.
Temporal Knowledge Graph Reasoning Based on N-tuple Modeling (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing Temporal Knowledge Graphs (TKGs) only contain their core entities and form them as quadruples.
Approach: They propose to describe a temporal fact more accurately as an n-tuple . they propose to use a neural network to learn evolutional representations of entities .
Outcome: The proposed model oversimplifies and causes information loss on two datasets.
Gated Differentiable Working Memory for Long-Context Language Modeling (2026.acl-long)

Copied to clipboard

Challenge: Long contexts break transformers, attention scores dilute, model cannot adapt to novel patterns at inference time.
Approach: They propose a framework that gates the memory consolidation process by estimating Contextual Utility . they propose GDWM to maintain a form of working memory with constant contexts .
Outcome: The proposed framework achieves comparable or superior performance on sparse-information tasks with 4 fewer gradient steps compared to uniform baselines.
Towards Fully Exploiting LLM Internal States to Enhance Knowledge Boundary Perception (2025.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) exhibit impressive performance across diverse tasks but struggle to accurately gauge their knowledge boundaries.
Approach: They propose Consistency-based Confidence Calibration (C3) which assesses confidence consistency through question reformulation to improve LLMs’ ability to recognize their knowledge gaps.
Outcome: The proposed method improves the unknown perception rate by 5.6% on NQ and 4.9% on HotpotQA.
Controlling Risk of Retrieval-augmented Generation: A Counterfactual Prompting Framework (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing studies on retrieval-augmented generation (RAG) rarely address the issue of predictive uncertainty, i.e., how likely it is that a RAG model’s prediction is incorrect.
Approach: They propose a framework that induces RAG models to alter latent factors and analyzes the effect on their answers.
Outcome: The proposed framework identifies two critical factors affecting RAG models' confidence in their answers and analyzes the effect on their answers.
CofeNet: Context and Former-Label Enhanced Net for Complicated Quotation Extraction (2022.coling-1)

Copied to clipboard

Challenge: Existing solutions for quotation extraction use rule-based approaches and sequence labeling models.
Approach: They propose a Context and Former-Label Enhanced Net for quotation extraction.
Outcome: The proposed method achieves state-of-the-art performance on complicated quotation extraction on two public datasets and one proprietary dataset.
MPRF: Interpretable Stance Detection through Multi-Path Reasoning Framework (2025.emnlp-main)

Copied to clipboard

Challenge: Existing stance detection methods treat the task as a classification problem, where models output a stance label without providing interpretable reasoning paths.
Approach: They propose a framework that generates, evaluates, and integrates multiple reasoning paths to improve accuracy, robustness, and transparency in stance detection.
Outcome: The proposed framework outperforms existing models on the SEM16, VAST, and PStance datasets and is highly interpretable and reliable.
Distilling Large Embeddings via Hyperspherical Householder Quantization (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for quantizing large embeddings rely on Euclidean quantization, which is poorly aligned with the angular geometry induced by contrastive embeddment training.
Approach: They propose a geometry-aware distillation method that compresses large embeddings into short discrete representations via iterative Householder transformations on the unit hypersphere.
Outcome: The proposed method reduces decoding cost and maintains strong semantic retrieval accuracy.
RouteRAG: Efficient Retrieval-Augmented Generation from Text and Graph via Reinforcement Learning (2026.findings-acl)

Copied to clipboard

Challenge: Existing graph-based or hybrid systems lack the ability to integrate supplementary evidence as reasoning unfolds.
Approach: They propose a framework that integrates non-parametric knowledge into Large Language Models . they use a RL-based framework to optimize the entire generation process via RL .
Outcome: The proposed framework outperforms existing RAG frameworks in five question answering benchmarks.
NeuInfer: Knowledge Inference on N-ary Facts (2020.acl-main)

Copied to clipboard

Challenge: Existing studies on knowledge inference on binary facts have focused on finding out connotative valid facts.
Approach: They propose a neural network model, NeuInfer, for knowledge inference on n-ary facts.
Outcome: The proposed model can cope with the task to infer an unknown element in a whole fact, while ignoring the binary facts.
The Silent Saboteur: Imperceptible Adversarial Attacks against Black-Box Retrieval-Augmented Generation Systems (2025.findings-acl)

Copied to clipboard

Challenge: Existing studies have focused on corpus poisoning, but there are no studies on adversarial attacks on RAG systems.
Approach: They propose a novel imperceptible retrieve-to-generate attack against RAG systems . they propose regenerative reinforcement learning framework that tracks interactions between attacker and target RAG .
Outcome: The proposed framework outperforms existing attacks on factual and non-factual RAG systems with small imperceptible text perturbations.
Compete to Complete: Co-opetition Adversarial Learning for Retrieval-Augmented Generation (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to reduce hallucination in large language models lack a robust mechanism for generating a generative model.
Approach: They propose a framework that formulates retriever–generator training in RAG as a minimax game.
Outcome: The proposed framework improves retrieval-augmented generation performance on seven benchmark datasets.
Iterative Structured Pruning for Large Language Models with Multi-Domain Calibration (2026.eacl-industry)

Copied to clipboard

Challenge: Existing models with unstructured pruning often yield irregular sparsity patterns that necessitate specialized hardware or software support.
Approach: They propose a structured pruning framework that eliminates entire architectural components and maintains compatibility with standard hardware accelerators.
Outcome: The proposed model pruning framework achieves significant compression with minimal performance degradation on multiple models across diverse downstream tasks.
From Relevance to Utility: Evidence Retrieval with Feedback for Fact Verification (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing evidence retrieval models are based on probability ranking principle . existing models do not align with retrieval-enhanced verification frameworks .
Approach: They propose a feedback-based evidence retriever that optimizes the evidence retrieval process by incorporating feedback from the claim verifier.
Outcome: Empirical studies show that the proposed method is superior to baseline methods.
HiSMatch: Historical Structure Matching based Temporal Knowledge Graph Reasoning (2022.findings-emnlp)

Copied to clipboard

Challenge: Temporal Knowledge Graphs (TKGs) store facts as triples in the form of subject, relation, object, timestamps.
Approach: They propose a Temporal Knowledge Graph (TKG) model that extends each triple with a timestamp to describe dynamic facts.
Outcome: The proposed model improves on six benchmark datasets with up to 5.6% performance improvement compared to the state-of-the-art models.
Tailoring Table Retrieval from a Field-aware Hybrid Matching Perspective (2025.emnlp-main)

Copied to clipboard

Challenge: Empirical results show that a hybrid retrieval approach to table retrieval outperforms state-of-the-art benchmarks.
Approach: They propose a table-tailored HYbrid matching rEtriever which addresses table matching needs from a field-aware hybrid perspective.
Outcome: Empirical results show that the proposed rEtriever outperforms state-of-the-art retrieval methods.
Detoxification for LLM: From Dataset Itself (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for large language models focus on post-training stage or inference time, while few tackle the source of toxicity, namely, the dataset itself.
Approach: They propose to localize and rewrite toxic spans in raw corpora with SoCD, which guides an LLM to localized and preserving semantics while preserving toxicity.
Outcome: The proposed method reduces TP from 0.42 to 0.18 and Expected Maximum Toxicity (EMT) from 0.43 to 0.20 on three LLMs.
Evaluating Implicit Bias in Large Language Models by Attacking From a Psychometric Perspective (2025.findings-acl)

Copied to clipboard

Challenge: Existing studies have shown that large language models (LLMs) can elicit implicit biases that hurt certain demographics without explicit harmful words.
Approach: They propose three attack approaches to elicit agreements to biased viewpoints from LLMs from a psychometric perspective and built two benchmarks to compare them.
Outcome: The proposed methods elicit agreements to biased viewpoints more effectively than baselines.
Compressing then Matching: An Efficient Pre-training Paradigm for Multimodal Embedding (2026.acl-long)

Copied to clipboard

Challenge: Recent approaches demonstrate that MLLMs can be adapted into competitive embedding models via large-scale contrastive learning.
Approach: They propose a compressed pre-training phase which serves as a warm-up stage for contrastive learning.
Outcome: The proposed model achieves state-of-the-art among MLLMs of comparable size on the MMEB, realizing optimization in both efficiency and effectiveness.
LINKAGE: Listwise Ranking among Varied-Quality References for Non-Factoid QA Evaluation via LLMs (2024.findings-emnlp)

Copied to clipboard

Challenge: Non-factoid (NF) question answering is challenging to evaluate due to diverse potential answers and no objective criterion.
Approach: They propose a listwise NFQA evaluation approach that uses Large Language Models to rank candidate answers in a descending list of reference answers sorted by descending quality.
Outcome: The proposed method has higher correlations with human annotations than standard methods.
Towards Robust Universal Information Extraction: Dataset, Evaluation, and Solution (2025.acl-long)

Copied to clipboard

Challenge: Existing robust benchmark datasets generate only a limited range of perturbations for a single Information Extraction (UIE) task, which fails to evaluate the robustness of UIE models effectively.
Approach: They propose a new benchmark dataset that utilizes Large Language Models to generate more diverse and realistic perturbations across different IE tasks.
Outcome: The proposed model performs better with only 15% of the data and is more robust with other models.
Tailored Sequence to Sequence Models to Different Conversation Scenarios (P18-1)

Copied to clipboard

Challenge: Sequence to sequence (Seq2Sequeq) models fail to meet the diverse requirements for different conversation scenarios, such as customer service and chatbot.
Approach: They propose two optimized criteria for Sequence to sequence (Seq2Sequeq) to meet different conversation scenarios, i.e., maximum generated likelihood for specific-requirement scenario, and conditional value-at-risk for diverse-requrement scenarios.
Outcome: The proposed models satisfies diverse requirements for different conversation scenarios and yields better performances than existing models.
Knowledge-Enhanced Self-Supervised Prototypical Network for Few-Shot Event Detection (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for few-shot event detection are inaccurate and lack a prototype representation module.
Approach: They propose a Knowledge-Enhanced self-supervised prototypical network for few-shot event detection . it adopts hybrid rules which align event types to FrameNet and introduces knowledge to obtain more instances .
Outcome: The proposed network improves few-shot event detection performance on three benchmark datasets.
CLaMP 2: Multimodal Music Information Retrieval Across 101 Languages Using Large Language Models (2025.findings-naacl)

Copied to clipboard

Challenge: Current music information retrieval systems struggle to meet linguistic diversity challenges . current systems struggle with text queries in non-English languages .
Approach: They propose a music information retrieval system that supports both ABC notation and MIDI . CLaMP 2 includes a multilingual text encoder and a multiple-modal music encoder .
Outcome: The proposed system achieves state-of-the-art results in multilingual semantic search and music classification across modalities.
Event Detection with Multi-Order Graph Convolution and Aggregated Attention (D19-1)

Copied to clipboard

Challenge: Existing methods for event detection use first-order syntactic relations to identify trigger words.
Approach: They propose a dependency tree-based method to model and aggregate multi-order syntactic representations in sentences.
Outcome: The proposed method outperforms existing methods on a benchmark dataset . it uses a dependency tree based graph convolution network with aggregative attention .
KnowCoder-X: Boosting Multilingual Information Extraction via Code (2025.findings-acl)

Copied to clipboard

Challenge: Empirical evidence indicates that Large Language Models exhibit spontaneous cross-lingual alignment in Information Extraction (IE) however, a significant imbalance across languages persists, highlighting an underlying deficiency.
Approach: They propose a code LLM with advanced cross-lingual and multilingual capabilities for universal IE that standardizes the representation of multilingual schemas using Python classes and conducts IE alignment instruction tuning on translated instance prediction task.
Outcome: The proposed model surpasses ChatGPT and SoTA by 30.17% without training in 29 unseen languages and significantly improves cross-lingual IE transferability.
Selective Temporal Knowledge Graph Reasoning (2024.lrec-main)

Copied to clipboard

Challenge: Existing models cannot abstain from uncertain predictions, which will bring risks in real-world applications.
Approach: They propose to abstain from uncertain future facts by using a confidence estimator . they take both the certainty of the current prediction and the accuracy of historical predictions into account .
Outcome: The proposed abstention mechanism helps existing models make selective predictions instead of indiscriminate ones.
ReCoSa: Detecting the Relevant Contexts with Self-Attention for Multi-turn Dialogue Generation (P19-1)

Copied to clipboard

Challenge: Existing hierarchical recurrent encoder-decoder models treat all contexts indiscriminately, which may hurt the following response generation process.
Approach: They propose a hierarchical recurrent encoder-decoder model that treats all contexts indiscriminately and uses a word level LSTM encoder to obtain the initial representation of each context.
Outcome: The proposed model outperforms baseline models on Chinese customer services and English Ubuntu dialogue datasets in terms of both metric-based and human evaluations.
Prompt Tuning with Contradictory Intentions for Sarcasm Recognition (2023.eacl-main)

Copied to clipboard

Challenge: Recent advances have shown that Pre-trained Language Models (PLMs) can achieve promising performance in many downstream Natural Language Processing (NLP) tasks.
Approach: They propose to incorporate prior knowledge about contradictory intentions into prompt tuning for sarcasm recognition by mimicking the actual intention by verbalizer engineering.
Outcome: The proposed model mimics the actual intention by prompt construction and indicates whether the actual intent contradicts the literal content by verbalizer engineering.
Event Coreference Resolution with their Paraphrases and Argument-aware Embeddings (2020.coling-main)

Copied to clipboard

Challenge: Existing methods for event coreference resolution do not identify paraphrase relations between events.
Approach: They propose a new event-specific paraphrase and argument-aware semantic Embedding model for event coreference resolution based on event-related paraphrases and argument embeddings . EPASE recognizes deep paraphrase relations in an event- specific context of sentences and can cover event paraphrase of more situations .
Outcome: Experiments on within- and cross-document event coreference show it is superior compared to existing methods.
Few-shot Link Prediction on Hyper-relational Facts (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods to predict missing elements in hyper-relational facts require high-quality data.
Approach: They propose a task to predict a missing entity in a hyper-relational fact with limited support instances.
Outcome: The proposed model outperforms existing models on three datasets.
An Iterative Utility Judgment Framework Inspired by Philosophical Relevance via LLMs (2026.findings-acl)

Copied to clipboard

Challenge: Relevance emphasizes the aboutness of a result to a query, while utility refers to the result’s usefulness or value to an information seeker.
Approach: They propose an Iterative utiliTy judgmEnt fraMework to promote each step in Retrieval-Augmented Generation (RAG) they propose to use relevance ranking, utility judgments, and answer generation to prioritize high-utility results over low-utilitity results.
Outcome: The proposed framework improves relevance, ranking, and answer generation on retrieval (TREC DL, WebAP), utility judgment task (GTI-NQ), and factoid question-answering (NQ) datasets.
Nested Event Extraction upon Pivot Element Recognition (2024.lrec-main)

Copied to clipboard

Challenge: Nested Event Extraction (NEE) aims to extract complex event structures where an event contains other events as its arguments recursively.
Approach: They propose a new model that extracts nested events mainly based on recognizing PEs.
Outcome: The proposed model can extract nested events based on recognizing PEs . it incorporates information from both event types and argument roles to improve performance .
Text2Sql: Pure Fine-Tuning and Pure Knowledge Distillation (2025.naacl-industry)

Copied to clipboard

Challenge: Text2Sql is a task that translates natural language questions and database schemas into SQL queries.
Approach: They employ pure fine-tuning strategy to reduce redundancy by using only 53% of the baseline prompt length to fine- tune the model.
Outcome: The model outperforms the baseline model by 8.2% and 8.6% in Test-suite accuracy (TS) and exact-set-match accuracy (EM) under the most refined Spider dev set of prompts, the model achieves 73.5% and 75.4%, respectively, approaching state-of-the-art (SOTA) levels.
A Generative Framework for Personalized Sticker Retrieval (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing relevance-based generative retrieval methods lack personalization, leading to a mismatch between diverse user expectations and the retrieved results.
Approach: They propose a representation learning model that learns discriminative user representations to encode user-specific sticker preferences.
Outcome: The proposed framework outperforms state-of-the-art methods in generating relevant stickers for queries.
Semantic Structure Enhanced Event Causality Identification (2023.acl-long)

Copied to clipboard

Challenge: Existing methods for Event Causality Identification (ECI) capture implicit associations between events, which are difficult because they lack the ability to understand the associations between two events.
Approach: They propose a model that captures the implicit associations between two events and integrates the event-centric structure information into a GNN-based event aggregator.
Outcome: The proposed model improves on three widely used datasets showing that it integrates event-centric and event-associated semantic elements and captures event associations.
Towards Event Extraction with Massive Types: LLM-based Collaborative Annotation and Partitioning Extraction (2025.emnlp-main)

Copied to clipboard

Challenge: Event Extraction (EE) is a long-standing target, but lacks an efficient and effective annotation framework to construct the corresponding datasets.
Approach: They propose an LLM-based collaborative annotation framework that refines annotations of triggers from distant supervision and carries out argument annotation.
Outcome: The proposed framework outperforms state-of-the-art methods on the largest EE dataset to date . it achieves the F1 scores of 90% and 85.3% on the human-annotated test set .
Modeling Human-Like Cognition for Stance Detection: Integrating Intuitive Judgment and Analytical Reasoning (2026.acl-long)

Copied to clipboard

Challenge: Recent advances in large language models (LLMs) have revolutionized stance detection, enabling complex reasoning strategies such as chain-of-thought prompting.
Approach: They propose Cognitive-Driven Stance Detection (CDSD) that integrates fast intuitive judgment and analytical reasoning enhanced by three key modules: attention-based cognitive alignment to compare system focus, uncertainty-aware belief update using Bayesian inference, and self-doubt-triggered counterfactual reasoning for re-evaluation under low consistency or high uncertainty.
Outcome: The proposed method outperforms state-of-the-art methods on SEM16, P-Stance, and VAST.
G2S: A General-to-Specific Learning Framework for Temporal Knowledge Graph Forecasting with Large Language Models (2025.findings-acl)

Copied to clipboard

Challenge: Recent studies have introduced Large Language Models (LLMs) for this task to enhance the models’ generalization abilities.
Approach: They propose a General-to-Specific learning framework that disentangles the learning processes of two kinds of knowledge in a temporal temporal structure.
Outcome: The proposed framework disentangles the learning processes of the above two kinds of knowledge and improves their generalization abilities.
Stop Hardening Everything: A Training-Free Neuron-Level Defense for Neural Ranking Models (2026.acl-long)

Copied to clipboard

Challenge: Existing defenses for neural ranking models are data-centric and require retraining and adversarial data generation.
Approach: They propose a model-centric defense that addresses vulnerability at its architectural source without costly retraining or adversarial data generation.
Outcome: The proposed approach outperforms state-of-the-art models on MS MARCO and TREC 19 while maintaining strong performance on clean data.
Learning to Control the Specificity in Neural Response Generation (P18-1)

Copied to clipboard

Challenge: Existing generative conversational models tend to favor general and trivial responses which appear frequently.
Approach: They propose a controlled response generation mechanism to handle different utterance-response relationships in terms of specificity.
Outcome: The proposed model outperforms state-of-the-art models under automatic and human evaluations.
Beyond Dialogue Time: Temporal Semantic Memory for Personalized LLM Agents (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods focus on point-wise memory, losing durative information that captures persistent states and evolving patterns.
Approach: They propose a memory framework that models semantic time for point-wise memory and supports the construction and utilization of durative memory.
Outcome: Experiments on LongMemEval and LoCoMo show that the proposed method outperforms existing methods and achieves up to 12.2% improvement in accuracy.
Integrating Deep Event-Level and Script-Level Information for Script Event Prediction (2021.emnlp-main)

Copied to clipboard

Challenge: Existing studies only consider a single event sequence corresponding to one common protagonist.
Approach: They propose a Transformer-based model which integrates deep event-level and script-level information for script event prediction.
Outcome: The proposed model is superior to existing models on the New York Times corpus . it utilizes rich information in the text to obtain more comprehensive representations .
Class-Incremental Few-Shot Event Detection (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods to deal with new class of events with only a few labeled instances are challenging . old knowledge forgetting and new class overfitting are two problems in this task.
Approach: They propose a task called class-incremental few-shot event detection to solve old knowledge forgetting and new class overfitting problems.
Outcome: The proposed method reduces old knowledge forgetting and new class overfitting problems on two benchmark datasets.
Large Language Model-Based Event Relation Extraction with Rationales (2025.coling-main)

Copied to clipboard

Challenge: Existing methods for ERE rely on large language models, but they face limitations.
Approach: They propose an LLM-based approach with rationales for the ERE task . LLMERE transforms ERE into a question-and-answer task that may have multiple answers .
Outcome: Experimental results show that LLMERE improves over existing methods.
Visual Named Entity Linking: A New Dataset and A Baseline (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing tasks in Visual Entity Linking (VEL) rely on textual data to complement multi-modal linking or only link objects with general entities.
Approach: They propose a task to link regions of images with corresponding entities in Knowledge Bases . they propose three sub-tasks, based on a human-annotated visual person dataset .
Outcome: The proposed task is based on a human-annotated visual person linking dataset . the proposed sub-tasks are validated on the WIKIPerson dataset based upon the proposed methods .
Self-Critique Guided Iterative Reasoning for Multi-hop Question Answering (2025.findings-acl)

Copied to clipboard

Challenge: Large language models (LLMs) have demonstrated remarkable reasoning capabilities, but they still face challenges in knowledge-intensive multi-hop reasoning.
Approach: They propose a method that uses self-critique feedback to guide iterative reasoning by enabling iteration and self-evaluation of its intermediate reasoning steps.
Outcome: The proposed method surpasses the previous SOTA by 8.6% on three multi-hop reasoning datasets.
Beyond Language: Learning Commonsense from Images for Reasoning (2020.findings-emnlp)

Copied to clipboard

Challenge: Existing commonsense reasoning methods use raw texts to perform data representation and answer prediction tasks.
Approach: They propose a novel approach to learn commonsense from images instead of limited raw texts or costly knowledge bases.
Outcome: The proposed approach outperforms language-based methods on commonsense reasoning problems on two commonsence reasoning problems.
Inductive Link Prediction in N-ary Knowledge Graphs (2025.coling-main)

Copied to clipboard

Challenge: Existing methods to predict missing elements in NKGs are fixed and therefore cannot be used in real-world situations.
Approach: They propose a task to predict missing elements in unseen facts involving unseent entities and roles in emerging NKGs by embedding unseense entities and role-encoding neural networks.
Outcome: The proposed task outperforms representative models across all datasets.
Bootstrapped Pre-training with Dynamic Identifier Prediction for Generative Retrieval (2024.findings-acl)

Copied to clipboard

Challenge: Existing methods for document retrieval rely on static document identifiers . experimental results show that generative retrieval is outperforms dense retrieval in document retrievals.
Approach: They propose a bootstrapped pre-training method that dynamically adjusts document identifiers during pre-train to accommodate the continuing memorization of the corpus.
Outcome: The proposed method significantly outperforms existing pre-training generative retrieval baselines and performs well even in zero-shot settings.
MetaSLRCL: A Self-Adaptive Learning Rate and Curriculum Learning Based Framework for Few-Shot Text Classification (2022.coling-1)

Copied to clipboard

Challenge: Existing few-shot text classification methods lack labeled data in many scenarios.
Approach: They propose a meta learning framework that obtains different learning rates for different tasks and neural network layers to enable the meta learner to quickly adapt to new training data.
Outcome: The proposed framework can obtain different learning rates for different tasks and neural network layers so as to enable the meta learner to quickly adapt to new tasks.
RoCEL: Advancing Table Entity Linking through Distinctive Row and Column Contexts (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods for table entity linking ignore row and column contexts . existing methods for TEL focus on understanding sequential text contexts, making it difficult to adapt to the row and columns structure of tables.
Approach: They propose to leverage row and column contexts to enhance the semantics of mentions in entity disambiguation.
Outcome: The proposed method outperforms the state-of-the-art (SOTA) baseline by 1.5% on the in-domain dataset and 3.7% on average across three out-of domain datasets.
When Do LLMs Need Retrieval Augmentation? Mitigating LLMs’ Overconfidence Helps Retrieval Augmentation (2024.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) have difficulty knowing they do not possess certain knowledge and tend to provide specious answers in such cases.
Approach: They propose to use Retrieval Augmentation to enhance LLMs' ability to perceive their knowledge boundaries to reduce overconfidence.
Outcome: The proposed methods reduce overconfidence and improve accuracy in large language models with fewer retrieval calls.
Pretraining Data Detection for Large Language Models: A Divergence-based Calibration Method (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods to detect text in training corpus are limited due to their low token probabilities.
Approach: They propose a method to calibrate token probabilities for pretraining data detection by using a divergence-based calibration method.
Outcome: The proposed method significantly outperforms existing methods on Chinese text on English-language benchmarks and patents.
Beyond the Crowd: LLM-Augmented Community Notes for Governing Health Misinformation (2026.acl-long)

Copied to clipboard

Challenge: X (formerly Twitter) users can flag misleading posts, attach contextual notes, and rate the notes’ helpfulness, but there is a significant latency in Community Notes, which is unable to provide accurate notes.
Approach: They propose a framework that augments Community Notes for faster and more reliable health misinformation governance.
Outcome: The proposed framework outperforms human contributors in correctness, helpfulness, and evidence utility in health misinformation surges.
A Dual-Channel Framework for Sarcasm Recognition by Detecting Sentiment Conflict (2022.findings-naacl)

Copied to clipboard

Challenge: Sarcasm employs ambivalence, where one says something positive but actually means negative . linguistically, it is difficult to recognize such sentiment conflict because the sentiments are mixed or even implicit .
Approach: They propose a Dual-Channel Framework to model literal and implied sentiments separately . they propose sarcastic networks that can detect sarcasm sentiments in political debates .
Outcome: The proposed framework achieves state-of-the-art on political debates and Twitter datasets.
A Survey of Link Prediction in N-ary Knowledge Graphs (2025.emnlp-main)

Copied to clipboard

Challenge: N-ary Knowledge Graphs (NKGs) capture n-ary facts containing more than two entities.
Approach: They present the first comprehensive survey of link prediction in NKGs . they provide an overview of the field and analyze their performance and application scenarios .
Outcome: The proposed methods provide an overview of the field and analyze performance and application scenarios.
MORE: Multi-mOdal REtrieval Augmented Generative Commonsense Reasoning (2024.findings-acl)

Copied to clipboard

Challenge: Language Models (LLMs) have gained increasing prominence in artificial intelligence, especially Large Language Model (LLm) due to the well-recognized reporting bias, the recording of commonsense information is significantly less than its existence in reality.
Approach: They propose a Multi-mOdal REtrieval framework to leverage both text and images to enhance commonsense ability of language models.
Outcome: The proposed framework can leverage both text and images to enhance commonsense ability of language models.
Utility-Focused LLM Annotation for Retrieval and Retrieval-Augmented Generation (2025.emnlp-main)

Copied to clipboard

Challenge: Existing studies on large language models for document utility annotations have shown that they improve retrieval performance and RAG outcomes compared to models trained on human annotations.
Approach: They propose a model that maximizes their summed marginal likelihood to annotate document utility on multiple positive samples per query.
Outcome: The proposed model maximizes the marginal likelihood of multiple positive samples per query.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations