Papers by Qiang Zhou

34 papers
RiOT: Efficient Prompt Refinement with Residual Optimization Tree (2025.acl-long)

Copied to clipboard

Challenge: Existing methods for automatic prompt optimization face two challenges: lack of diversity and semantic drift.
Approach: They propose a framework for automatic prompt optimization that iteratively refines prompts through text gradients and selects the best prompt using perplexity.
Outcome: The proposed framework outperforms existing prompt optimization methods and manual prompting on commonsense, mathematical, logical, temporal, and semantic reasoning benchmarks.
Unified Thinker: A General Reasoning Core for Image Generation (2026.acl-long)

Copied to clipboard

Challenge: generative models struggle with logic-intensive instruction following, exposing a persistent reasoning–execution gap.
Approach: They propose a task-agnostic reasoning architecture for general image generation . they propose pixel-level feedback to ground the Thinker's policy in pixel feedback .
Outcome: The proposed system significantly improves image reasoning and generation quality.
Exploring Knowledge Filtering for Retrieval-Augmented Discriminative Tasks (2025.findings-acl)

Copied to clipboard

Challenge: Recent studies have focused on generative tasks, while its potential in discriminative tasks remains largely unexplored.
Approach: They propose a framework that incorporates knowledge filtering and prediction fusion mechanisms to improve model performance.
Outcome: The proposed framework improves model performance on discriminative tasks by filtering out harmful knowledge and integrating it into the input context.
ReCreate: Reasoning and Creating Domain Agents Driven by Experience (2026.acl-long)

Copied to clipboard

Challenge: Large Language Model (LLM) agents are reshaping the industrial landscape, but tasks differ widely, making them labor-intensive to build.
Approach: They propose an experience-driven framework for the automatic creation of domain agents . they leverage agent interaction histories to provide rich concrete signals on success or failure .
Outcome: The proposed framework outperforms human-designed agents and existing methods in experiments across diverse domains.
“Going on a vacation” takes longer than “Going for a walk”: A Study of Temporal Commonsense Understanding (D19-1)

Copied to clipboard

Challenge: a new study examines temporal commonsense and compares it to human performance on a dataset . a previous study focused on duration, frequency, stationarity and ordering, but not all aspects of temporal similarity have been studied.
Approach: They define five classes of temporal commonsense and use crowdsourcing to develop a new dataset that serves as a test set.
Outcome: The proposed dataset shows that the best current methods are far behind human performance by 20%.
LEAF: Towards Lightweight Explainable Hateful Video Detection via Self-Grounding CoT Guided Stage-Wise Distillation (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for detecting hateful videos rely on opaque models with no insight into their decisions.
Approach: They propose a lightweight, explainable video detection framework that distills "explainability" from LMMs into efficient Smaller Multimodal Models (SMMs) they use a self-grounded chain-of-thought mechanism to generate unbiased supervision signals for videos .
Outcome: The proposed framework outperforms existing methods in detection accuracy and explainability on three video benchmarks.
Harvesting Events from Multiple Sources: Towards a Cross-Document Event Extraction Paradigm (2024.findings-acl)

Copied to clipboard

Challenge: Document-level event extraction aims to extract structured information from unstructured text.
Approach: They propose a cross-document event extraction pipeline that integrates event information from multiple documents and provides a comprehensive perspective on events.
Outcome: The proposed pipeline achieves about 72% F1 in end-to-end cross-document event extraction, setting up a benchmark for future research.
Temporal Common Sense Acquisition with Minimal Supervision (2020.acl-main)

Copied to clipboard

Challenge: Temporal common sense is crucial for understanding natural language, but its acquisition is challenging . human annotation on such concepts is costly and often not made explicit in text .
Approach: They propose a method that exploits explicit and implicit mentions of temporal common sense to build a temporal similarity language model.
Outcome: The proposed model gives better predictions of various dimensions of temporal common sense than the standard BERT.
Revisiting the Self-Consistency Challenges in Multi-Choice Question Formats for Large Language Model Evaluation (2024.lrec-main)

Copied to clipboard

Challenge: Multi-choice questions (MCQs) are a common method for assessing the world knowledge of large language models.
Approach: They propose three knowledge-equivalent question variants to assess LLMs' world knowledge . they propose option position shuffle, option label replacement, and conversion to a True/False format .
Outcome: The proposed questions are shuffle, label replacement, and True/False format.
CARL: Constraint-Aware Reinforcement Learning for Planning with LLMs (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to constraint-aware planning fail to enhance the model’s intrinsic focus on constraints.
Approach: They propose a constraint-aware reinforcement learning framework that encourages constraint focus and penalizes neglect of LLMs.
Outcome: The proposed framework outperforms existing frameworks and state-of-the-art reasoning models in a number of real-world applications.
Temporal Reasoning on Implicit Events from Distant Supervision (2021.naacl-main)

Copied to clipboard

Challenge: a novel temporal reasoning dataset evaluates the degree to which systems understand implicit events . state-of-the-art models struggle when predicting temporal relationships between implicit and explicit events - a recent paper .
Approach: They propose a temporal reasoning dataset that evaluates the degree to which systems understand implicit events.
Outcome: The proposed model outperforms baseline systems on TRACIE by 5% and 11% on MATRES, an explicit event benchmark.
AnchorSeg: Language Grounded Query Banks for Reasoning Segmentation (2026.acl-long)

Copied to clipboard

Challenge: Existing models rely on a single segmentation token whose hidden state implicitly encodes both semantic reasoning and spatial localization . Existing methods rely only on SEG>, which encodes semantic reasoning, limiting the model's ability to explicitly disentangle what to segment from where to segment.
Approach: They propose a method which reformulates reasoning segmentation as a structured conditional generation process over image tokens conditioned on language grounded query banks.
Outcome: The proposed model bridges token-level predictions and pixel-level supervision by decoupling spatial grounding from semantic reasoning through structured language grounded query banks.
GAPO: Robust Advantage Estimation for Real-World Code LLMs (2026.findings-acl)

Copied to clipboard

Challenge: Reinforcement learning (RL) is widely used for post-training large language models (LLMs) in code editing, but in real-world code editing scenarios, reward distributions are often skewed with unpredictable noise, leading to distorted advantage computation and increased rollout outliers.
Approach: They propose a group-relative method that finds an interval with the highest SNR and uses the median of that interval as an adaptive Q to replace the group mean in advantage calculation.
Outcome: The proposed method improves on nine instruction-tuned LLMs while remaining plug-and-play and efficient.
Attention and Edge-Label Guided Graph Convolutional Networks for Named Entity Recognition (2022.emnlp-main)

Copied to clipboard

Challenge: Named entity recognition (NER) is the recognition of entities with specific meanings in the text, mainly including person, organization, location, etc.
Approach: They propose an edge-aware node joint update module and introduce a node-awful edge update module to explore hidden in structured information and solve the wrong dependency label information to some extent.
Outcome: The proposed model can exploit the structured information on the dependency tree to improve the recognition of long entities.
AAPO: Enhancing the Reasoning Capabilities of LLMs with Advantage Margin (2026.acl-long)

Copied to clipboard

Challenge: Reinforcement learning (RL) has emerged as an effective approach for enhancing the reasoning capabilities of large language models.
Approach: They propose an algorithm that optimizes cross-entropy loss using advantages enhanced through a margin-based estimation scheme.
Outcome: Experimental results show that AAPO improves group relative advantage estimation compared to other methods.
CogCompTime: A Tool for Understanding Time in Natural Language (D18-2)

Copied to clipboard

Challenge: Existing systems that extract temporal information from text can be useful for natural language understanding.
Approach: They propose a system that extracts temporal information from text and normalizes it to a standard format.
Outcome: The proposed system achieves state-of-the-art performance and incorporates the most recent progress.
DeepRTL2: A Versatile Model for RTL-Related Tasks (2025.findings-acl)

Copied to clipboard

Challenge: Integration of large language models into electronic design automation has been a key driver in eDA.
Approach: They propose a family of large language models that unifies generation- and embedding-based tasks related to RTL.
Outcome: The proposed model achieves state-of-the-art performance across all evaluated tasks.
A2ATS: Retrieval-Based KV Cache Reduction via Windowed Rotary Position Embedding and Query-Aware Vector Quantization (2025.findings-acl)

Copied to clipboard

Challenge: Long context large language models (LLMs) pose significant challenges for efficient serving due to the large memory footprint and high access overhead of KV cache.
Approach: They propose a retrieval-based method to reduce the memory footprint of LLMs . they propose Windowed Rotary Position Embedding and query-aware vector quantization .
Outcome: The proposed method can achieve lower performance degradation with lower overhead compared to existing methods . it can reduce the memory footprint and access overhead of long context large language models .
Skill-Based Few-Shot Selection for In-Context Learning (2023.emnlp-main)

Copied to clipboard

Challenge: Existing methods based on pre-trained embeddings can be easily biased by surface features that are not important for the target task.
Approach: They propose a skill-based few-shot selection method for in-context learning . it generates skill-specific descriptions for each test case and candidate example .
Outcome: The proposed method significantly outperforms existing methods in five cross-domain semantic parsing datasets and six backbone models.
Enhancing Cross-Document Event Coreference Resolution by Discourse Structure and Semantic Information (2024.lrec-main)

Copied to clipboard

Challenge: Existing cross-document event coreference resolution models lack the ability to capture long-distance dependencies.
Approach: They propose to construct document-level Rhetorical Structure Theory trees and cross-document Lexical Chains to model structural and semantic information of documents.
Outcome: The proposed model outperforms baseline models on English and Chinese datasets by large margins.
Evaluating Models’ Local Decision Boundaries via Contrast Sets (2020.findings-emnlp)

Copied to clipboard

Challenge: Standard test sets for supervised learning evaluate in-distribution generalization but are misleading when a dataset has systematic gaps.
Approach: They propose a more rigorous annotation paradigm for NLP that helps to close systematic gaps in the test data.
Outcome: The proposed model performs significantly lower on contrast sets than on the original test sets—up to 25% in some cases.
Answer Consolidation: Formulation and Benchmarking (2022.naacl-main)

Copied to clipboard

Challenge: Current question answering systems assume each question to have one correct answer.
Approach: They propose a problem where answers are partitioned into multiple groups . they construct a comprehensive and non-redundant set of answers by picking one answer from each group .
Outcome: The proposed model performs better than previous models, but it needs further improvements.
A Meta-framework for Spatiotemporal Quantity Extraction from Text (2022.acl-long)

Copied to clipboard

Challenge: a meta-framework for news events that extracts quantities from text is proposed . a previous work on news events focused on extracting event mentions, attributes, and relationships .
Approach: They propose a meta-framework for solving the NLP problem of spatiotemporal quantity extraction . they demonstrate the framework is general and extensible, and shareable crowdsourcing pipeline and baseline models are used .
Outcome: The proposed framework is general and extensible, the authors say . it can extract quantity from news streams, quickly respond to emergencies, investigate incidents .
Exploring Unified Training Framework for Multimodal User Profiling (2025.coling-main)

Copied to clipboard

Challenge: Recent studies on user profiling focus on extracting multiple aspects of user attributes from textual reviews, but these studies do not fully exploit the potential of the rich multimodal data at hand.
Approach: They propose a task that utilizes both review texts and their accompanying images to generate comprehensive user profiles.
Outcome: The proposed training framework incorporates historical review texts and images for user profile generation.
LEPO: Latent Reasoning Policy Optimization for Large Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing latent reasoning methods that use chain of thought (CoT) are limited to selecting one discrete token at each reasoning step, which potentially induces information loss.
Approach: They propose a framework that injects controllable stochasticity into latent reasoning via Gumbel-Softmax, restoring LLMs' exploratory capacity and enhancing their compatibility with Reinforcement Learning (RL).
Outcome: The proposed framework preserves richer information for more comprehensive reasoning and is compatible with Reinforcement Learning (RL).
Unleashing the Native Recommendation Potential: LLM-Based Generative Recommendation via Structured Term Identifiers (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for constructing item identifiers face bottlenecks due to their large output space and expensive vocabulary expansion and alignment training.
Approach: They propose to use Large Language Models to develop general-purpose, semantically-aware recommender systems that can be generalized and reusable.
Outcome: Experiments on real-world datasets show that GRAM outperforms baselines and significantly outperformed baselines.
UrbanGeoEval: A City-Scale Benchmark for Evaluating Large Language Models in Geospatial Reasoning (2026.acl-long)

Copied to clipboard

Challenge: Extensive experiments on 18 widely used LLMs uncover critical insights: (1) models exhibit severe geographic biases and resolution gaps; (2) failures in complex multi-hop tasks stem from brittle foundational spatial skills rather than high-level logic deficits.
Approach: They propose a dual-module framework that disentangles factual recall and spatial logic from the model's real capabilities in urban environments.
Outcome: Extensive tests on 18 widely used LLMs reveal that models exhibit severe geographic biases and resolution gaps, and failures in complex multi-hop tasks often stem from brittle foundational spatial skills rather than high-level logic deficits.
Scaling Behaviors of LLM Reinforcement Learning Post-Training: An Empirical Study in Mathematical Reasoning (2026.acl-long)

Copied to clipboard

Challenge: elucidating scaling laws for large language models (LLMs) during pre-training remains unexplored.
Approach: They characterize how model scale, data, and compute interact during pre-training . they find that large models consistently demonstrate superior compute and data efficiency .
Outcome: The proposed scaling laws offer practical guidance for scaling reasoning capabilities through reinforcement learning post-training.
STAPO: Selective Trajectory-Aware Policy Optimization for LLM Agent Training (2026.acl-long)

Copied to clipboard

Challenge: Prior work has explored step-level supervision using Shannon-entropy-based uncertainty signals, which conflate inherent state complexity with agent confidence.
Approach: They propose a hierarchical group-based RL framework that leverages normalized entropy to locate outlier steps associated with trajectory neglect and optimizes them via a mechanism of trajectory-aware reward and trajectory-independent penalty.
Outcome: Experiments on ALFWorld, WebShop, and Search-Augmented QA show that STAPO achieves state-of-the-art performance while substantially alleviating trajectory neglect.
Speaker Clustering in Textual Dialogue with Pairwise Utterance Relation and Cross-corpus Dialogue Act Supervision (2022.coling-1)

Copied to clipboard

Challenge: Existing models for textual dialogues do not include speaker annotations.
Approach: They propose a speaker clustering model for textual dialogues that groups utterances without annotations so that the actual speakers are identical inside each cluster.
Outcome: The proposed model outperforms the sequence classification baseline and benefits from the auxiliary dialogue act classification task.
CPRM: A LLM-based Continual Pre-training Framework for Relevance Modeling in Commercial Search (2025.naacl-industry)

Copied to clipboard

Challenge: Relevance modeling between queries and items is a key component of commercial search engines.
Approach: They propose a framework for continual pre-training of LLMs to enhance domain knowledge . they employ queries and multi-field item to jointly pre-train for enhancing domain knowledge.
Outcome: The proposed model achieves convincing performance compared to strong baselines.
CogCompNLP: Your Swiss Army Knife for NLP (L18-1)

Copied to clipboard

Challenge: a corpus-reader module supports popular corpora, feature extraction and annotation modules for semantic and syntactic tasks.
Approach: They propose a library that provides modules to address different challenges . they provide a corpus-reader module that supports popular corpora in the NLP community .
Outcome: The proposed library simplifies the process of design and development of NLP applications by providing modules to address different challenges.
Indirectly Supervised Natural Language Processing (2023.acl-tutorials)

Copied to clipboard

Challenge: a tutorial on indirect supervision addresses challenges in ML for NLP . conventional approaches to NLP use taskspecific labeled examples of a large volume . indirect supervision is useful for a wide range of NLP tasks, but it is not enough for decoders .
Approach: This tutorial aims to address questions about indirect supervision in machine learning . authors discuss indirect supervision from T′ that handles T with outputs spanning from a moderate size to an open space .
Outcome: This tutorial aims to answer questions about how to provide supervision for ML tasks . it will discuss indirect supervision from T′ that handles T with outputs spanning from a moderate size to an open space .
One-Dimensional Object Detection for Streaming Text Segmentation of Meeting Dialogue (2025.findings-acl)

Copied to clipboard

Challenge: Current text segmentation models exhibit numerous limitations, such as imbalances in labels that affect the stability of model training and discrepancies between the model’s training tasks (sentence classification) and the actual text segmenting.
Approach: They implement a sliding window-based segmentation method and employ two different levels of sliding window based balanced label strategies to stabilize the training process of the streaming segmentation model.
Outcome: The proposed method is robust, controllable, and achieves state-of-the-art performance.

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