Papers by Ning Cheng
CollabKG: A Learnable Human-Machine-Cooperative Information Extraction Toolkit for (Event) Knowledge Graph Construction (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing IE tools lack multi-task support and automatic updates for KG and EKG construction. |
| Approach: | They propose a human-machine-cooperative IE toolkit for KG and EKG construction that unifies different IE subtasks and integrates LLMs as the assistant machine. |
| Outcome: | The proposed tool improves annotation quality, efficiency, and stability simultaneously. |
DLTKG: Denoising Logic-based Temporal Knowledge Graph Reasoning (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Current approaches to temporal knowledge representation face limited generalization to unseen facts and insufficient interpretability of reasoning processes. |
| Approach: | They propose a framework that uses a denoising diffusion process to complete reasoning tasks . they propose introducing a noise source and historical conditionguiding mechanism to improve interpretability . |
| Outcome: | The proposed framework outperforms state-of-the-art methods on three benchmark datasets. |
Dynamic Attention-Guided Context Decoding for Mitigating Context Faithfulness Hallucinations in Large Language Models (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods, such as a n-terminal coding, do not provide accurate data for large language models. |
| Approach: | They propose a lightweight framework that leverages attention distributions and uncertainty signals in a single-pass decoding. |
| Outcome: | Experiments on open-book QA datasets show that DAGCD improves faithfulness and robustness while preserving computational efficiency. |
Not All Modalities at Once: Dynamic Dropout and Bidirectional Fusion for Robust Multi-modal Knowledge Graph Completion (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing MKGC methods train with all modalities available, implicitly assuming consistent complementarity . however, this often induces modality dependence and modality competition under heterogeneous noise, which can hinder robust multi-modal fusion and limit overall performance. |
| Approach: | They propose a framework to infer missing links in multimodal knowledge graphs by leveraging structured triples together with auxiliary modalities such as text and images. |
| Outcome: | The proposed framework outperforms baselines and achieves new state-of-the-art results. |
Multi-Stage LLM Fine-Tuning with a Continual Learning Setting (2025.findings-naacl)
Copied to clipboard
Changhao Guan, Chao Huang, Hongliang Li, You Li, Ning Cheng, Zihe Liu, Yufeng Chen, Jinan Xu, Jian Liu
| Challenge: | Large language models (LLMs) have made significant progress in knowledge-intensive applications, but they may face a multi-stage continuous learning scenario. |
| Approach: | They propose a multi-stage continuous learning paradigm that includes a preference-based learning bias to identify potential knowledge conflicts and a self-distillation-based data augmentation strategy to expand and enrich the training corpus. |
| Outcome: | The proposed learning paradigm achieves a significant improvement in accuracy after 7 stages of fine-tuning compared to previous methods while preserving general knowledge. |
From Quantity to Quality: Boosting LLM Performance with Self-Guided Data Selection for Instruction Tuning (2024.naacl-long)
Copied to clipboard
Ming Li, Yong Zhang, Zhitao Li, Jiuhai Chen, Lichang Chen, Ning Cheng, Jianzong Wang, Tianyi Zhou, Jing Xiao
| Challenge: | Large Language Models (LLMs) have revolutionized the landscape of artificial intelligence. |
| Approach: | They propose a self-guided method to identify and select cherry samples from open-source datasets, minimizing manual curation and potential cost for instruction tuning an LLM. |
| Outcome: | The proposed method enables LLMs to identify discrepancies between expected responses and intrinsic generation capability, and a marked uptick in model training efficiency. |
Exploring the Impact of Model Scaling on Parameter-Efficient Tuning (2023.emnlp-main)
Copied to clipboard
Yusheng Su, Chi-Min Chan, Jiali Cheng, Yujia Qin, Yankai Lin, Shengding Hu, Zonghan Yang, Ning Ding, Xingzhi Sun, Guotong Xie, Zhiyuan Liu, Maosong Sun
| Challenge: | Parameter-efficient tuning (PET) methods can drive large pre-trained language models by training only minimal parameters. |
| Approach: | They propose a parameter-efficient tuning method that is compatible with a tunable module and uses a random number generator to optimize fewer table parameters. |
| Outcome: | The proposed method is compatible with a tunable module and tested on 11 NLP tasks. |
PRCA: Fitting Black-Box Large Language Models for Retrieval Question Answering via Pluggable Reward-Driven Contextual Adapter (2023.emnlp-main)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are too large to be fine-tuned with budget constraints and some are only accessible via APIs. |
| Approach: | They propose a pluggable Reward-Driven Contextual Adapter that integrates large language models as generators and trains them to refine the retrieved information. |
| Outcome: | The proposed method improves ReQA performance on three datasets by up to 20% compared to existing methods. |
Astra: Activation-Space Tail-Eigenvector Low-Rank Adaptation of Large Language Models (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for fine-tuning pre-trained models are limited due to suboptimal activation subspaces. |
| Approach: | They propose a method that leverages tail eigenvectors of model output activations to construct low-rank adapters. |
| Outcome: | The proposed method outperforms existing methods across 16 benchmarks and surpasses full fine-tuning in certain scenarios. |
The Right Time Matters: Data Arrangement Affects Zero-Shot Generalization in Instruction Tuning (2025.findings-acl)
Copied to clipboard
Bingxiang He, Ning Ding, Cheng Qian, Jia Deng, Ganqu Cui, Lifan Yuan, Haiwen Hong, Huan-ang Gao, Longtao Huang, Hui Xue, Huimin Chen, Zhiyuan Liu, Maosong Sun
| Challenge: | Existing work on instruction tuning has focused on task level, without considering that tasks are artificially defined and, to LLMs, merely consist of tokens and representations. |
| Approach: | They propose a training data arrangement framework that allows for continual learning and loss reduction. |
| Outcome: | The proposed framework promotes continual learning and loss reduction on unseen tasks. |
Superfiltering: Weak-to-Strong Data Filtering for Fast Instruction-Tuning (2024.acl-long)
Copied to clipboard
| Challenge: | Earlier studies of instruction tuning on Large Language Models focus on creating large, varied, and high-quality datasets with responses curated by human experts. |
| Approach: | They propose to use a smaller and weaker model to fine tune a larger and stronger model . they find it can largely speed up the data filtering and improve performance . |
| Outcome: | The proposed model can filter instruction data faster and better on benchmarks. |
UltraIF: Advancing Instruction Following from the Wild (2025.emnlp-main)
Copied to clipboard
| Challenge: | a lack of transparency has resulted in a gap between research community and leading companies . large language models have demonstrated remarkable capabilities in following complex instructions . |
| Approach: | They propose a method to build large language models that can follow complex instructions with open-source data. |
| Outcome: | The proposed approach can synergize complex instructions and filter responses with evaluation questions. |
Chain-of-Thought Compression Should Not Be Blind: V-Skip for Efficient Multimodal Reasoning via Dual-Path Anchoring (2026.acl-long)
Copied to clipboard
| Challenge: | Existing efforts to mitigate this via token compression fail due to its autoregressive nature . linguistically redundant tokens are erroneously pruned, leading to hallucinations . |
| Approach: | They propose a method that reformulates token pruning as a Visual-Anchored Information Bottleneck (VA-IB) optimization problem. |
| Outcome: | Experiments on Qwen2-VL and Llama-3.2 families show that the proposed model achieves a speedup with negligible accuracy loss. |
GRASP: Replace Redundant Layers with Adaptive Singular Parameters for Efficient Model Compression (2025.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies have demonstrated that many layers are functionally redundant in large language models (LLMs), enabling model compression by removing these layers to reduce inference cost. |
| Approach: | They propose a framework that removes redundant layers to reduce inference cost by preserving sensitivity-aware singular values. |
| Outcome: | The proposed framework outperforms existing methods in 90% of the original model under a 20% compression ratio. |
Critic Rule Induction: Improving Temporal Knowledge Graph Forecasting with Generator-Critic Language Models (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for predicting future facts from time-evolving graphs rely on statistical co-occurrences and extensive path enumeration. |
| Approach: | They propose a Critic-Guided Rule Induction method which treats temporal rules as rule hypotheses to be examined and adopts a decoupled Generation-Discrimination pipeline to induce rules that are high-coverage and high-precision. |
| Outcome: | The proposed method outperforms strong baselines on three benchmarks and achieves state-of-the-art performance. |