Papers by Bowen Tang

19 papers
Multi-hop Reading Comprehension across Multiple Documents by Reasoning over Heterogeneous Graphs (P19-1)

Copied to clipboard

Challenge: Existing models to tackle multi-hop reading comprehension (RC) are focusing on a single document or paragraph, but they lack the ability to do reasoning across multiple documents.
Approach: They propose a heterogeneous document-entity graph with different types of nodes and edges to solve multi-hop RC problem.
Outcome: The proposed model can do reasoning over the proposed graph with nodes representation initialized with co-attention and self-attention based context encoders.
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.
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.
AgentTuning: Enabling Generalized Agent Abilities for LLMs (2024.findings-acl)

Copied to clipboard

Challenge: Open large language models (LLMs) with great performance in various tasks are far inferior to commercial models such as ChatGPT and GPT-4 when acting as agents to tackle complex tasks in the real world.
Approach: They propose a method to enhance the agent capabilities of LLMs while maintaining their general abilities.
Outcome: The AgentLM-70B is comparable to GPT-3.5-turbo on unseen agent tasks, demonstrating generalized agent capabilities.
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%.
Many Heads Are Better Than One: Improved Scientific Idea Generation by A LLM-Based Multi-Agent System (2025.acl-long)

Copied to clipboard

Challenge: Recent AI methods have shown promise in tasks such as hypothesis generation and experimental design, but they fail to replicate the collaborative nature of real-world scientific practices.
Approach: They propose a virtual scientific system that mimics the collaborative nature of scientific research by organizing a team of agents to generate, evaluate, and refine research ideas.
Outcome: The proposed system outperforms the state-of-the-art method in producing new scientific ideas and offers valuable insights to guide future research.
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.
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.
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%.
On the Editability of Delta Parameters in Post-Trained Models (2026.findings-acl)

Copied to clipboard

Challenge: Several studies have explored delta parameter properties via pruning, quantization, low-rank approximation, and extrapolation, but what properties of delta parameters are essential for maintaining performance?
Approach: They propose to examine delta parameter properties along magnitude and sign . they propose to use a loss-based local surrogate analysis to examine editing effects .
Outcome: The proposed analysis shows that delta parameters can be edited while maintaining performance.
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.
Orthogonal Relation Transforms with Graph Context Modeling for Knowledge Graph Embedding (2020.acl-main)

Copied to clipboard

Challenge: Existing knowledge graph embeddings have improved the knowledge graph link prediction task, but complex relations such as N-to-1, 1-to-N and N- to-N remain challenging to predict.
Approach: They propose to extend RotatE from 2D complex domain to high dimensional space with orthogonal transforms to model relations.
Outcome: The proposed method improves on N-to-1, 1-to-N and N- to-N cases while maintaining the capability for modeling symmetric/anti-symmetric, inverse and compositional relations.
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.
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.
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.
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.
LLMBox: A Comprehensive Library for Large Language Models (2024.acl-demos)

Copied to clipboard

Challenge: a library to facilitate the development, use, and evaluation of large language models (LLMs) is presented.
Approach: They propose a unified library to facilitate the development, use and evaluation of large language models (LLMs).
Outcome: The proposed library is based on extensive experiments in a variety of evaluation settings.

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