Papers by Long Jin

27 papers
ASPO: Adaptive Sentence-Level Preference Optimization for Fine-Grained Multimodal Reasoning (2025.findings-acl)

Copied to clipboard

Challenge: Recent advances have extended DPO to multimodal scenarios, achieving strong performance.
Approach: They propose to use a sentence-level preference optimization technique to optimize individual sentences for more precise preference optimization without additional models or parameters.
Outcome: Experiments show that Adaptive Sentence-level Preference Optimization significantly improves the alignment of multimodal models.
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.
DRAE: Dynamic Retrieval-Augmented Expert Networks for Lifelong Learning and Task Adaptation in Robotics (2025.acl-long)

Copied to clipboard

Challenge: Experimental results show that Dynamic Retrieval-Augmented Expert Networks outperforms baseline approaches in long-term task retention and knowledge reuse.
Approach: They propose a dynamic routing architecture that leverages MoE and Retrieval-Augmented Generation to augment the learning process.
Outcome: The proposed architecture outperforms baseline approaches in long-term task retention and knowledge reuse.
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.
Rule-Aware Reinforcement Learning for Knowledge Graph Reasoning (2021.findings-acl)

Copied to clipboard

Challenge: Existing methods to reason missing facts on Knowledge Graphs face with serious incompleteness due to their black-box nature.
Approach: They propose a multi-hop reasoning method that injects high quality symbolic rules into the model's reasoning process and employs partially random beam search.
Outcome: The proposed method outperforms existing multi-hop reasoning methods in terms of Hit@1 and MRR.
Leveraging LLM Reasoning Enhances Personalized Recommender Systems (2024.findings-acl)

Copied to clipboard

Challenge: Recent advances have showcased the potential of Large Language Models (LLMs) in executing reasoning tasks, particularly facilitated by Chain-of-Thought (CoT) prompting.
Approach: They propose to use Large Language Models to perform tasks with subjectivity and personalized preferences as inputs to RecSys.
Outcome: The proposed framework aligns with real human judgment on the coherence and faithfulness of LLM reasoning responses.
Towards Fine-Grained and Multi-Granular Contrastive Language-Speech Pre-training (2026.acl-long)

Copied to clipboard

Challenge: Existing models for fine-grained speaking styles are limited in terms of accuracy, coverage, and naturalness.
Approach: They propose a model that pre-trains with coarse captions and annotates with a pipeline that grounds captions in audio.
Outcome: The proposed model outperforms existing models with fine-grained style annotations . it integrates global and fine-granular supervision, enabling unified representations based on the proposed model .
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.
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.
CRAFTQA: A Code-Driven Adaptive Framework for Complex Structured Data Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Existing unified structured data question answering methods rely on a set of predefined functions, which restricts their ability to perform complex reasoning beyond these predefined operations.
Approach: They propose a novel adaptive code-driven framework that generates code-based reasoning operations based on a question.
Outcome: The proposed framework improves on multiple structured datasets on real-world scenarios.
A New Pipeline for Knowledge Graph Reasoning Enhanced by Large Language Models Without Fine-Tuning (2024.emnlp-main)

Copied to clipboard

Challenge: Conventional knowledge Graph Reasoning models learn the embeddings of KG components over the structure of a KG.
Approach: They propose a pipeline to integrate knowledge from LLMs into KGs without fine-tuning . they propose knowledge alignment, KG reasoning and entity reranking to enhance conventional models .
Outcome: The proposed pipeline can enhance the performance of conventional KGR models in incomplete and general situations.
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.
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.
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 .
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 .
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.
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.
Taming the Real-world Complexities in CPT E/M Coding with Large Language Models (2025.emnlp-industry)

Copied to clipboard

Challenge: Evaluation and Management (E/M) coding is performed by physicians and trained human coders who review clinical encounter notes and electronic health record data to assign appropriate codes.
Approach: They propose a framework that automates evaluation and management coding tasks using the Current Procedural Terminology (CPT) taxonomy.
Outcome: The proposed framework achieves an increase in coding accuracy of more than 36% over a commercial CPT E/M coding system and almost 5% over our strongest single-prompt baseline.
RAP: Efficient Text-Video Retrieval with Sparse-and-Correlated Adapter (2024.findings-acl)

Copied to clipboard

Challenge: Text-Video Retrieval (TVR) aims to align relevant video content with natural language queries.
Approach: They propose to conduct efficient text-video Retrieval with a salient-and-correlated AdaPter . they propose a low-rank modulation module to refine per-image features from frozen CLIP backbone .
Outcome: Experiments on four TVR datasets show that the proposed method performs better than other methods.
HTCCN: Temporal Causal Convolutional Networks with Hawkes Process for Extrapolation Reasoning in Temporal Knowledge Graphs (2024.naacl-long)

Copied to clipboard

Challenge: Temporal knowledge graphs (TKGs) are powerful tools for storing and modeling dynamic facts.
Approach: They propose a Hawkes process-based temporal causal convolutional network for temporal reasoning under extrapolation settings.
Outcome: The proposed network is based on Hawkes process-based temporal causal convolutional network and captures the temporal evolution of facts.
CodecLM: Aligning Language Models with Tailored Synthetic Data (2024.findings-naacl)

Copied to clipboard

Challenge: Recent work on generating diverse instructions and applying LLM to increase instruction complexity neglects downstream use cases.
Approach: They propose a framework for generating high-quality synthetic data for LLM alignment with different downstream instruction distributions and LLMs.
Outcome: Experiments on four open-domain instruction using the proposed framework validate the effectiveness of CodecLM over the current state-of-the-art.

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