Papers by Zhiqiang Liu

40 papers
MaPPER: Multimodal Prior-guided Parameter Efficient Tuning for Referring Expression Comprehension (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods for Referring Expression Comprehension (REC) lack specific domain abilities for precise local visual perception and visual-language alignment.
Approach: They propose a framework for Parameter-Efficient Transfer Learning to localize a visual region via natural language using a prior-guided prior.
Outcome: The proposed framework achieves the best accuracy compared to the current methods with only 1.41% tunable backbone parameters.
Continual Few-shot Event Detection via Hierarchical Augmentation Networks (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods for continual few-shot event detection use labeled data, but in real-world applications, new event types emerge continually.
Approach: They propose a memory-based framework for continual few-shot event detection . they incorporate prototypical augmentation into the memory set to memorize previous event types .
Outcome: The proposed method outperforms existing methods in multiple continual few-shot event detection tasks.
RTQA : Recursive Thinking for Complex Temporal Knowledge Graph Question Answering with Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Current temporal knowledge graph question answering methods focus on implicit temporal constraints and lack the capability to handle complex temporal queries.
Approach: They propose a temporal knowledge graph question answering framework that recursively decomposes questions into sub-problems and employs multi-path answer aggregation to improve fault tolerance.
Outcome: The proposed framework outperforms existing methods on multiTQ and TimelineKGQA benchmarks.
“What is the value of templates?” Rethinking Document Information Extraction Datasets for LLMs (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing work on prompt-response datasets for visually rich document understanding (VRDU) is labor-intensive.
Approach: They propose a set of questions that are transformed from a key information extraction template to a prompt-response format using a plethora of bespoke templates.
Outcome: The proposed datasets are compared with baseline models on K2Q with zero-shot prompting.
DocLLM: A Layout-Aware Generative Language Model for Multimodal Document Understanding (2024.acl-long)

Copied to clipboard

Challenge: Documents with rich layouts are a significant portion of enterprise corpora and document AI is still a challenge.
Approach: They propose a lightweight extension to traditional large language models for reasoning over visual documents that takes into account both textual semantics and spatial layout.
Outcome: The proposed model outperforms existing large language models on 14 out of 16 datasets and generalizes well to 4 out of 5 previously unseen datasets.
SKA-Bench: A Fine-Grained Benchmark for Evaluating Structured Knowledge Understanding of LLMs (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing evaluations for Structured Knowledge (SK) understanding are non-rigorous and focus on a single type of SK.
Approach: They propose a structured knowledge understanding benchmark that includes four widely used structured knowledge forms.
Outcome: The proposed benchmark is based on four widely used structured knowledge forms . it includes a question, an answer, positive knowledge units, and noisy knowledge units .
Temp-R1: A Unified Autonomous Agent for Complex Temporal KGQA via Reverse Curriculum Reinforcement Learning (2026.acl-long)

Copied to clipboard

Challenge: Existing methods rely on fixed workflows and expensive closed-source APIs, limiting flexibility and scalability.
Approach: They propose a temporal reasoning agent that trains on difficult questions first . they expand the action space with specialized internal actions alongside external action .
Outcome: The proposed agent improves 19.8% over baselines on complex questions and multi-tasks.
Knowledge-augmented Financial Market Analysis and Report Generation (2024.emnlp-industry)

Copied to clipboard

Challenge: Existing methods to generate financial market analysis text require extensive financial knowledge and skill of financial analysts.
Approach: They propose a task to generate financial market analysis reports using financial market data using a financial knowledge graph.
Outcome: The proposed framework outperforms large-scale language models and retrieval-augmented baselines in the financial market analysis generation task.
Learning to Plan for Retrieval-Augmented Large Language Models from Knowledge Graphs (2024.findings-emnlp)

Copied to clipboard

Challenge: Recent studies have attempted to enhance the performance of large language models (LLMs) in complex question-answering (QA) tasks by combining step-wise planning with external retrieval.
Approach: They propose a framework for enhancing LLMs’ planning capabilities by using planning data derived from knowledge graphs (KGs).
Outcome: The proposed framework improves LLMs’ planning capabilities by using knowledge graphs (KGs) the proposed framework is compared with existing frameworks on multiple datasets and shows that it is effective for large language models.
Rhetorically Controlled Encoder-Decoder for Modern Chinese Poetry Generation (P19-1)

Copied to clipboard

Challenge: Rhetoric is a vital element in modern Chinese poetry, and plays an essential role in improving its aesthetics. however, to date, it has not been considered in research on automatic poetry generation.
Approach: They propose a rhetorically controlled encoder-decoder for modern Chinese poetry generation . their model captures various rhetorical patterns in an encoder and incorporates mixtures .
Outcome: The proposed model outperforms state-of-the-art methods in terms of fluency, coherence, meaningfulness, and rhetorical aesthetics.
Collaboration of Fusion and Independence: Hypercomplex-driven Robust Multi-Modal Knowledge Graph Completion (2026.acl-long)

Copied to clipboard

Challenge: Existing multi-modal knowledge graphs lack modality-specific information and are limited in their ability to capture nuanced semantic interplay between modalities.
Approach: They propose a multi-modal knowledge graph completion method which integrates both paradigms . they use a fine-grained Entity Representation Factorization module and a Robust Relation-aware Modality Fusion module to obtain robust representations for three independent modalities and one fused modality.
Outcome: The proposed method achieves coexistence and collaboration of fused and independent modality representations while maintaining modality-specific information.
CRAB: Cross-environment Agent Benchmark for Multimodal Language Model Agents (2025.findings-acl)

Copied to clipboard

Challenge: Existing benchmarks for MLM agents in interactive environments are limited by their focus on a single environment, lack of detailed and generalized evaluation methods, and the complexity of constructing tasks and evaluators.
Approach: They propose a cross-environment agent benchmark framework that integrates graph-based evaluation and task generation methods.
Outcome: The proposed framework supports multiple devices and can be easily extended to any environment with a Python interface.
ExStrucTiny: A Benchmark for Schema-Variable Structured Information Extraction from Document Images (2026.eacl-long)

Copied to clipboard

Challenge: Existing models for structured information extraction are limited by narrow entity ontologies, simple queries, or homogeneous document types.
Approach: They propose a benchmark dataset for structured Information Extraction (IE) from document images . they analyze open and closed VLMs on this benchmark .
Outcome: The proposed model can perform fine-grained structured extraction across document types and schemas.
ASTRA: Adaptive Semantic Tree Reasoning Architecture for Complex Table Question Answering (2026.acl-long)

Copied to clipboard

Challenge: Existing serialization methods fail to capture explicit hierarchies and lack schema flexibility . Existing tree-based approaches suffer from limited semantic adaptability .
Approach: They propose a method that leverages the global semantic awareness of LLMs to reconstruct tables into Logical Semantic Trees.
Outcome: The proposed method achieves state-of-the-art (SOTA) performance on complex table benchmarks.
Enhancing Character-Level Understanding in LLMs through Token Internal Structure Learning (2025.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) use tokenization methods but often obscure internal character structures within tokens.
Approach: They propose a method that improves models’ ability to capture character positions within tokens by training them on reverse character prediction tasks using the tokenizer’s vocabulary.
Outcome: Experiments show that the proposed method improves position prediction accuracy in large language models, enabling more precise identification of target characters in original text.
Are ChatGPT and GPT-4 General-Purpose Solvers for Financial Text Analytics? A Study on Several Typical Tasks (2023.emnlp-industry)

Copied to clipboard

Challenge: Recent large language models such as ChatGPT and GPT-4 have shown exceptional capabilities of generalist models . however, their applicability and effectiveness in specific domains like finance needs a better understanding .
Approach: They conduct empirical studies to compare the performance of ChatGPT and GPT-4 on financial text analytical problems using eight benchmark datasets from five categories of tasks.
Outcome: The proposed models outperform the state-of-the-art models on a wide range of financial text analytical tasks.
What’s Missing in Screen-to-Action? Towards a UI-in-the-Loop Paradigm for Multimodal GUI Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Existing GUI reasoning methods rely on direct screen-based decision-making, which lacks interpretability and overlooks a comprehensive understanding of UI elements, ultimately leading to task failure.
Approach: They propose a GUI reasoning paradigm that treats the GUI reasoning task as a cyclic ***Screen-UI elements-Action** process.
Outcome: The proposed paradigm achieves state-of-the-art UI understanding performance while yielding superior results in GUI reasoning tasks.
Fine-Tuning Language Models with Differential Privacy through Adaptive Noise Allocation (2024.findings-emnlp)

Copied to clipboard

Challenge: Language models can memorize detailed information and patterns, but raise privacy concerns . ANADP reduces the performance gap between regular and DP fine-tuning while maintaining the privacy constraints.
Approach: They propose an algorithm that allocates additive noise based on the importance of model parameters to reduce the performance gap between regular fine-tuning and traditional DP fine- tuning.
Outcome: The proposed algorithm narrows the performance gap between regular fine-tuning and traditional DP fine- tuning while maintaining privacy constraints.
All That Glitters is Not Gold: Improving Robust Retrieval-Augmented Language Models with Fact-Centric Preference Alignment (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods to learn adaptive retrieval for noisy documents lack prior filtering and may lead to the loss of crucial information.
Approach: They propose a method to improve retrieval performance without prior filtering . they use LLMs self-generated synthetic data as training data without manual annotation .
Outcome: The proposed method performs positive document mining based on factual consistency and uses LLMs self-generated synthetic data as training data without manual annotation.
LLMSurgeon: Diagnosing Data Mixture of Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: a lack of transparency in large language models makes auditing their "digital DNA" difficult.
Approach: They propose a framework that casts DMS as an inverse problem under label-shift assumption . they propose LLMScan, a recipe-verifiable evaluation suite built from open-source LLMs .
Outcome: The proposed framework casts DMS as an inverse problem under label-shift assumption . compared with existing frameworks, it recovers domain mixtures with high fidelity .
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.
Math-LLaVA: Bootstrapping Mathematical Reasoning for Multimodal Large Language Models (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing image instruction fine-tuning datasets do not fully exploit visual information to enhance multimodal reasoning capabilities of Large language models (LLMs).
Approach: They propose a LLaVA-based model fine-tuned with MathV360K to bridge this gap by collecting 40K high-quality images with question-answer pairs from 24 existing datasets and synthesizing 320K new pairs.
Outcome: The proposed model improves the multimodal reasoning capabilities of LLaVA-1.5 and demonstrates enhanced generalizability on the MMMU benchmark.
CoCoLex: Confidence-guided Copy-based Decoding for Grounded Legal Text Generation (2025.acl-long)

Copied to clipboard

Challenge: LLMs can provide key benefits to the Legal domain, but their adoption has been hindered by their tendency to generate unfaithful, ungrounded, or hallucinatory outputs.
Approach: They propose a Confidence-guided copy-based decoding strategy that dynamically interpolates the model produced vocabulary distribution with a distribution derived based on copying from the context.
Outcome: The proposed method outperforms existing context-aware decoding methods on five legal benchmarks.
Judge and Improve: Towards a Better Reasoning of Knowledge Graphs with Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Existing approaches to integrating graph and language models face two key limitations: achieving robust semantic alignment and ensuring interpretability in outputs.
Approach: They propose a framework to integrate graph and language modalities while enhancing transparency.
Outcome: Extensive experiments on three benchmark datasets show that the proposed framework surpasses existing methods in efficiency and generates outputs that are significantly more interpretable.
Visual Question Decomposition on Multimodal Large Language Models (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for question decomposition focus on unimodal language models, but question decomposing capability of Multimodal Large Language Models (MLLMs) has yet to be explored.
Approach: They propose a finetuning dataset and a training objective for selective decomposition to enhance the model's question decomposing capability.
Outcome: The proposed dataset shows that existing models struggle to produce high-quality sub-questions.
Optimal Expert-Attention Allocation in Mixture-of-Experts: A Scalable Law for Dynamic Model Design (2026.acl-industry)

Copied to clipboard

Challenge: a novel extension of neural scaling laws to Mixture-of-Experts models is proposed . a ratio of expert-attention compute is crucial for efficient MoE models .
Approach: They propose an extension of neural scaling laws to Mixture-of-Experts (MoE) models . they define the ratio r as the fraction of total FLOPs per token dedicated to expert and attention layers .
Outcome: The proposed model can be tuned beyond size and data with the proposed model.
The State of the Art of Large Language Models on Chartered Financial Analyst Exams (2024.emnlp-industry)

Copied to clipboard

Challenge: Chartered Financial Analyst (CFA) program is widely recognized globally . study compares state-of-the-art large language models with open-source models . proprietary models pass levels I and II, but fail at level III due to essay questions .
Approach: They benchmark five leading proprietary models and eight open-source models on mock CFA exams to provide an overview of their financial analysis capabilities.
Outcome: The models on the mock CFA exams pass the highest scores, but fail at the lowest levels due to essay questions.
Beyond Completion: A Foundation Model for General Knowledge Graph Reasoning (2025.findings-acl)

Copied to clipboard

Challenge: Existing foundation models for general knowledge graph reasoning have focused on their structural aspects, with most efforts restricted to in-KG tasks.
Approach: They propose a conditional encoding architecture that bridges the gap between textual and structural modalities, enabling seamless integration.
Outcome: The proposed model outperforms baseline models on 28 datasets and is generalized to out-of-KG tasks.
Text Classification by Contrastive Learning and Cross-lingual Data Augmentation for Alzheimer’s Disease Detection (2020.coling-main)

Copied to clipboard

Challenge: Existing methods for AD detection are too expensive and time-consuming to cover all potential patients.
Approach: They propose a contrastive learning method to obtain effective text representations based on monolingual embeddings of BERT and a cross-lingual data augmentation method by building autoencoders to learn the text representation shared by both languages.
Outcome: The proposed method outperforms other methods on a Mandarin AD corpus and achieves 81.6% detection accuracy.
LCAN: A Label-Aware Contrastive Attention Network for Multi-Intent Recognition and Slot Filling in Task-Oriented Dialogue Systems (2025.findings-emnlp)

Copied to clipboard

Challenge: Multi-intent utterances processing remains a persistent challenge due to intricate intent-slot dependencies and semantic ambiguities.
Approach: They propose a label-aware contrastive attention network (LCAN) that integrates label-based attention and contrastive learning strategies to improve semantic understanding and generalization in multi-intent scenarios.
Outcome: The proposed model improves intent recognition and slot filling performance in multi-intent dialogue systems.
Zero-Shot Cross-Lingual Document-Level Event Causality Identification with Heterogeneous Graph Contrastive Transfer Learning (2024.lrec-main)

Copied to clipboard

Challenge: Existing studies focus on sentence-level ECI with high-resource languages, leaving document-level DECI with low-resourced languages under-explored.
Approach: They propose a Heterogeneous Graph Interaction Model with Multi-granularity Contrastive Transfer Learning for zero-shot cross-lingual ECI.
Outcome: The proposed model outperforms the state-of-the-art model on monolingual and multilingual scenarios by 9.4% and 8.2% of average F1 score.
SeaLLMs - Large Language Models for Southeast Asia (2024.acl-demos)

Copied to clipboard

Challenge: Existing large language models favor high-resource languages, such as English, at the expense of low-resourced and regional languages.
Approach: They propose a series of language models that specifically focuses on Southeast Asian languages.
Outcome: SeaLLM models outperform ChatGPT-3.5 in non-Latin languages by large margins . linguistic disparity impedes access to state-of-the-art AI technologies for non-English-speaking populations .
Enrich-on-Graph: Query-Graph Alignment for Complex Reasoning with LLM Enriching (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods employ resource-intensive, non-scalable workflows reasoning on vanilla KGs, but overlook this gap.
Approach: They propose a flexible framework that leverages LLMs’ prior knowledge to enrich KGs and bridge the semantic gap between queries and graphs.
Outcome: The proposed framework bridges the semantic gap between structured knowledge graphs and unstructured queries while ensuring low computational costs, scalability, and adaptability across different methods.
Knowledge Graph Pooling and Unpooling for Concept Abstraction (2025.coling-main)

Copied to clipboard

Challenge: Knowledge graph embedding (KGE) aims to embed entities and relations as vectors in a continuous space.
Approach: They propose a framework with KG Pooling and unpooling and Contrastive Learning to abstract and encode latent concepts for better KG prediction.
Outcome: The proposed framework outperforms baselines on link prediction task.
Croppable Knowledge Graph Embedding (2025.acl-long)

Copied to clipboard

Challenge: Knowledge Graph Embedding (KGE) is a common approach for Knowledge Grasse (KGs) in AI tasks.
Approach: They propose a new KGE training framework MED that allows one training to obtain a croppable KGE model for multiple scenarios with different dimensional needs.
Outcome: The proposed framework improves low-dimensional sub-models and makes high-dimensional models retain the low-dimension sub-modells’ capacity.
Unlocking General Long Chain-of-Thought Reasoning Capabilities of Large Language Models via Representation Engineering (2025.acl-long)

Copied to clipboard

Challenge: Existing work finds that long CoT reasoning can be efficiently elicited by tuning on only a few examples and can easily transfer to other tasks.
Approach: They propose a representation engineering method to unleash the general long CoT reasoning capabilities of LLMs.
Outcome: The proposed method is effective in in-domain and cross-domain scenarios.
From Style to Story: A Curriculum Learning Approach for Imitative Novel Generation (2026.findings-acl)

Copied to clipboard

Challenge: Novels create rich, immersive worlds with intricate plots and distinct styles, captivating readers through complex storytelling.
Approach: They propose a novel generation system that imitates novel elements by predicting plot developments and writing concrete details using vivid, expressive language.
Outcome: The novel imitative novel generation system is trained through a curriculum learning paradigm, progressing from low-level stylistic mastery to high-level narrative coherence.
FinEval: A Chinese Financial Domain Knowledge Evaluation Benchmark for Large Language Models (2025.naacl-long)

Copied to clipboard

Challenge: Large language models have demonstrated outstanding performance in various natural language processing tasks, but their security capabilities in the financial domain have not been explored.
Approach: They propose to use a benchmark to evaluate large language models' financial domain knowledge and practical abilities.
Outcome: The proposed benchmark evaluates large language models' financial domain knowledge and practical abilities.
One Comment from One Perspective: An Effective Strategy for Enhancing Automatic Music Comment (2020.coling-main)

Copied to clipboard

Challenge: Existing methods for automatic comment generation generate common and meaningless comments for music.
Approach: They propose a multi-perspective strategy to enhance automatic music comment generation by combining different perspectives on a music comment dataset.
Outcome: The proposed model outperforms state-of-the-art models on two music comment datasets and outperformed existing models by a substantial margin.
Detecting Non-Membership in LLM Training Data via Rank Correlations (2026.eacl-long)

Copied to clipboard

Challenge: Large language models (LLMs) are trained on increasingly vast and opaque text corpora.
Approach: They propose a test that detects dataset-level non-membership using only grey-box access to model logits.
Outcome: The proposed test detects dataset-level non-membership using only grey-box access to model logits.

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