Papers by Jiawei Cao

13 papers
Learning In-context Learning for Named Entity Recognition (2023.acl-long)

Copied to clipboard

Challenge: Existing methods to recognize entities in text are limited by the diversity of entity types and the lack of high-quality annotations.
Approach: They propose an in-context learning-based NER approach that can inject in-const NER ability into PLMs and recognize entities of novel types on-the-fly using only a few demonstrative instances.
Outcome: The proposed method outperforms the PLMs+fine-tuning counterparts on 4 few-shot NER datasets and significantly outperformed the Plms+initialized extractors.
DisCal: Distribution-Aware Calibration for Mathematical Reasoning Under Character-Level Noisy Inputs (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for calibration of large reasoning models (LRMs) focus on clean inputs, leaving noise unexplored.
Approach: They propose a confidence calibration framework for character-level noisy inputs that extracts uncertainty signals from both the empirical answer distribution and the model’s predictive distribution and integrates them via a learned calibrator.
Outcome: Experiments on multiple mathematical reasoning benchmarks show that DisCal outperforms existing calibration methods under noisy inputs, reducing expected calibration error (ECE) by up to 39.21% and improving Area Under the Receiver Operating Characteristic Curve (AUROC) by 31.44%.
TokenPenalty: Alleviating Attention Sinks and Positional Decay in LVLMs (2026.findings-acl)

Copied to clipboard

Challenge: Multimodal large language models (MLLMs) often hallucinate due to two relevant phenomena: massive activation phenomenon and positional information decay.
Approach: They propose a token-level intervention strategy that dynamically suppresses irrelevant visual tokens while preserving key contextual signals.
Outcome: Experiments show that TokenTruth significantly improves factual consistency across MLLMs on standard image understanding benchmarks.
TriSum: Learning Summarization Ability from Large Language Models with Structured Rationale (2024.naacl-long)

Copied to clipboard

Challenge: Large language models (LLMs) have advanced tasks like text summarization, but their size and computational demands limit their use in resource-constrained and privacy-centric settings.
Approach: They propose a framework for distilling LLMs’ text summarization abilities into a compact, local model using a curriculum learning strategy that evolves from simple to complex tasks.
Outcome: The proposed framework outperforms baseline models on CNN/DailyMail, XSum, and ClinicalTrial, and improves interpretability by providing insights into the summarization rationale.
Retentive or Forgetful? Diving into the Knowledge Memorizing Mechanism of Language Models (2024.lrec-main)

Copied to clipboard

Challenge: Pre-trained language models have shown remarkable memory formation, but vanilla networks without pre-training suffer catastrophic forgetting problem.
Approach: They conduct experiments to investigate the retentive-forgetful contradiction between vanilla and pre-trained language models by controlling the target knowledge types, learning strategies and learning schedules.
Outcome: The results show that pre-trained language models are forgetful and pre-training leads to retentive models .
Toward Secure Tuning: Mitigating Security Risks from Instruction Fine-Tuning (2026.acl-long)

Copied to clipboard

Challenge: Instruction Fine-Tuning (IFT) has emerged as a critical technique for customizing Large Language Models (LLMs) however, recent studies have revealed that IFT can compromise the built-in security mechanisms of LLMs, posing significant security risks.
Approach: They propose a method that shifts learning burden onto security-robust parameters and propose 'warm-up' phase that preferentially trains Mods_Rob to learn low-level features with minimal security risk.
Outcome: The proposed method reduces security risks without sacrificing performance gains across knowledge-intensive datasets.
Recall and Learn: A Memory-augmented Solver for Math Word Problems (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for solving math word problems are based on template-based generation which results in limited generalization capability.
Approach: They propose a human-like analogical learning method for the math word problem . it uses modules of memory, representation, analogy, and reasoning to make a new exercise .
Outcome: The proposed method outperforms state-of-the-art models on two well-known datasets.
CriticLean: Critic-Guided Reinforcement Learning for Mathematical Formalization (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to formalizing mathematical statements face limitations in accuracy, especially in the context of complex, highlevel problems that involve sophisticated mathematical reasoning.
Approach: They propose a CriticLean framework that elevates the role of the critic from a passive validator to an active learning component and introduce a benchmark to measure models’ ability to distinguish semantically correct from incorrect formalizations.
Outcome: The proposed framework outperforms open- and closed-source benchmarks and shows that it significantly outperformed existing models.
When Rules Learn: A Self-Evolving Agent for Legal Case Retrieval (2026.findings-acl)

Copied to clipboard

Challenge: Existing dense retrieval methods have achieved notable progress, but their effectiveness in legal case retrieval remains limited.
Approach: They propose a self-evolving framework for rule-driven query rewriting that enhances BM25 without any parameter training.
Outcome: The proposed framework outperforms non-evolutionary baselines, including human-designed rules and greedy rule selection, especially when powered by a high-capacity core LLM.
Red Teaming Large Reasoning Models (2026.acl-long)

Copied to clipboard

Challenge: Large Reasoning Models (LRMs) have emerged as a powerful advancement in multi-step reasoning tasks, but they introduce safety and reliability risks, such as CoT-hijacking and prompt-induced inefficiencies.
Approach: They propose a unified benchmark to assess the trustworthiness of Large Reasoning Models.
Outcome: The proposed benchmark evaluates truthfulness, safety and efficiency on 26 models.
Shallow Focus, Deep Fixes: Enhancing Shallow Layers Vision Attention Sinks to Alleviate Hallucination in LVLMs (2025.emnlp-main)

Copied to clipboard

Challenge: Multimodal large language models (MLLMs) demonstrate excellent abilities for understanding visual information, but the hallucination remains a challenging problem.
Approach: They propose a training-free approach to enhance vision attention sinks to facilitate convergence of the image token attention sink within shallow layers.
Outcome: The proposed approach improves the convergence of the image token attention sink within shallow layers and strengthens the layer’s focus on the image itself.
Hyperlink-induced Pre-training for Passage Retrieval in Open-domain Question Answering (2022.acl-long)

Copied to clipboard

Challenge: Existing methods to train dense passage retrieval have a large data gap between upstream and downstream relevance.
Approach: They propose a method to pre-train the dense retriever with the text relevance induced by hyperlinks within Web documents.
Outcome: The proposed method outperforms existing methods under different scenarios and in the open-domain question answering domain.
Re3: Relevance & Recency Retrieval for Mitigating Temporal Hallucination (2026.acl-long)

Copied to clipboard

Challenge: Existing retrievers suffer from temporal-semantic misalignment and outdated-document interference . Existing frameworks suffer from both temporal validity and outdated factual versions .
Approach: They propose a framework that mitigates temporal hallucinations by embedding heterogeneous temporal signals into the semantic space to ensure retrieval fidelity.
Outcome: Experiments show that Re3 outperforms baselines by 9.7% in generation accuracy . the framework outperformed strongest baselines on challenging dynamic tasks .

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