Papers by Ziheng Chen

14 papers
DISC: Plug-and-Play Decoding Intervention with Similarity of Characters for Chinese Spelling Check (2025.acl-long)

Copied to clipboard

Challenge: Chinese spelling check (CSC) tasks require that incorrect characters are usually similar to the correct ones in either phonetics or glyph.
Approach: They propose a plug-and-play decoding intervention with similarity of characters module for Chinese spelling check (CSC) they propose to incorporate phonetic and glyph similarities only during the inference phase.
Outcome: The proposed method significantly improves Chinese spelling check models on benchmarks and on benchmark datasets.
Mitigating Hallucinations of Large Language Models in Medical Information Extraction via Contrastive Decoding (2024.findings-emnlp)

Copied to clipboard

Challenge: Medical Information Extraction (MIE) tasks are a fundamental component of medical NLP.
Approach: They propose an alternative adaptive constraint strategy to adjust the scale and scope of contrastive tokens.
Outcome: The proposed approach selectively enhances the identification and classification capabilities while minimizing the influence of other inherent abilities in LLMs.
An Industry Evaluation of Embedding-based Entity Alignment (2020.coling-industry)

Copied to clipboard

Challenge: Knowledge graphs (KGs) are increasingly important in various applications such as question answering and search engines.
Approach: They propose to use a supervised learning environment with unbiased seed mappings for training and validation to evaluate alignment methods in an industrial context.
Outcome: The proposed methods are evaluated in an industrial context and are compared with DBpedia and Wikidata benchmarks.
Response-G1: Explicit Scene Graph Modeling for Proactive Streaming Video Understanding (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for streaming video understanding are query-agnostic and implicitly model video evidence.
Approach: They propose a framework that establishes explicit, structured alignment between the accumulated video evidence and the query’s expected response conditions via scene graphs.
Outcome: The proposed model achieves more interpretable and accurate response timing decisions on both proactive and reactive tasks.
OntoEA: Ontology-guided Entity Alignment via Joint Knowledge Graph Embedding (2021.findings-acl)

Copied to clipboard

Challenge: Existing methods for aligning knowledge graph entities ignore the ontology which contains critical meta information such as classes and membership relationships with entities.
Approach: They propose an ontology-guided method where KGs and ontologies are jointly embedded.
Outcome: Extensive experiments on seven public and industrial benchmarks show the ontology-guided method performs well and is cost-effective.
PRGC: Potential Relation and Global Correspondence Based Joint Relational Triple Extraction (2021.acl-long)

Copied to clipboard

Challenge: Recent methods for extracting entities and relations from unstructured texts suffer from limitations, such as redundancy of relation prediction and inefficiency.
Approach: They propose a joint relational triple extraction framework based on Potential Relation and Global Correspondence (PRGC) they propose overlapping triples for relation prediction and relation-relational alignment .
Outcome: The proposed framework achieves state-of-the-art performance on public benchmarks with higher efficiency and consistent performance gain on complex scenarios of overlapping triples.
HierDiffuse: Progressive Diffusion for Robust Interest Fusion in CTR Prediction (2025.emnlp-industry)

Copied to clipboard

Challenge: Existing approaches fuse long-term behavioral profiles and short-term interactions, suffering from representational misalignment and noise in transient signals.
Approach: They propose a framework that redefines interest fusion as a hierarchical denoising process through diffusion models.
Outcome: The proposed framework redefines interest fusion as a hierarchical denoising process through diffusion models.
AdaLoGN: Adaptive Logic Graph Network for Reasoning-Based Machine Reading Comprehension (2022.acl-long)

Copied to clipboard

Challenge: Existing methods and limitations for machine reading comprehension are insufficient for logical reasoning over text.
Approach: They propose a neural-symbolic approach which passes messages over a graph representing logical relations between text units to predict an answer.
Outcome: The proposed approach outperforms existing methods on ReClor and LogiQA.
Rapid Diffusion: Building Domain-Specific Text-to-Image Synthesizers with Fast Inference Speed (2023.acl-industry)

Copied to clipboard

Challenge: Text-to-Image Synthesis (TIS) aims to generate images based on textual inputs . but, current diffusion-based models lack entity knowledge and low inference speed .
Approach: They propose a framework for training and deploying latent diffusion models with rich entity knowledge injected and optimized networks.
Outcome: The proposed framework improves image quality and inference speed and can be used in industrial applications.
UniCorn: Towards Self-Improving Unified Multimodal Models through Self-Generated Supervision (2026.acl-long)

Copied to clipboard

Challenge: Unified Multimodal Models have achieved remarkable success in cross-modal comprehension, but a gap persists in their ability to translate internal knowledge into faithful and controllable synthesis.
Approach: They propose a self-improvement framework that partitions a single UMM into three collaborative roles: Proposer, Solver, and Judge.
Outcome: The proposed framework improves on TIIF, DPG, CompBench and UniCycle benchmarks.
A Mechanistic Perspective and Difficulty Metric for Unlearning (2026.findings-acl)

Copied to clipboard

Challenge: Existing studies show that machine unlearning success varies across samples . easy-to-unlearn samples are associated with shorter, shallower interactions . hard-to unlear rely on longer and deeper pathways closer to late-stage computation.
Approach: They propose a pre-unlearning metric that assigns each sample a continuous difficulty score . they show that CUD reliably separates intrinsically easy and hard samples .
Outcome: The proposed method reliably separates intrinsically easy and hard samples and remains stable across unlearning methods.
A Survey on Foundation Language Models for Single-cell Biology (2025.acl-long)

Copied to clipboard

Challenge: Existing single-cell foundation language models are based on pre-trained and large language models.
Approach: They review the development of single-cell foundation language models . they discuss data tokenization strategies and pre-training paradigms .
Outcome: The proposed models have shown remarkable performance in a variety of single-cell data analysis tasks.
EquiBench: Benchmarking Large Language Models’ Reasoning about Program Semantics via Equivalence Checking (2025.emnlp-main)

Copied to clipboard

Challenge: EquiBench is a new benchmark to evaluate large language models' ability to reason about program semantics . Unlike natural language, code is executable.
Approach: They propose a benchmark to evaluate large language models through equivalence checking . EquiBench consists of 2400 program pairs across four languages and six categories .
Outcome: The proposed benchmark consists of 2400 program pairs across four languages and six categories.
Multi-perspective Improvement of Knowledge Graph Completion with Large Language Models (2024.lrec-main)

Copied to clipboard

Challenge: Knowledge graph completion (KGC) is a widely used method to tackle incompleteness in knowledge graphs (KGs).
Approach: They propose a general framework to compensate for the deficiency of contextualized knowledge by querying large language models from various perspectives.
Outcome: The proposed framework improves knowledge graph completion (KGC) by querying large language models from various perspectives.

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