Papers by Gang Chen

42 papers
SkipBERT: Efficient Inference with Shallow Layer Skipping (2022.acl-long)

Copied to clipboard

Challenge: Pre-trained language models have significant demands in computation and inference time, limiting their use in resource-constrained or latencysensitive applications.
Approach: They propose to encode text chunks into independent representations and skip computation of shallow layers to accelerate inference.
Outcome: The proposed approach can reduce latency by 65% without sacrificing performance.
Efficient Inference for Large Vision-Language Models: Bottlenecks, Techniques, and Prospects (2026.findings-acl)

Copied to clipboard

Challenge: Large Vision-Language Models are hindered by a systemic efficiency barrier known as visual token dominance.
Approach: They propose a systematic taxonomy of efficiency techniques structured around the inference lifecycle . they examine visual encoding, prefilling, and decoding to understand bottlenecks .
Outcome: The proposed techniques reveal how upstream decisions dictate downstream bottlenecks . the proposed techniques include hybrid compression and modality-aware decoding .
A Goal Without a Plan Is Just a Wish: Efficient and Effective Global Planner Training for Long-Horizon Agent Tasks (2026.acl-long)

Copied to clipboard

Challenge: Recent advances in large language models (LLMs) have leapt from static chatbots to versatile agents that tackle complex tasks such as science experiments.
Approach: They propose a plan-and-execute framework and propose 'EAGLET' to enhance the executor agent's planning abilities without human effort.
Outcome: The proposed method outperforms existing methods on three long-horizon tasks and reduces training costs by 8 compared to baselines.
Learning Geometry-Aware Representations for New Intent Discovery (2024.acl-long)

Copied to clipboard

Challenge: Existing methods for intent classification fail to distinguish new intents due to intertwined centers . a novel framework that learns geometry-aware representations to maximally separate all intents is proposed .
Approach: They propose a new intent discovery framework that learns geometry-aware representations to maximally separate all intents.
Outcome: The proposed framework achieves a new state-of-the-art performance on three benchmarking datasets.
ChatMap: Mining Human Thought Processes for Customer Service Chatbots via Multi-Agent Collaboration (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods for enhancing dialogue performance rely on summarizing behavior . e-commerce chatbots need to align their dialogue strategies with human behavior to achieve coherent, human-like conversations with customers.
Approach: They propose a method to extract core patterns from dialogue data and integrate them into models by mining service thought processes using a multi-agent aPproach.
Outcome: The proposed method outperforms manual methods and outperfies baselines on Taobao in China.
Draft & Verify: Lossless Large Language Model Acceleration via Self-Speculative Decoding (2024.acl-long)

Copied to clipboard

Challenge: Existing methods for accelerating Large Language Models have been criticized for their inference costs and inefficient decoding.
Approach: They propose a self-speculative decoding approach for accelerating Large Language Models without an auxiliary model.
Outcome: The proposed method achieves a speedup of up to 1.99 with no additional neural network training and no extra memory footprint.
FaithLens: Detecting and Explaining Faithfulness Hallucination (2026.findings-acl)

Copied to clipboard

Challenge: Recent progress in large language models (LLMs) has revolutionized text generation.
Approach: They propose a faithfulness hallucination detection model that can provide binary predictions and corresponding explanations to improve trustworthiness.
Outcome: The proposed model outperforms advanced models on 12 diverse tasks.
Meta-Reflection: A Feedback-Free Reflection Learning Framework (2025.acl-long)

Copied to clipboard

Challenge: Existing approaches to improve large language models' ability to understand and reason are limited by external feedback.
Approach: They propose a feedback-free reflection mechanism that requires only a single inference pass without external feedback.
Outcome: The proposed method is based on an industrial e-commerce benchmark and public datasets.
QBridge: Bridging Natural Language and SQL via Gold Query Rewriting with Agentic Refinement (2026.acl-long)

Copied to clipboard

Challenge: Natural language to SQL (NL2SQL) is an intuitive interface for querying structured data . but real user questions are noisy, ambiguous, and weakly grounded to database semantics.
Approach: They propose an agentic feedback-driven NL2SQL framework that bridges natural language and SQL via Gold Query.
Outcome: The proposed framework outperforms strong prompting and agentic baselines on spider, BIRD, and three robustness variants on NL2SQL.
Segment, Mask, and Predict: Augmenting Chinese Word Segmentation with Self-Supervision (2021.emnlp-main)

Copied to clipboard

Challenge: Recent state-of-the-art (SOTA) effective neural network methods have been used in Chinese word segmentation (CWS) However, the robustness of the previous neural methods is limited by the large-scale annotated corpus.
Approach: They propose a self-supervised Chinese word segmentation approach with a straightforward and effective architecture.
Outcome: The proposed approach outperforms previous methods on 9 different CWS datasets with single criterion training and multiple criteria training and achieves better robustness.
T2DR: A Two-Tier Deficiency-Resistant Framework for Incomplete Multimodal Learning (2025.findings-acl)

Copied to clipboard

Challenge: Existing incomplete multimodal learning frameworks are inadequate for integrating multimodal data.
Approach: They propose a framework for incomplete multimodal learning that is deficiency-resistant and provides two modules to address fine-grained deficiencies.
Outcome: The proposed framework outperforms the SOTA models on two well-known multimodal benchmarks.
Document Segmentation Matters for Retrieval-Augmented Generation (2025.findings-acl)

Copied to clipboard

Challenge: Existing rule-based chunking methods lead to suboptimal splits, where overly large chunks introduce irrelevant information and small chunks lack semantic coherence.
Approach: They propose a method that leverages document summaries as pseudo-instructions to guide chunking by computing semantic similarity between sentences and the summary.
Outcome: Experiments on multiple open-domain question-answering benchmarks show that PIC significantly improves retrieval accuracy (Hits@k) and end-to-end QA performance (Exact Match) without any additional training.
TaxPraBen: A Scalable Benchmark for Structured Evaluation of LLMs in Chinese Real-World Tax Practice (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models excel in general domains but lack real-world practical capabilities.
Approach: They propose a benchmark for Chinese taxation practice that combines 10 traditional application tasks with 3 pioneering real-world scenarios.
Outcome: The proposed benchmark combines 10 traditional tasks with 3 pioneering real-world scenarios.
HyperLoRA: Efficient Cross-task Generalization via Constrained Low-Rank Adapters Generation (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to adapt pre-trained language models (PLMs) to emerging tasks are costly and inefficient.
Approach: They propose a meta-network that generates task-specific weights without any optimization.
Outcome: The proposed approach has flexible generalization ability and superior performance over hypenetworks.
Towards Interpretable Tabular Reasoning: Enhancing LLM Reasoning on Tabular Data with Pre-Constructed Logic Graph (2026.acl-long)

Copied to clipboard

Challenge: Tabular data is used in fields such as finance and healthcare due to its heterogeneity and complexity.
Approach: They propose a Logic-Graph-Enhanced LLM Reasoning framework that integrates the strengths of tree-based models and LLMs to improve their interpretability.
Outcome: The proposed framework outperforms tree-based models and state-of-the-art LLMs on tabular prediction tasks, achieving superior accuracy and interpretability.
On LLMs-Driven Synthetic Data Generation, Curation, and Evaluation: A Survey (2024.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) provide a data-centric solution to alleviate limitations of real-world data with synthetic data generation.
Approach: They propose a generic workflow for LLM-driven synthetic data generation.
Outcome: The proposed workflows highlight gaps in existing research and outline avenues for future studies.
SpecVLM: Enhancing Speculative Decoding of Video LLMs via Verifier-Guided Token Pruning (2025.emnlp-main)

Copied to clipboard

Challenge: Video large language models (Vid-LLMs) rely on dense video token representations and require substantial memory and computational overhead in both prefilling and decoding.
Approach: They propose a training-free speculative decoding framework that prunes up to 90% of video tokens to enable efficient speculation without sacrificing accuracy.
Outcome: The proposed framework achieves 2.68 speedup on LLaVA-OneVision-72B and 2.11 speed up on Qwen2.5-VL-32B.
Ensembling Prompting Strategies for Zero-Shot Hierarchical Text Classification with Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Hierarchical text classification is a challenging task in natural language processing.
Approach: They propose a method which integrates the results of diverse prompting strategies to promote LLMs’ reliability.
Outcome: The proposed method boosts the performance of single prompting strategies and achieves SOTA results on three benchmark datasets.
Incorporating Instructional Prompts into a Unified Generative Framework for Joint Multiple Intent Detection and Slot Filling (2022.coling-1)

Copied to clipboard

Challenge: Existing approaches to multiple intent detection and slot filling focus on task-specific components to capture the relationships between intents and slots.
Approach: They propose a Unified Generative framework that captures the relationships between intents and slots in an utterance and formulates the task as a question-answering problem.
Outcome: The proposed framework surpasses baselines on full-data and multi-intent benchmarks on 5-shot and 10-shot scenarios.
TLM: Token-Level Masking for Transformers (2023.emnlp-main)

Copied to clipboard

Challenge: Structured dropout approaches have been investigated to regularize the multi-head attention mechanism in Transformers.
Approach: They propose a new regularization scheme based on token-level rather than structure-level to reduce overfitting by manipulating the connections between tokens in the multi-head attention via masking.
Outcome: The proposed regularization scheme outperforms attention dropout and DropHead on 18 datasets and can establish a new record on the data-to-text benchmark Rotowire (18.93 BLEU).
Data Contamination Calibration for Black-box LLMs (2024.findings-acl)

Copied to clipboard

Challenge: Despite the rapid advancements of Large Language Models, the unchecked ultra-large-scale training sets introduce a series of potential risks like data contamination.
Approach: They propose a method to detect contaminated training data and diminish the contamination effect by using a to-be-released dataset.
Outcome: The proposed method outperforms existing methods by at least 4.5% on more 4 dataset formats, with more than 10 base LLMs.
LLM-Powered Test Case Generation for Detecting Bugs in Plausible Programs (2025.acl-long)

Copied to clipboard

Challenge: TrickCatcher generates test cases that pass existing tests yet contain bugs . a recent study found that tricky bugs are not detected by test suites .
Approach: They propose an LLM-powered approach to generating test cases for uncovering bugs in plausible programs . they use a PUT and specification to generate program variants, an input generator and an Llm to construct test inputs .
Outcome: The proposed approach achieves recall, precision, and F1 scores that are 1.80, 2.65, and 1.66 . trickCatcher generates program variants based on the program under test and its specification .
Pyramid: A Layered Model for Nested Named Entity Recognition (2020.acl-main)

Copied to clipboard

Challenge: Named Entity Recognition (NER) is a fundamental NLP task.
Approach: They propose a pyramid-like layered model for Nested Named Entity Recognition . token or text region embeddings are recursively inputted into L flat NER layers .
Outcome: The proposed model achieves state-of-the-art F1 scores in nested NER on ACE-2004, ACE 2005, GENIA, and NNE.
LoRE: Enhancing Search Relevance with Progressive Chain-of-Thought and Preference Alignment (2026.findings-acl)

Copied to clipboard

Challenge: E-commerce search relevance is a critical component of retrieval systems.
Approach: They propose a large-generative model for search relevance that trains reasoning knowledge, multi-modal understanding and rule awareness into three core competencies.
Outcome: The proposed model outperforms GPT-5 in Macro-F1 and achieves 27% online gain.
Knowledge-to-Verification: Exploring RLVR for LLMs in Knowledge-Intensive Domains (2026.acl-long)

Copied to clipboard

Challenge: Recent large language models (LLMs) have demonstrated remarkable progress in reasoning, but their applications on knowledge-intensive domains have not been explored due to the scarcity of high-quality verifiable data.
Approach: They propose a framework that extends reinforcement learning with verifiable rewards (RLVR) to knowledge-intensive domains through automated verififiability data synthesis while enabling verification of the LLM's reasoning process.
Outcome: Extensive experiments show that the proposed framework enhances the reasoning of large language models in knowledge-intensive domains without significantly compromising the model’s general capabilities.
Skill Discovery for Software Scripting Automation via Offline Simulations with LLMs (2026.findings-eacl)

Copied to clipboard

Challenge: Large Language Models (LLMs) can generate code from natural language queries, but runtime code generation is limited due to unverified code, security risks, longer response times, and higher computational costs.
Approach: They propose an offline simulation framework to curate a software-specific skillset by exploiting large language models and publicly available scripting guides.
Outcome: The proposed framework significantly improves automation success rates, reduces response time, and saves runtime token costs compared to traditional runtime code generation.
MedVerse: Efficient and Reliable Medical Reasoning via DAG-Structured Parallel Execution (2026.acl-long)

Copied to clipboard

Challenge: Recent advances in large reasoning models have broadened the capabilities of medical artificial intelligence.
Approach: They propose a reasoning framework for complex medical inference that reformulates medical reasoning as a parallelizable directed acyclic graph process based on Petri Net theory.
Outcome: The proposed reasoning framework improves strong general-purpose LLMs by up to 8.9%.
FinMRAGBench: A Realistic and Complex Benchmark for Multi-Modal RAG in Financial Document Analysis (2026.findings-acl)

Copied to clipboard

Challenge: Existing benchmarks for realistic financial analysis fail to capture realistic financial situations involving cross-document retrieval, multi-page evidence integration, and diverse analytical tasks.
Approach: They propose a multi-modal financial RAG benchmark that evaluates large language models in realistic financial analysis settings.
Outcome: The proposed framework achieves the strongest overall performance across all models.
Aligning Large Language Models to Follow Instructions and Hallucinate Less via Effective Data Filtering (2025.acl-long)

Copied to clipboard

Challenge: Existing studies show that training LLMs on data containing unfamiliar knowledge during instruction tuning can encourage hallucinations.
Approach: They propose a framework that measures how familiar the LLM is with instruction data and introduce an expert-aligned reward model to ensure the quality of selected samples.
Outcome: The proposed framework reduces hallucinations while maintaining a competitive ability to follow instructions.
Enhanced Visual Instruction Tuning with Synthesized Image-Dialogue Data (2024.findings-acl)

Copied to clipboard

Challenge: OpenAI's GPT-4 has demonstrated remarkable multimodal capabilities, but specific mechanics of GPT4 remain unknown.
Approach: They propose a data collection methodology that synchronously synthesizes images and dialogues for visual instruction tuning.
Outcome: The proposed method improves on ten commonly assessed models and provides greater flexibility compared to existing methods.
SPEAK: Spiking Neurons as an Entropy-Aware Tokenizer for Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing tokenizers fail to explicitly leverage historical tokenization results . large language models (LLMs) have demonstrated remarkable effectiveness across NLP tasks .
Approach: They propose a tokenizer that integrates spiking neurons to explicitly leverage historical tokenization results.
Outcome: The proposed tokenizer leverages historical tokenization results, but does not selectively leverage history based on contextual relevance.
GUI Agents: A Survey (2025.findings-acl)

Copied to clipboard

Challenge: Large Foundation Models (LFMs) have transformed the landscape of AI research and day-to-day life.
Approach: They propose a framework that delineates GUI agents' perception, reasoning, planning, and acting capabilities.
Outcome: The proposed framework delineates their perception, reasoning, planning, and acting capabilities.
GUI0: Self-Evolving Foundational GUI Agents in Super App Ecosystems (2026.acl-long)

Copied to clipboard

Challenge: Automated interaction with graphical user interfaces (GUIs) is central to general artificial intelligence, but remains challenging within Super App ecosystems.
Approach: They propose a framework synergizing autonomous data synthesis with dual-agent co-evolution . GUI0 establishes a domain-aware foundation model via synthesized corpora and employs curriculum-driven reinforcement learning .
Outcome: The proposed framework outperforms Gemini-2.5-Pro and Claude-4-Sonnet in the SuperAPP benchmark and has universal efficacy across base models.
The Medical Scribe: Corpus Development and Model Performance Analyses (2020.lrec-1)

Copied to clipboard

Challenge: Existing tools to assist in clinical note generation using audio of provider-patient encounters are lacking.
Approach: They develop an annotation scheme to extract relevant clinical concepts from audio of provider-patient encounters and train a state-of-the-art tagging model.
Outcome: The proposed model is more useful than the F-scores reflect and can be used in clinical notes.
FreeAL: Towards Human-Free Active Learning in the Era of Large Language Models (2023.emnlp-main)

Copied to clipboard

Challenge: Modern machine learning models require a huge collection of precisely labeled data, which can be labor-intensive and time-consuming.
Approach: They propose a collaborative learning framework that interactively distills and filters the task-specific knowledge from LLMs.
Outcome: The proposed framework improves zero-shot performance on eight benchmark datasets without human supervision.
Pre-trained Semantic Interaction based Inductive Graph Neural Networks for Text Classification (2025.coling-main)

Copied to clipboard

Challenge: Existing methods for text classification have vanishing or exploding gradients when dealing with long sequences, making it difficult to handle long-distance dependencies.
Approach: They propose a graph neural network based on pre-trained semantic interaction called PaSIG . they construct a text-word heterogeneity graph and use context representation capability .
Outcome: The proposed model outperforms existing methods on five datasets and achieves state-of-the-art performance.
GATEAU: Selecting Influential Samples for Long Context Alignment (2025.emnlp-main)

Copied to clipboard

Challenge: Existing studies have attempted to scale up the available data volume by synthesizing long instruction-following samples, but a lack of a well-defined strategy for ensuring data quality may introduce low-quality samples and restrict the model’s performance.
Approach: They propose a framework to identify influential samples enriched with long-range dependency relations that can be used to align large language models to handle instructions with extremely long contexts.
Outcome: The proposed framework identifies samples with long-range dependency relations and shows that the model trained on these samples exhibits better instruction-following and long-context understanding capabilities.
Q-PRM: Adaptive Query Rewriting for Retrieval-Augmented Generation via Step-level Process Supervision (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to rewriting queries often lack supervision signals for intermediate steps . existing approaches rely on outcome-supervised training or heuristic rules to guide the rewrite process .
Approach: They propose a query rewriting framework that generates process-level supervision signals for intermediate steps.
Outcome: a new query rewriting framework outperforms existing approaches on open-domain QA benchmarks.
LongTableBench: Benchmarking Long-Context Table Reasoning across Real-World Formats and Domains (2025.findings-emnlp)

Copied to clipboard

Challenge: Evaluating 52 LLMs reveals that only the strongest models maintain robust performance under increasing context lengths and format diversity.
Approach: They propose a benchmark for evaluating long-context reasoning over semi-structured tables across diverse formats, tasks, and domains.
Outcome: The proposed model outperforms compression-based approaches on tasks requiring semantic integration.
Embedding and Gradient Say Wrong: A White-Box Method for Hallucination Detection (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods for hallucination detection have attracted more attention from the community.
Approach: They propose to model the distributional distance between the regular conditional output and the unconditional output, which is generated without a given input text.
Outcome: The proposed model achieves state-of-the-art on the hallucination benchmarks HADES and other datasets.
See the Forest for the Trees: Loosely Speculative Decoding via Visual-Semantic Guidance for Efficient Inference of Video LLMs (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for video understanding suffer from autoregressive generation of tokens.
Approach: They propose a training-free loosely SD framework for Video-LLMs that uses visual-relevant tokens to accurately pinpoint the latter.
Outcome: The proposed framework boosts the accepted length and speedup ratio by 136% and 35% compared to SOTA training-free SD methods for Video-LLMs.
CYCLE-INSTRUCT: Fully Seed-Free Instruction Tuning via Dual Self-Training and Cycle Consistency (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods for instruction tuning rely on expensive human-annotated seed data or powerful external teacher models.
Approach: They propose a framework that achieves fully seed-free instruction tuning by employing a dual self-training loop where two models are bootstrapped solely from raw, unlabeled text.
Outcome: The proposed framework outperforms seed-driven back-translation baselines and achieves comparable performance to strongly supervised methods.

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