Papers by Bohan Yu

14 papers
AgentAsk: Multi-Agent Systems Need to Ask (2026.acl-long)

Copied to clipboard

Challenge: Multi-agent systems fail to consistently outperform strong single-a agent baselines due to error propagation at inter-aggent message handoffs.
Approach: They propose an edge-level error taxonomy that identifies four main errors in multi-agent interactions as data gaps, signal corruption, referential drift and capacity gaps as primary sources of failure.
Outcome: The proposed module outperforms existing systems on five benchmarks and is architecture-agnostic.
Hetero-Designer: Automated Design of Multi-Agent Systems with Heterogeneous LLMs (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to design LLM-based Multi-agent systems are constrained by homogeneous LLMs.
Approach: They propose an automated design of heterogeneous-LLMs-based MAS with a binary-star transformer and an autoregressive graph generation pipeline.
Outcome: The proposed pipeline is high-performing on various benchmarks and extensible to unseen LLMs and roles.
LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning (2024.findings-acl)

Copied to clipboard

Challenge: Low-rank adaption (LoRA) is a low-level pruning method that can be expensive and slow to deploy.
Approach: They propose a low-rank adaption pruning framework that provides an accurate structured pruned model in a memory-efficient manner.
Outcome: The proposed pruning framework reduces perplexity and memory usage by 52.6% on LLaMA and T5 models while reducing memory usage.
BSCodec: A Band-Split Neural Codec for High-Quality Universal Audio Reconstruction (2026.findings-eacl)

Copied to clipboard

Challenge: Neural audio codecs have enabled high-fidelity reconstruction of speech, music and sound . however, speech-optimized codec systems suffer degradation on music or sound if they ignore spectral differences .
Approach: They propose a neural audio codec that splits the spectral dimension into separate bands and compresses each band independently.
Outcome: Experimental results show that BSCodec achieves better reconstruction quality on music and sound compared to existing codecs.
SciCustom: A Framework for Custom Evaluation of Scientific Capabilities in Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing evaluations of large language models fail to reflect fine-grained capabilities . existing benchmarks are manually curated or domain-generic, limiting scalability and alignment with real use cases.
Approach: They propose a framework that allows custom construction of benchmarks from large-scale scientific data to evaluate application-specific scientific capabilities in LLMs.
Outcome: The proposed framework reveals fine-grained differences in scientific capabilities that standard benchmarks overlook . it allows custom construction of benchmarks from large-scale scientific data to evaluate application-specific capabilities in LLMs.
EvolKV: Evolutionary KV Cache Compression for LLM Inference (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing key-value (KV) cache compression methods ignore interplays between layer-specific feature patterns and task performance.
Approach: They propose an adaptive framework for layer-wise, task-driven KV cache compression that optimizes memory efficiency and task performance.
Outcome: EvolKV outperforms baseline methods on long-context tasks and surpasses heuristics by 7 percentage points on GSM8K.
TableLLM: Enabling Tabular Data Manipulation by LLMs in Real Office Usage Scenarios (2025.findings-acl)

Copied to clipboard

Challenge: TableLLM is a robust large language model capable of handling tabular data manipulation tasks.
Approach: They propose a distant supervision method for training which includes a reasoning process extension strategy and a cross-way validation strategy.
Outcome: The proposed model has 8 billion parameters and is capable of handling tabular data tasks.
MathAgent: Adversarial Evolution of Constraint Graphs for Mathematical Reasoning Data Synthesis (2026.findings-acl)

Copied to clipboard

Challenge: Current approaches to synthesising high-quality mathematical reasoning data without human priors suffer from mode collapse and limited logical complexity.
Approach: They propose a hierarchical synthesis framework that formulates data synthesis as an unsupervised optimization problem over a constraint graph followed by semantic instantiation rather than a direct text generation task.
Outcome: The proposed framework outperforms widely-used datasets on eight mathematical benchmarks.
CoT-based Synthesizer: Enhancing LLM Performance through Answer Synthesis (2025.acl-long)

Copied to clipboard

Challenge: Existing inference scaling methods rely heavily on the quality of candidate responses . however, they are unable to produce correct answers when all candidates are flawed .
Approach: They propose a CoT-based inference scaling strategy that leverages CoT reasoning to synthesize superior answers by analyzing complementary information from multiple candidate responses.
Outcome: The proposed method improves performance on four benchmark datasets with seven policy models.
From Signal Degradation to Computation Collapse: Uncovering the Two Failure Modes of LLM Quantization (2026.findings-acl)

Copied to clipboard

Challenge: Existing research on PTQ spans three primary directions.
Approach: They conduct a systematic analysis of post-training quantization failures using PTQ . they show that targeted repair can mitigate Signal Degradation but remains ineffective for Computation Collapse .
Outcome: The proposed method mitigates Signal Degradation but remains ineffective for Computation Collapse.
Task-Stratified Knowledge Scaling Laws for Post-Training Quantized Large Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing scaling laws focus on general performance, overlooking crucial fine-grained factors and how quantization differentially impacts diverse knowledge capabilities.
Approach: They propose a framework that unifies model size, bit-width, and fine-grained factors into memorization, application, and reasoning.
Outcome: The proposed framework shows strong fit and cross-architecture consistency on 293 different PTQ configurations.
TableEval: A Real-World Benchmark for Complex, Multilingual, and Multi-Structured Table Question Answering (2025.emnlp-main)

Copied to clipboard

Challenge: Existing TableQA benchmarks focus on simple flat tables and suffer from data leakage . current benchmarks are monolingual and fail to capture cross-lingual variability .
Approach: They propose a table-based TableQA benchmark to evaluate LLMs on real-world tasks.
Outcome: The proposed benchmarks show that they achieve high agreement with human judgment . the proposed framework improves on the alignment between model responses and reference answers .
CaDRL: Document-level Relation Extraction via Context-aware Differentiable Rule Learning (2025.coling-main)

Copied to clipboard

Challenge: Existing methods for document-level relation extraction (DocRE) lack logic and transparency.
Approach: They propose a Context-aware differentiable rule learning framework that learns the doc-specific logical rule to avoid suboptimal constraints.
Outcome: The proposed framework outperforms existing rule-based frameworks on three DocRE datasets.
Enhancing Open-Domain Task-Solving Capability of LLMs via Autonomous Tool Integration from GitHub (2025.acl-long)

Copied to clipboard

Challenge: Existing approaches lack flexibility to address diverse and ever-evolving user queries in open domains.
Approach: They propose to evaluate LLMs on open-domain knowledge that requires tools to solve diverse and ever-evolving user queries.
Outcome: The proposed system outperforms baselines in the open domain task-solving benchmark.

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