Papers by Bowen Zhang

101 papers
Dolphin: Moving Towards Closed-loop Auto-research through Thinking, Practice, and Feedback (2025.acl-long)

Copied to clipboard

Challenge: Recent studies show that AI-assisted research methods can improve research efficiency . a closed-loop framework is used to enhance the automation level of scientific research .
Approach: They propose a closed-loop LLM-driven framework to enhance the automation level of scientific research.
Outcome: The proposed framework improves the efficiency of scientific research by improving data analysis, accelerating computation, and fostering novel idea generation.
A Probabilistic Model for Joint Learning of Word Embeddings from Texts and Images (D18-1)

Copied to clipboard

Challenge: Existing approaches combine language and perception to infer word embeddings . however, the embeddables produced by such models do not reflect the actual word representations.
Approach: They propose a probabilistic model that integrates linguistic and perceptual inputs to explain observed word-context pairs in a text corpus.
Outcome: The proposed model achieves competitive or stronger results on tasks of assessing pairwise word similarity and image/caption retrieval compared to other state-of-the-art models.
TwiUSD: A Benchmark Dataset and Structure-Aware LLM Framework for User Stance Detection (2026.acl-long)

Copied to clipboard

Challenge: Existing benchmarks for political user-level stance detection rely on noisy heuristics or distant supervision.
Approach: They propose a large-scale, expert-annotated benchmark for political user-level stance detection with explicit social network structure that integrates user content and followee signals.
Outcome: The proposed framework outperforms baselines in terms of quality and reliability.
HATA: Trainable and Hardware-Efficient Hash-Aware Top-k Attention for Scalable Large Model Inference (2025.findings-acl)

Copied to clipboard

Challenge: Existing top-k attention methods struggle to strike a balance between efficiency and accuracy.
Approach: They propose a top-k attention approach that integrates low-overhead techniques into the Top-k Attention process to achieve 7.2 speedup compared to vanilla full attention.
Outcome: The proposed approach achieves 7.2 speedup compared to current top-k attention methods while maintaining model accuracy.
Patton: Language Model Pretraining on Text-Rich Networks (2023.acl-long)

Copied to clipboard

Challenge: Existing models for text-rich networks do not take inter-document structure into account.
Approach: They propose a pretraining framework for a text-rich network using a masked language model and a masking node prediction framework.
Outcome: The proposed model outperforms baselines on four tasks in academic and e-commerce domains.
Learning to Represent Image and Text with Denotation Graph (2020.emnlp-main)

Copied to clipboard

Challenge: Recent advances in learning representations of visual and language information have been a problem with many applications.
Approach: They propose to extract visual expressions from images aligned with linguistic expressions that describe the images to learn representations from implicit expressions.
Outcome: The proposed representations lead to stronger empirical results on downstream tasks of cross-modal image retrieval, referring expression, and compositional attribute-object recognition.
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 .
MARS2: Scaling Multi-Agent Tree Search via Reinforcement Learning for Code Generation (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to reinforcement learning are decoupled from structured search due to limited trajectory diversity.
Approach: They propose a unified RL framework that integrates multiple agents within a shared tree-structured search environment.
Outcome: Experiments show that MARS2 improves performance across diverse model combinations and training settings.
CamoQuery: Language-Guided Reasoning Camouflaged Object Segmentation (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for camouflaged object segmentation are limited to vision-only mask prediction under fixed task assumptions.
Approach: They propose a language-guided reasoning camouflaged object segmentation task that generates an intent-consistent segmentation mask from an image and an implicit query text instruction.
Outcome: The proposed task can generate an intent-consistent segmentation mask from a camouflaged image and an implicit query text instruction.
ReviewRL: Towards Automated Scientific Review with RL (2025.emnlp-main)

Copied to clipboard

Challenge: Existing automated review systems struggle with factual accuracy, rating consistency, and analytical depth.
Approach: They propose a framework for generating comprehensive and factually grounded scientific paper reviews using supervised fine-tuning and reinforcement learning.
Outcome: The proposed framework outperforms existing methods on ICLR 2025 papers.
Improve Vision Language Model Chain-of-thought Reasoning (2025.acl-long)

Copied to clipboard

Challenge: Current training recipes often rely on datasets dominated by short annotations with limited rationales, hindering the models' ability to generalize to tasks requiring comprehensive reasoning.
Approach: They propose a two-stage post-training strategy that augments short answers with CoT reasoning generated by GPT-4o, enhancing the VLM's CoT capabilities through fine-tuning.
Outcome: The proposed strategy enhances the model's CoT capabilities through fine-tuning and reinforcement learning.
Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search (2026.findings-acl)

Copied to clipboard

Challenge: LLM-based agents for machine learning engineering rely on tree search to rank candidates.
Approach: They propose an LLM-based agent that operationalizes gradient-based optimization.
Outcome: The proposed agent achieves a state-of-the-art 35.1% any-medal rate on MLE-Bench with a limited budget on a single GPU.
OpenHuEval: Evaluating Large Language Model on Hungarian Specifics (2025.findings-acl)

Copied to clipboard

Challenge: Recent advances in Large Language Models (LLMs) represent significant strides toward artificial general intelligence (AGI).
Approach: They introduce OpenHuEval, the first benchmark for LLMs focusing on the Hungarian language and specifics.
Outcome: The framework reveals intrinsic patterns and mechanisms of LLMs in non-English languages, with Hungarian serving as an example.
A Comprehensive Survey of Scientific Large Language Models and Their Applications in Scientific Discovery (2024.emnlp-main)

Copied to clipboard

Challenge: Existing surveys on scientific LLMs focus on one or two fields or a single modality.
Approach: They survey 260 scientific LLMs and examine their architectures and pre-training techniques . they also discuss commonalities and differences between LLM architectures .
Outcome: The proposed model architectures and evaluation techniques are used to improve scientific discovery.
DI-BENCH: Benchmarking Large Language Models on Dependency Inference with Testable Repositories at Scale (2025.findings-acl)

Copied to clipboard

Challenge: Existing studies highlight that dependency-related issues cause over 40% of observed runtime errors on the generated repository.
Approach: They propose a large-scale benchmark and evaluation framework specifically designed to assess LLMs’ capability on dependency inference.
Outcome: The proposed model achieves only a 48% execution pass rate on Python, indicating room for improvement.
KARL: Reinforcement Learning for LLM Agents on Multi-Turn Knowledge-Intensive Agentic Tasks (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models have shown remarkable potential as autonomous agents, but their effectiveness in knowledge-intensive tasks remains limited by passive knowledge utilization.
Approach: They propose a framework that enables LLM agents to dynamically explore structured knowledge sources through multi-turn interactions.
Outcome: The proposed framework outperforms existing retrieval-augmented approaches on knowledge graph and database tasks while maximizing tool-use behaviors end-to-end.
CoGenesis: A Framework Collaborating Large and Small Language Models for Secure Context-Aware Instruction Following (2024.acl-long)

Copied to clipboard

Challenge: Large-scale language models (LLMs) are increasingly exposed to private data and are becoming more and more prevalent.
Approach: They propose a collaborative generation framework that integrates large and small language models to address privacy concerns logically.
Outcome: The proposed framework combines large and small models to address privacy concerns logically.
Systematic Generalization on gSCAN: What is Nearly Solved and What is Next? (2021.emnlp-main)

Copied to clipboard

Challenge: a general-purpose Transformer-based model with crossmodal attention solves most of the systematic generalization problems . current models are data inefficient given the narrow scope of commands in gSCAN .
Approach: They propose to use a Transformer-based model with cross-modal attention to solve gSCAN . they propose to generate data to incorporate relations between objects in the visual environment .
Outcome: The proposed model outperforms specialized approaches on most splits, and is data inefficient given the narrow scope of commands.
ArkRepoBench: A Repository-Level Code Completion Benchmark for HarmonyOS Development (2026.findings-acl)

Copied to clipboard

Challenge: Despite the maturity of LLM-based code assistance for mainstream languages, the capabilities of ArkTS are largely unexplored.
Approach: They propose to benchmark repository-level code completion for ArkTS using 7,519 samples from 20 official HarmonyOS repositories.
Outcome: The proposed benchmark covers multiple difficulty levels and categorizes completion instances into Single-File, Cross-Filled Independent, and Cross-Filed Dependent settings based on dependency analysis.
Exploring Reversal Mathematical Reasoning Ability for Large Language Models (2024.findings-acl)

Copied to clipboard

Challenge: Large language models (LLMs) have been a success in the wide range of natural language understanding and reasoning tasks.
Approach: They propose a training method to improve general and reversal reasoning abilities by using a reversed dataset.
Outcome: The proposed method improves general and reversal reasoning abilities and alleviates the reverse curse.
KELE: Residual Knowledge Erasure for Enhanced Multi-hop Reasoning in Knowledge Editing (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing knowledge editing techniques show limitations when applied to multi-hop reasoning . residual single-hop knowledge causes edited models to revert to original answers .
Approach: They propose a knowledge editing method that incorporates a Knowledge Erasure mechanism for Large language model Editing (KELE) they propose an erasure function for residual knowledge and an injection function for new knowledge .
Outcome: The proposed method significantly improves multi-hop reasoning capability of edited models.
PaD: Program-aided Distillation Can Teach Small Models Reasoning Better than Chain-of-thought Fine-tuning (2024.naacl-long)

Copied to clipboard

Challenge: Large language models excel in various tasks, but their huge size and inaccessibility of parameters present challenges for practical deployment.
Approach: They propose to use CoT data to distill task-specific ability from large language models to smaller models . they use reasoning programs to suppress errors in distilled data and improve distillation quality .
Outcome: The proposed model outperforms LLMs on arithmetic reasoning, symbolic reasoning, and general ability.
From What to Why: Improving Relation Extraction with Rationale Graph (2021.findings-acl)

Copied to clipboard

Challenge: Existing neural relation extraction models are limited by entity type and textual context.
Approach: They propose a novel RAtionale Graph to organize co-occurrence constraints among entity types, triggers and relations in a holistic graph view.
Outcome: The proposed method outperforms baselines significantly and achieves state-of-the-art performance on document-level and sentence-level RE benchmarks.
ProcessBench: Identifying Process Errors in Mathematical Reasoning (2025.acl-long)

Copied to clipboard

Challenge: Existing models fail to generalize to more challenging math problems, authors say . existing benchmarks related to assessing language models' reasoning process are limited .
Approach: They propose a tool to measure language models' ability to identify erroneous steps in reasoning . they use two types of models: process reward models and critic models .
Outcome: The proposed model outperforms existing models in evaluating language models' reasoning process . the best open-source model has demonstrated the critique capability competitive with the proprietary model .
RMTBench: Benchmarking LLMs Through Multi-Turn User-Centric Role-Playing (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing benchmarks focus on character-centric approach and fail to reflect real-world applications.
Approach: RMTBench is a user-centric bilingual role-playing benchmark featuring 80 diverse characters and over 8,000 dialogue rounds.
Outcome: RMTBench features 80 diverse characters and over 8,000 dialogue rounds.
LongDPO: Unlock Better Long-form Generation Abilities for LLMs via Critique-augmented Stepwise Information (2025.findings-acl)

Copied to clipboard

Challenge: Recent advances in large language models have improved their capacity to handle long text inputs, but current models still exhibit unsatisfactory performance in long-form generation.
Approach: They propose a method to enhance long-form text generation through step-level supervision by leveraging Monte Carlo Tree Search to collect stepwise preference pairs and employ a global memory pool to maintain factual accuracy.
Outcome: The proposed method improves performance on long-form generation benchmarks while maintaining lossless performance on several general benchmarks.
Semi-Supervised Lifelong Language Learning (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing methods to learn languages only focus on supervised learning, and unlabeled data is underexplored.
Approach: They propose a semi-supervised lifelong language learning setting where a model learns sequentially arriving language tasks with both labeled and unlabeled data.
Outcome: The proposed model outperforms baseline models on various language tasks and is effective and superior to existing models.
Prompt Tuning for Discriminative Pre-trained Language Models (2022.findings-acl)

Copied to clipboard

Challenge: Recent studies have shown promising results of prompt tuning in stimulating pre-trained language models (PLMs) for natural language processing tasks.
Approach: They propose a prompt tuning framework that reformulates NLP tasks into a discriminative language modeling problem.
Outcome: The proposed framework improves on text classification and question answering tasks and prevents unstable tuning problems in low-resource settings.
RECALL: REpresentation-aligned Catastrophic-forgetting ALLeviation via Hierarchical Model Merging (2025.emnlp-main)

Copied to clipboard

Challenge: Existing models that require task labels or performance trade-offs are susceptible to catastrophic forgetting.
Approach: They propose a representation-aware model merging framework for continual learning without access to historical data.
Outcome: The proposed framework outperforms baselines in knowledge retention and generalization across five NLP tasks and multiple continual learning scenarios.
CT-FineBench: A Diagnostic Fidelity Benchmark for Fine-Grained Evaluation of CT Report Generation (2026.acl-long)

Copied to clipboard

Challenge: Existing evaluation metrics for radiology report generation focus on lexical overlap and entity matching.
Approach: They propose a benchmark to evaluate the fine-grained factual consistency of CT reports . they use a question-answering process to query a machine-generated report .
Outcome: The proposed benchmark evaluates the fine-grained factual consistency of CT reports . it correlates better with expert clinical assessment and is more sensitive to errors .
Outcome Accuracy is Not Enough: Aligning the Reasoning Process of Reward Models (2026.acl-long)

Copied to clipboard

Challenge: Recent studies observe a phenomenon where reward models achieve high accuracy on static datasets but fail to generalize effectively during RLHF.
Approach: They propose a method that combines rationale consistency with outcome accuracy to improve performance on RM-Bench and JudgeBench.
Outcome: The proposed method surpasses baselines on RM-Bench and JudgeBench by an average of 5% and improves creative writing tasks by 7%.
Efficient Reasoning for LLMs through Speculative Chain-of-Thought (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for efficient reasoning focus on reducing the number of model parameters or shortening the chain-of-thought length.
Approach: They propose a speculative chain-of-thought (SCoT) method to reduce reasoning latency by accelerating average reasoning speed through large and small model collaboration.
Outcome: The proposed method reduces reasoning latency by 48%66% and 21%49% on GSM8K, MATH, GaoKao, CollegeMath and Olympiad datasets.
Fusing Highly Specialized Language Models for Comprehensive Expertise (2025.acl-long)

Copied to clipboard

Challenge: Existing models that focus on language, programming code, and mathematical symbols are not able to achieve mastery of all three domains simultaneously.
Approach: They propose to fuse highly-specialized models that are already sufficiently trained on different domains to achieve a highly-specific model.
Outcome: The proposed model could achieve mastery of the three crucial domains simultaneously.
PLAWBENCH: A Rubric-Based Benchmark for Evaluating LLMs in Real-World Legal Practice (2026.acl-long)

Copied to clipboard

Challenge: Existing benchmarks for large language models (LLMs) are coarse, single-dimensional metrics and do not explicitly assess fine-grained legal reasoning.
Approach: They propose a Practical Law Benchmark to evaluate large language models in real-world legal practice scenarios.
Outcome: The proposed model is based on 850 questions and 13 scenarios with expert-designed evaluation rubrics.
EDDA: An Encoder-Decoder Data Augmentation Framework for Zero-Shot Stance Detection (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods for enhancing text or data are limited by lack of logical connections between generated texts and training data.
Approach: They propose an encoder-decoder data augmentation framework that combines large language models and chain-of-thought prompting to summarize texts into target-specific if-then rationales, establishing logical relationships.
Outcome: The proposed framework significantly improves over state-of-the-art methods on benchmark datasets while enabling interpretable rationale-based learning.
Advancing Semantic Textual Similarity Modeling: A Regression Framework with Translated ReLU and Smooth K2 Loss (2024.emnlp-main)

Copied to clipboard

Challenge: despite its efficiency, Sentence-BERT ignores the progressive nature of semantic relationships, despite a promising approach . contrastive learning methods have improved performance on renowned STS benchmarks, but they fail to leverage fine-grained information.
Approach: They propose a regression framework that categorizes text pairs as either semantically similar or dissimilar . they propose two loss functions: Translated ReLU and Smooth K2 Loss to bridge this gap .
Outcome: The proposed method achieves convincing performance across seven established STS benchmarks.
HybridKV: Hybrid KV Cache Compression for Efficient Multimodal Large Language Model Inference (2026.acl-long)

Copied to clipboard

Challenge: Multimodal Large Language Models (MLLMs) are hindered by the rapid growth of key–value (KV) caches.
Approach: They propose a hybrid KV cache compression framework that reduces KV memory by 7.9 and speeds up decoding by 1.52.
Outcome: Experiments on 11 multimodal benchmarks show that HYBRIDKV cuts KV cache memory by 7.9 and speeds up decoding by 1.52.
Demonstration Augmentation for Zero-shot In-context Learning (2024.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) have demonstrated an impressive capability known as In-context Learning (ICL), which enables them to acquire knowledge from textual demonstrations without the need for parameter updates.
Approach: They propose to use model’s previously predicted historical samples as demonstrations for subsequent ones to improve model’ s performance.
Outcome: The proposed method significantly outperforms the previous method and its predecessors in terms of inference cost and time.
START: Self-taught Reasoner with Tools (2025.emnlp-main)

Copied to clipboard

Challenge: Large Reasoning Models (LRMs) have demonstrated remarkable capabilities in complex reasoning through long chain-of-thought, yet they struggle with precise computations and algorithmic operations.
Approach: They propose a training-free approach that activates LRMs’ latent tool-use capabilities through artificial hints and a framework that enables models to learn effective tool utilization through diverse hint patterns and rejection-based data synthesis.
Outcome: Experiments show that START significantly improves state-of-the-art LRMs across challenging benchmarks, including competition-level mathematics (AMC23: 95.0%, AIME24: 75.6%) and graduate-level science questions (GPQA: 64.6%).
Coarse-to-Fine Pre-training for Named Entity Recognition (2020.emnlp-main)

Copied to clipboard

Challenge: Named Entity Recognition (NER) is a task of discovering information entities and identifying their corresponding categories.
Approach: They propose a NER-specific framework to inject coarse-to-fine named entity knowledge into pre-trained models by using a remote supervision strategy.
Outcome: The proposed framework achieves significant improvements against several pre-trained base-lines, demonstrating its effectiveness in label-few and low-resource scenarios.
Intuitive Fine-Tuning: Towards Simplifying Alignment into a Single Process (2025.acl-long)

Copied to clipboard

Challenge: Supervised Fine-Tuning (SFT) and Preference Optimization (PO) are key processes for aligning Language Models with human preferences post pre-training.
Approach: They propose to combine Supervised Fine-Tuning and Preference Optimization (PO) with two sub-processes defined at token level within the Markov Decision Process (MDP)
Outcome: The proposed process performs comparably or even superiorly to SFT and some typical PO methods across several tasks, particularly those requires generation, reasoning, and fact-following abilities.
Enhancing Chinese Pre-trained Language Model via Heterogeneous Linguistics Graph (2022.acl-long)

Copied to clipboard

Challenge: Experimental results show that pre-trained Chinese language models ignore linguistics knowledge to learn representations.
Approach: They propose a task-free enhancement module to integrate linguistics knowledge into Chinese pre-trained language models.
Outcome: The proposed model improves Chinese pre-trained language models on 6 tasks with 10 benchmark datasets.
Edge-Enhanced Graph Convolution Networks for Event Detection with Syntactic Relation (2020.findings-emnlp)

Copied to clipboard

Challenge: Event detection (ED) is a key subtask of information extraction.
Approach: They propose an architecture that exploits syntactic structure and typed dependency label information to perform event detection.
Outcome: The proposed architecture exploits syntactic structure and typed dependency label information to perform ED.
Learning to Prune Dependency Trees with Rethinking for Neural Relation Extraction (2020.coling-main)

Copied to clipboard

Challenge: Existing approaches to remove noise from dependency trees are not optimal due to complexity and variability of natural language.
Approach: They propose a dynamically pruned Graph Convolutional Network (DP-GCN) that prunes the dependency tree with rethinking in an end-to-end scheme.
Outcome: The proposed model achieves impressive results compared to strong competitors.
CMD: a framework for Context-aware Model self-Detoxification (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods of text detoxification fail to achieve a decent balance between effectiveness and generation quality.
Approach: They propose a text detoxification framework that pays attention to both context and detoxification process.
Outcome: Experiments on various LLMs show that the proposed framework can yield the best performance compared to baselines.
SDAR: A Synergistic Diffusion-AutoRegression Paradigm for Scalable Sequence Generation (2026.findings-acl)

Copied to clipboard

Challenge: Autoregressive (AR) language models are a dominant paradigm in the field of parallelism and non-causal modeling.
Approach: They propose a blockwise discrete diffusion model that preserves AR-compatible serving while enabling parallel intra-block generation.
Outcome: The proposed model achieves theoretical speedups over 5 and wall-clock speedup of 2.3 on H200 GPUs in latency-critical regimes.
Scalable Efficient Training of Large Language Models with Low-dimensional Projected Attention (2024.emnlp-main)

Copied to clipboard

Challenge: Existing studies have found that low-rank pre-training often compromises effectiveness.
Approach: They propose to apply low-dimensional module only to the attention layer to improve both effectiveness and efficiency.
Outcome: The proposed model saves 12.4% time while improving test perplexity and on downstream tasks compared with vanilla Transformer.
P-MMEval: A Parallel Multilingual Multitask Benchmark for Consistent Evaluation of LLMs (2025.emnlp-main)

Copied to clipboard

Challenge: Recent advances in large language models showcase varied multilingual capabilities across tasks . previous assessments focused on fundamental natural language processing (NLP) or isolated capability-specific tasks.
Approach: They propose a multilingual multitask benchmark to assess multilingual capabilities . they use a large-scale benchmark covering fundamental and capability-specialized datasets .
Outcome: The proposed benchmark compares models and tasks across languages and tasks and examines knowledge transfer from English to other languages.
The Lessons of Developing Process Reward Models in Mathematical Reasoning (2025.findings-acl)

Copied to clipboard

Challenge: a recent study shows that process reward models can make mistakes, leading to wrong conclusions.
Approach: They propose a consensus filtering mechanism that integrates MC estimation with LLM-as-a-judge to improve model performance and data efficiency.
Outcome: The proposed model outperforms existing open-source alternatives and provides practical guidelines for future research.
V-GameGym: Visual Game Generation for Code Large Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing code-related benchmarks focus on single modality rather than visual game development.
Approach: They propose a multimodal benchmark for evaluating code large language models in visual game generation that integrates a clustering-based curation methodology and a pipeline for visual code synthesis.
Outcome: The proposed framework assesses code generation and visual game generation using a sandbox environment.
LongInsightBench: A Comprehensive Benchmark for Evaluating Omni-Modal Models on Human-Centric Long-Video Understanding. (2026.findings-acl)

Copied to clipboard

Challenge: LongInsightBench is the first benchmark designed to assess models’ ability to understand long videos, with a focus on human language, viewpoints, actions, and other contextual elements.
Approach: They propose a benchmark to assess models’ ability to understand long videos with a focus on human language, viewpoints, actions, and other contextual elements.
Outcome: The proposed model excels in three key areas: a) long-duration, human-centric videos; b) diversifying and challenging task scenarios; c) quality assurance pipeline; and d) reliability.
Toolscaler: Scalable Generative Tool Calling via Structure-Aware Semantic Tokenization (2025.findings-emnlp)

Copied to clipboard

Challenge: Extensive experiments demonstrate the effectiveness of SGTC across various tasks.
Approach: They propose a generative tool invocation framework that introduces structure-aware semantic tokenization to encode tools as discrete code sequences.
Outcome: The proposed framework reduces the size of the representation space and underutilizes collaborative signals among tools in downstream tasks.
Living in the Moment: Can Large Language Models Grasp Co-Temporal Reasoning? (2024.acl-long)

Copied to clipboard

Challenge: Current temporal reasoning datasets are limited to questions about single or isolated events, falling short in mirroring the realistic temporal characteristics involving concurrent nature and intricate temporal interconnections.
Approach: They propose a co-temporal Question Answering benchmark that contains four co-time scenarios with 4,748 samples for evaluating the co-timing abilities of large language models.
Outcome: The proposed benchmarks show that current LLMs struggle on CoTempQA tasks even when enhanced with Chain of Thought methodologies.
SDAR-VL: Stable and Efficient Block-wise Diffusion for Vision-Language Understanding (2026.acl-long)

Copied to clipboard

Challenge: Existing block-wise discrete diffusion models lack robust autoregressive (AR) decoders.
Approach: They propose a block-wise discrete diffusion framework for large-scale vision-language understanding with a progressive beta noise curriculum.
Outcome: The proposed framework improves training efficiency, convergence stability, and task performance over conventional block diffusion.
Enhancing Learning-Based Binary Code Similarity Detection Model through Adversarial Training with Multiple Function Variants (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing Learning-Based Binary Code Similarity Detection (LB-BCSD) methods exhibit lower accuracy in recognizing functions with the same functionality but different implementations.
Approach: They propose a gradient-guided adversarial attack method based on critical code called FuncFooler which perturbs critical code to generate multiple variants of the same function.
Outcome: The proposed method increases the accuracy of the current Learning-Based Binary Code Similarity Detection (LB-BCSD) model by 5%-7%.
Adam’s Law: Textual Frequency Law on Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Textual frequency is a topic of understudied research, but its relevance to Large Language Models is not well understood.
Approach: They propose a framework to estimate textual data frequency using a paraphraser and a textual distillation method to refine LLMs.
Outcome: The proposed framework can be used to estimate sentence-level frequency with word-level frequencies.
Causal Document-Grounded Dialogue Pre-training (2023.emnlp-main)

Copied to clipboard

Challenge: Existing methods for document-grounded dialogue (DocGD) rely on general pre-trained language models without a tailored pre-training approach that explicitly captures causal relationships.
Approach: They propose a causally-complete dataset construction strategy for developing million-scale DocGD pre-training corpora and a perturbation-based strategy to capture causality.
Outcome: The proposed strategy yields significant and consistent improvements in fully-supervised, low-resource, few-shot, and zero-shot settings.
Improving Distantly-Supervised Named Entity Recognition with Self-Collaborative Denoising Learning (2021.findings-emnlp)

Copied to clipboard

Challenge: Named entity recognition (NER) is a method of detecting entity spans and classifying them into predefined categories.
Approach: They propose a method to iteratively perform noisy label refinery by using self-collaborative denoising learning.
Outcome: The proposed learning paradigm exploits reliable labels and communicates with unreliable annotations by collaborative denoising.
STAIR: Learning Sparse Text and Image Representation in Grounded Tokens (2023.emnlp-main)

Copied to clipboard

Challenge: State-of-the-art contrastive learning models like CLIP and ALIGN are less interpretable and suffer from inferior accuracy than dense representations.
Approach: They extend CLIP and ALIGN models to build a sparse semantic representation that is interpretable and easy to integrate with existing retrieval systems.
Outcome: The proposed model outperforms CLIP and ALIGN models on image and text retrieval tasks with a 4.9% and +4.3% improvement on COCO-5k textimage and imagetext retrieval respectively.
Towards Generalized Open Information Extraction (2022.findings-emnlp)

Copied to clipboard

Challenge: Open Information Extraction (OpenIE) models are evaluated on in-domain test sets aside from the training corpus, which violates the initial task principle of domain-independence.
Approach: They propose to generalize OpenIE over unseen target domains with different data distributions from source training domains.
Outcome: The proposed method beats the previous methods in both in- and out-of-domain settings by 6.0% in F1 score absolutely.
Prompting Large Language Models to Tackle the Full Software Development Lifecycle: A Case Study (2025.coling-main)

Copied to clipboard

Challenge: Existing benchmarks focused on simplified or isolated aspects of coding, ignoring the full spectrum of programming challenges.
Approach: They propose a case study that examines the performance of large language models across the entire software development lifecycle with four programming languages, multiple domains, and carefully designed and verified metrics for each task.
Outcome: The proposed model performs across the entire software development lifecycle, including design, environment setup, implementation, acceptance testing, and unit testing.
History Semantic Graph Enhanced Conversational KBQA with Temporal Information Modeling (2023.acl-long)

Copied to clipboard

Challenge: Existing methods for conversational KBQA assume the independence of utterances and model them in isolation.
Approach: They propose a History Semantic Graph Enhanced KBQA model that models long-range semantic dependencies in conversation history while maintaining low computational cost.
Outcome: The proposed model outperforms baselines on a widely used question type dataset.
Porous Lattice Transformer Encoder for Chinese NER (2020.coling-main)

Copied to clipboard

Challenge: Existing methods to integrate word boundary information into character-level Chinese NER are inefficient and lack semantic interaction.
Approach: They propose an extension of transformer encoder that is tailored for ChineseNER to incorporate lexicons into character-level Chinese NER by lattices.
Outcome: The proposed extension performs 11.4 times faster than state-of-the-art methods while retaining the rich long-term dependencies.
Visually Grounded Concept Composition (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to visual grounding do not explicitly model compositional structures of text expressions.
Approach: They propose a concept-relation Graph and a composition neural network to combine CRGs . they propose to align CRG-based concepts with images to learn visually grounded concepts .
Outcome: The proposed model can model grounded concepts forming at sentence level and word level.
A Rationale-centric Counterfactual Data Augmentation Method for Cross-Document Event Coreference Resolution (2024.naacl-long)

Copied to clipboard

Challenge: Existing state-of-the-art event coreference resolution systems rely on spurious and spurious associations in the input mention pair text.
Approach: They propose a rationale-centric counterfactual data augmentation method that leverages the debiasing capability of counterfact data haussed by LLM-in-the-loop to mitigate spurious association while emphasizing causation.
Outcome: The proposed method achieves state-of-the-art on three popular cross-document benchmarks and demonstrates robustness in out-of domain scenarios.
CLIP-UP: A Simple and Efficient Mixture-of-Experts CLIP Training Recipe with Sparse Upcycling (2025.findings-emnlp)

Copied to clipboard

Challenge: Mixture-of-Experts (MoE) models are crucial for scaling model capacity while controlling inference costs.
Approach: They propose an alternative training strategy that converts a dense CLIP model into a sparse MoE architecture.
Outcome: The proposed training strategy outperforms dense models on COCO and Flickr30k benchmarks.
RoBGuard: Enhancing LLMs to Assess Risk of Bias in Clinical Trial Documents (2025.coling-main)

Copied to clipboard

Challenge: Existing approaches to assess the risk of bias in RCTs focus on manually crafted prompts and a restricted set of simple questions, limiting their accuracy and generalizability.
Approach: They propose a framework for enhancing Large Language Models to assess the risk of bias in RCTs by reformulation, document parsing and multi-expert collaboration.
Outcome: The proposed framework outperforms existing methods on the RoB-Item and RoB domains.
Graph Chain-of-Thought: Augmenting Large Language Models by Reasoning on Graphs (2024.findings-acl)

Copied to clipboard

Challenge: Existing studies suggest augmenting LLMs with external text corpora to alleviate hallucination problems.
Approach: They propose to augment large language models with text units retrieved from external knowledge corpora to alleviate the issue.
Outcome: The proposed framework outperforms baselines on GRBench with three LLMs and shows that iterative reasoning outperformed the baselines.
Towards Non-task-specific Distillation of BERT via Sentence Representation Approximation (2020.aacl-main)

Copied to clipboard

Challenge: Existing methods for transferring knowledge from BERT into a model with large parameters are not efficient due to their large-scale and high computational cost.
Approach: They propose a sentence representation approximating oriented distillation framework that can distill pre-trained BERT into a simple LSTM based model without specifying tasks.
Outcome: The proposed model outperforms other distillation methods and larger models on multiple NLP tasks with efficiency well-improved.
Real or Robotic? Assessing Whether LLMs Accurately Simulate Qualities of Human Responses in Human-LLM Dialogue (2026.findings-acl)

Copied to clipboard

Challenge: Recent work has sought to use large language models to simulate human-human and human-LLM interactions.
Approach: They use a large-scale dataset to generate a paired LLM-LLM and human-LLm dialogues from the WildChat dataset and quantify how well they align with their human counterparts.
Outcome: The proposed models perform similarly in simulating English, Chinese, and Russian dialogues.
Pcc-tuning: Breaking the Contrastive Learning Ceiling in Semantic Textual Similarity (2024.emnlp-main)

Copied to clipboard

Challenge: Semantic Textual Similarity (STS) is a key indicator of the encoding capabilities of embedding models.
Approach: They propose to use Pearson’s correlation coefficient as a loss function to refine model performance beyond contrastive learning to achieve a Spearman’s ceiling.
Outcome: The proposed method surpasses state-of-the-art strategies with minimal amount of fine-grained annotated samples.
A Challenge Dataset and Effective Models for Conversational Stance Detection (2024.lrec-main)

Copied to clipboard

Challenge: stance detection studies focus on evaluating stances within individual instances, hindering progress of conversational stance analysis.
Approach: They propose a multi-turn conversation stance detection dataset that encompasses multiple targets for conversational stance detector.
Outcome: The proposed dataset encompasses multiple targets for conversational stance detection.
On the Generation of Medical Dialogs for COVID-19 (2021.acl-short)

Copied to clipboard

Challenge: under the pandemic of COVID-19, people experiencing COVI D19-related symptoms have a pressing need to consult doctors.
Approach: They develop a medical dialog system that can provide COVID19-related consultations . they use two dialog datasets containing conversations between doctors and patients .
Outcome: The proposed system can provide COVID19-related consultations, but is too small compared with general-domain dialog datasets.
Towards Generalizable and Robust Text-to-SQL Parsing (2022.findings-emnlp)

Copied to clipboard

Challenge: Text-to-SQL parsers must be generalizable and robust against input perturbations.
Approach: They propose a novel framework to learn text-to-SQL parsing in stages to improve parser's ability to acquire general SQL knowledge instead of capturing spurious patterns.
Outcome: The proposed framework achieves state-of-the-art performance on the Spider, SParC, and CoSQL datasets.
Rethinking Negative Instances for Generative Named Entity Recognition (2024.findings-acl)

Copied to clipboard

Challenge: Named Entity Recognition (NER) models are constrained by a pre-defined label set and require extensive human annotations, which limits their flexibility and adaptability to unseen tasks.
Approach: They propose a Generative NER system that shows improved zero-shot performance across unseen entity domains by introducing contextual information and delineating label boundaries.
Outcome: The proposed model outperforms state-of-the-art methods in zero-shot evaluation.
BertNet: Harvesting Knowledge Graphs with Arbitrary Relations from Pretrained Language Models (2023.findings-acl)

Copied to clipboard

Challenge: Existing methods to construct knowledge graphs are limited to a small set of relations due to manual cost or restrictions in text corpus.
Approach: They propose to automatically construct knowledge graphs (KGs) of diverse new relations from pretrained language models that accept knowledge queries with prompts.
Outcome: The proposed framework extracts knowledge of over 400 new relations from pretrained language models, including RoBERTaNet, with minimal input of a relation definition and a few shot of example entity pairs.
Improving Distantly-Supervised Named Entity Recognition with Self-Collaborative Denoising Learning (2021.emnlp-main)

Copied to clipboard

Challenge: Named entity recognition (NER) is a method of detecting entity spans and classifying them into predefined categories.
Approach: They propose a method to iteratively perform noisy label refinery by using self-collaborative denoising learning.
Outcome: The proposed learning paradigm exploits reliable labels and communicates with unreliable annotations by collaborative denoising.
Noise Learning for Text Classification: A Benchmark (2022.coling-1)

Copied to clipboard

Challenge: Existing noise learning methods for text classification are underdeveloped . authors propose a noise learning benchmark for text classification .
Approach: They propose to use four state-of-the-art methods of noise learning from the image domain to classify text.
Outcome: The proposed benchmark of noise learning for text classification is based on four methods and five noise modes.
Document-level Relation Extraction with Dual-tier Heterogeneous Graph (2020.coling-main)

Copied to clipboard

Challenge: Existing methods focus on extracting relations from single sentence . document-level relation extraction requires a comprehension of the whole document .
Approach: They propose a graph-based model with Dual-tier Heterogeneous Graph (DHG) for document-level relation extraction.
Outcome: The proposed model achieves state-of-the-art performance on two widely used datasets.
From Logical to Computational Sparsity: Structure-Aware Block-Sparse Attention for Long-Code Completion (2026.acl-long)

Copied to clipboard

Challenge: Existing sparse attention methods for long-context generation pose high latency . general sparsity methods cause excessive accuracy degradation without considering code structure .
Approach: They propose a training-free **S**tructure-**a**ware **b**lock-spa**r**s**e** attention mechanism that bridges the gap between logical and computational sparsity.
Outcome: The proposed method reduces TTFT by 45-55% while maintaining accuracy within 3% of dense attention.
DecIF: Improving Instruction-Following through Decomposition (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to obtain high-quality instruction-following data rely heavily on existing documents and existing methods.
Approach: They propose a data synthesis framework, DecIF, which automatically generates accurate and diverse instruction-following data from scratch for supervised fine-tuning and reinforcement learning.
Outcome: Extensive experiments show that the proposed framework can synthesize accurate instruction-following data for both SFT and RL paradigms compared to baselines.
Extract, Define, Canonicalize: An LLM-based Framework for Knowledge Graph Construction (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods for knowledge graph creation (KGC) are limited in their ability to scale up to text common in many real-world applications.
Approach: They propose a framework for knowledge graph creation from input text using a pre-defined schema and a trained component that retrieves schema elements relevant to the input text.
Outcome: The proposed framework extract-define-canonicalize extracts high-quality triplets with a succinct self-generated schema without any parameter tuning and with significantly larger schemas compared to prior works.
A Survey on Multi-modal Intent Recognition: Recent Advances and New Frontiers (2025.findings-emnlp)

Copied to clipboard

Challenge: Multi-modal intent recognition (MIR) requires integrating non-verbal cues from real-world contexts to enhance human intention understanding.
Approach: They present a comprehensive review of multi-modal intent recognition . they provide a survey of the field covering textual, visual, and acoustic signals .
Outcome: The present survey summarises the current state of multi-modal intent recognition . it includes a comprehensive taxonomy and advanced methods .
Cause-CSD: A Challenge Multimodal Conversational Stance Cause Detection Dataset and Effective Method (2026.findings-acl)

Copied to clipboard

Challenge: Existing stance detection methods treat opinions as surface-level labels, overlooking conversational evidence behind stance expressions.
Approach: They propose a task that jointly identifies stance polarity and contextual evidence . they propose stance-cause Detection language model that leverages explicit context reasoning .
Outcome: The proposed task outperforms baseline methods on text-only and multimodal subtasks.
SMR: State Memory Replay for Long Sequence Modeling (2024.findings-acl)

Copied to clipboard

Challenge: Existing state space models (SSMs) address non-uniform sampling, but their recursive structures impede efficient SSM computation via convolution.
Approach: They propose a plug-and-play mechanism to solve the Non-Stable State problem by adjusting input sequences with early memories.
Outcome: The proposed method overcomes the non-uniform sample processing problem . it can achieve Sampling Step Adaptation (SSA) by adjusting input sequences with early memories.
Debiasing Large Language Models via Adaptive Causal Prompting with Sketch-of-Thought (2026.findings-eacl)

Copied to clipboard

Challenge: Existing prompting methods for Large Language Models (LLMs) suffer from excessive token usage and limited generalisability across diverse reasoning tasks.
Approach: They propose an Adaptive Causal Prompting with Sketch-of-Thought framework that leverages structural causal models to infer the causal effect of a query on its answer.
Outcome: The proposed framework outperforms existing prompting baselines in terms of accuracy, robustness, and computational efficiency.
CRaSh: Clustering, Removing, and Sharing Enhance Fine-tuning without Full Large Language Model (2023.emnlp-main)

Copied to clipboard

Challenge: Instruction tuning is an effective way of aligning large language models with private instruction data.
Approach: They propose a training-free strategy to derive improved emulators from LLMs by using Offsite-Tuning (OFT) they propose CRaSh, which transfers transformer blocks between centralized LLM and downstream emulators .
Outcome: The proposed technique boosts performance of large language models with billions of parameters.
Sentiment Interpretable Logic Tensor Network for Aspect-Term Sentiment Analysis (2022.coling-1)

Copied to clipboard

Challenge: Aspect-term sentiment analysis (ATSA) is a fine-grained task that aims to infer the sentiment towards the given aspect-terms.
Approach: They propose a novel ATSA method that is interpretable and has high accuracy . they propose SILTN, which is a neurosymbolic formalism, to improve the accuracy based on syntax knowledge distillation.
Outcome: The proposed method is interpretable because it is a neurosymbolic formalism and a computational model that supports learning and reasoning about data with a differentiable first-order logic language.
AdaptFlow: Adaptive Workflow Optimization via Meta-Learning (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to large language models rely on static templates or manual workflows.
Approach: AdaptFlow is a language-based meta-learning framework inspired by model-agnostic meta- learning.
Outcome: AdaptFlow outperforms manual and automated workflows on question answering, code generation and mathematical reasoning benchmarks.
MoZIP: A Multilingual Benchmark to Evaluate Large Language Models in Intellectual Property (2024.lrec-main)

Copied to clipboard

Challenge: Large language models (LLMs) have demonstrated impressive performance in various natural language processing tasks.
Approach: They propose a benchmark for the evaluation of large language models in the IP domain . they also propose supervised multilingual large language model called MoZi .
Outcome: The proposed model outperforms four well-known LLMs on the MoZIP benchmark . the most powerful ChatGPT does not reach the passing level .
Stance Detection on Social Media with Background Knowledge (2023.emnlp-main)

Copied to clipboard

Challenge: Existing studies of stance detection focus on learning stance information about specific targets from context, but in real-world scenarios, we usually have a certain understanding of a target when we express our stance on it.
Approach: They propose to take the background knowledge of the target into account for better stance detection by categorizing it into episodic and discourse knowledge categories and a heuristic retrieval algorithm based on the topic to retrieve the Wikipedia documents relevant to the sample.
Outcome: The proposed framework achieves state-of-the-art on four benchmark datasets showing that the proposed framework is able to detect stances in-target and zero-shot scenarios.
Beyond Surface Features: Advancing Medical Vision-Language Alignment via Dynamic Evidence-Guided Preference Optimization (2026.acl-long)

Copied to clipboard

Challenge: Existing preference-based methods for medical large vision-Language Models face limitations in medical settings . existing methods are limited by overfitting to superficial cues and pseudo convergence of the preference signal.
Approach: They propose a framework that enables evidence-aware and adaptive preference learning for Med-LVLMs.
Outcome: The proposed framework improves evidence-aware and adaptive preference learning for Med-LVLMs.
FIHA: Automated Fine-grained Hallucinations Evaluations in Large Vision Language Models with Davidson Scene Graphs (2025.findings-acl)

Copied to clipboard

Challenge: Current approaches to large vision-language models rely on costly annotations and are not comprehensive in terms of evaluating all aspects.
Approach: They propose an automated method which can access LVLMs hallucination in an LLM-free and annotation-free way and model the dependency between different types of halluciNations.
Outcome: The proposed model can model the dependency between different types of hallucinations and generate Q&A pairs on any image dataset at minimal cost.
Causally Modeling the Linguistic and Social Factors that Predict Email Response (2025.naacl-long)

Copied to clipboard

Challenge: a key intent behind many emails is to get a reply from the recipient.
Approach: They propose to model the intents, expectations, and responsiveness in email exchanges by using a dataset containing 1800 emails annotated with nuanced types of intents and expectations.
Outcome: The proposed model is based on 1800 emails annotated with nuanced types of intents and expectations . it shows that social status, argumentation, and strength of social connection influence email response rates .
Large Language Models are Complex Table Parsers (2023.emnlp-main)

Copied to clipboard

Challenge: Extensive experiments and results on Complex Table QA datasets, i.e., the open-domain dataset HiTAB and the aviation domain dataset AIT-QA show that our approach significantly outperforms previous work on both datasets.
Approach: They propose to incorporate Generative Pre-trained Transformer 3.5 to address the specific challenges posed by Complex Table QA by reconstructing tables into tuples and using prompt templates to create dialogues.
Outcome: The proposed approach outperforms previous work on complex table parsing datasets and leads to state-of-the-art (SOTA) performance.
SPARK: Simulating the Co-evolution of Stance and Topic Dynamics in Online Discourse with LLM-based Agents (2025.emnlp-main)

Copied to clipboard

Challenge: a new framework for topic evolution and stance dynamics is needed to understand online discourse . topic evolution is central to understanding fragmentation of debates, spread of misinformation .
Approach: They propose a stance and topic evolution reasoning framework for co-evolution of topics and stances through natural language interactions.
Outcome: The proposed framework captures key empirical patterns across five real-world domains.
TPLinker: Single-stage Joint Extraction of Entities and Relations Through Token Pair Linking (2020.coling-main)

Copied to clipboard

Challenge: Existing methods to extract entities and relations from unstructured text are susceptible to cascading errors due to the separation of entity detection and relation classification.
Approach: They propose a one-stage joint extraction model that detects overlapping relations while being immune from exposure bias.
Outcome: The proposed model can identify overlapping relations while being immune from exposure bias.
Tree-Instruct: A Preliminary Study of the Intrinsic Relationship between Complexity and Alignment (2024.lrec-main)

Copied to clipboard

Challenge: Extensive research has highlighted the importance of data complexity as a crucial metric, but the impact of complexity remains relatively unexplored.
Approach: They propose to add a specified number of nodes to instructions’ semantic trees to enhance the instruction complexity in a controllable manner.
Outcome: The proposed approach outperforms diverse yet complex instructions under the same token budget and can control the difficulty level of modified instructions.
Enhancing Cross-target Stance Detection with Transferable Semantic-Emotion Knowledge (2020.acl-main)

Copied to clipboard

Challenge: Existing methods for stance detection are struggling to cope with the data across targets.
Approach: They propose a model that uses external knowledge as a bridge to enable knowledge transfer across different targets.
Outcome: The proposed model outperforms existing methods on a large real-world dataset.
Less Languages, Less Tokens: An Efficient Unified Logic Cross-lingual Chain-of-Thought Reasoning Framework (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for cross-lingual chain-of-thought (XCoT) with self-consistency are costly due to extensive sampling of full trajectories across languages.
Approach: They propose a cross-lingual chain-of-thought framework that minimizes redundancy in token usage and latency.
Outcome: Experiments on polymath show that UL-XCoT reduces decoding token costs and latency by 50% . UL XCot also aggregates remaining high-quality reasoning paths via voting .

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